The Community for Technology Leaders
Parallel Computing in Electrical Engineering, 2004. International Conference on (2002)
Warsaw, Poland
Sept. 22, 2002 to Sept. 25, 2002
ISBN: 0-7695-1730-7
pp: 318
Robert Piotr Bycul , Technical University of Bialystok
Andrzej Jordan , Technical University of Bialystok
Marcin Cichomski , Polish-Japanese Institute of Information Technology
<p>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.</p> <p>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.</p>

A. Jordan, M. Cichomski and R. P. Bycul, "A New Version of Conjugate Gradient Method Parallel Implementation," Parallel Computing in Electrical Engineering, 2004. International Conference on(PARELEC), Warsaw, Poland, 2002, pp. 318.
90 ms
(Ver 3.3 (11022016))