Parallel approximate factorization method for solving discrete elliptic equations
An iterative approximate factorization method is proposed for solving elliptic equations on a rectangular computational domain on distributed memory parallel computers. The method is based on the conjugate gradient algorithm with modified incomplete factorization preconditioning (MICCG(0)) and the use of a domain-decomposition-like ordering of unknowns. The rate of convergence and the efficiency of the proposed method are investigated. (C) 2001 Elsevier Science BN. All rights reserved.
approximate factorization parallel computations discrete elliptic problem preconditioned conjugate gradient method