International Conference on Parallel Computing in Electrical Engineering (PARELEC'02) A New Version of Conjugate Gradient Method Parallel Implementation Warsaw, Poland September 22-September 25 ISBN: 0-7695-1730-7
In the article the authors describe an idea of parallel implementation of a conjugate gradient method in a heterogeneous PC cluster and a supercomputer Hitachi SR-2201. The new version of algorithm implementation differs from the one applied earlier [1], because it uses a special method for storing sparse coefficient matrices: only non-zero elements are stored and taken into account during computations, so that the sparsity of the coefficient matrix is taken full advantage of. The article includes a comparison of the two versions. A speedup of the parallel algorithm has been examined for three different cases of coefficient matrices resulting in solving different physical problems. The authors have also investigated a preconditioning method, which uses the inversed diagonal of the coefficient matrix, as a preconditioning matrix.
Citation:
Robert Piotr Bycul, Andrzej Jordan, Marcin Cichomski, "A New Version of Conjugate Gradient Method Parallel Implementation," parelec, pp.318, International Conference on Parallel Computing in Electrical Engineering (PARELEC'02), 2002 Usage of this product signifies your acceptance of the Terms of Use. | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb