Multiple search direction conjugate gradient method I: methods and their propositions

In this article, we proposed a new CG-type method based on domain decomposition method, which is called multiple search direction conjugate gradient (MSD-CG) method. In each iteration, it uses a search direction in each subdomain. Instead of making all search directions conjugate to each other, as in the block CG method [O'Leary, D. P. (1980). The block conjugate gradient algorithm and related methods. Lin. Alg. Appl., 29, 293–322.], we require that they are nonzero in corresponding subdomains only. The GIPF-CG method, an approximate version of the MSD-CG method, only requires communication between neighboring subdomains and eliminate global inner product entirely. This method is therefore well suited for massively parallel computation. We give some propositions and a preconditioned version of the MSD-CG method.

[1]  M. Hestenes,et al.  Methods of conjugate gradients for solving linear systems , 1952 .

[2]  G. Meurant.  The block preconditioned conjugate gradient method on vector computers , 1984 .

[3]  Gérard Meurant.  Multitasking the conjugate gradient method on the CRAY X-MP/48 , 1987, Parallel Comput..

[4]  Victor Eijkhout,et al.  LAPACK Working Note 56: Reducing Communication Costs in the Conjugate Gradient Algorithm on Distributed Memory Multiprocessors , 1993 .

[5]  Achim Basermann.  Conjugate Gradient and Lanczos Methods for Sparse Matrices on Distributed Memory Multiprocessors , 1997, J. Parallel Distributed Comput..

[6]  Y. Saad.  Krylov subspace methods for solving large unsymmetric linear systems , 1981 .

[7]  Wei-Pai Tang,et al.  Generalized Schwarz Splittings , 1992, SIAM J. Sci. Comput..

[8]  Anthony T. Chronopoulos,et al.  s-step iterative methods for symmetric linear systems , 1989 .

[9]  Y. Saad,et al.  Krylov Subspace Methods on Supercomputers , 1989 .

[10]  Xuebin Chi,et al.  Multiple search direction conjugate gradient method II: theory and numerical experiments , 2004, Int. J. Comput. Math..

[11]  Eric de Sturler,et al.  A Performance Model for Krylov Subspace Methods on Mesh-Based Parallel Computers , 1996, Parallel Comput..

[12]  D. O’Leary.  The block conjugate gradient algorithm and related methods , 1980 .

[13]  O. Axelsson,et al.  A black box generalized conjugate gradient solver with inner iterations and variable-step preconditioning , 1991 .

[14]  R. Pavani,et al.  Parallel Numerical Linear Algebra , 1995, PDP.

[15]  Yousef Saad,et al.  Iterative methods for sparse linear systems , 2003 .

[16]  Achim Basermann,et al.  Preconditioned CG Methods for Sparse Matrices on Massively Parallel Machines , 1997, Parallel Comput..