×

Parallel approximate factorization method for solving discrete elliptic equations. (English) Zbl 0969.68193

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.

MSC:

68W25 Approximation algorithms
68W10 Parallel algorithms in computer science

Software:

DRIC
PDFBibTeX XMLCite
Full Text: DOI