Multiple search direction conjugate gradient method I: methods and their propositions
Tong-Xiang Gu, Xingping Liu, Zeyao Mo et al. · International Journal of Computer Mathematics · 2004
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.
Cited by 29 works. doi:10.1080/00207160410001712305
Authors
References
- Methods of conjugate gradients for solving linear systems
- Iterative Methods for Sparse Linear Systems
- Krylov subspace methods for solving large unsymmetric linear systems
- The block conjugate gradient algorithm and related methods
- Krylov Subspace Methods on Supercomputers
- s-step iterative methods for symmetric linear systems
- Parallel numerical linear algebra
- A Black Box Generalized Conjugate Gradient Solver with Inner Iterations and Variable-Step Preconditioning
- The block preconditioned conjugate gradient method on vector computers
- Generalized Schwarz Splittings