The Preconditioned Conjugate Gradient Method on Distributed Memory Systems
暂无分享,去创建一个
We present an implementation method for the preconditioned conjugate gradient algorithm with geometric domain decomposition. The results of some experiments on both a 4 processor- and a 512 processor system are presented and expectations for the implementation on more processors are discussed.
[1] Jack J. Dongarra,et al. Solving linear systems on vector and shared memory computers , 1990 .
[2] E. F. DAzevedo,et al. Reducing communication costs in the conjugate gradient algorithm on distributed memory multiprocessors , 1992 .
[3] Anthony T. Chronopoulos,et al. s-step iterative methods for symmetric linear systems , 1989 .
[4] James Demmel,et al. Parallel numerical linear algebra , 1993, Acta Numerica.
[5] Y. Saad,et al. Krylov Subspace Methods on Supercomputers , 1989 .