Milyukova, O. Y. Parallel approximate factorization method for solving discrete elliptic equations. (English) Zbl 0969.68193 Parallel Comput. 27, No. 10, 1365-1379 (2001). Summary: 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. Cited in 4 Documents MSC: 68W25 Approximation algorithms 68W10 Parallel algorithms in computer science Keywords:iterative approximate factorization method Software:DRIC PDFBibTeX XMLCite \textit{O. Y. Milyukova}, Parallel Comput. 27, No. 10, 1365--1379 (2001; Zbl 0969.68193) Full Text: DOI