ParIC: A Family of Parallel Incomplete Cholesky Preconditioners

A class of parallel incomplete factorization preconditionings for the solution of large linear systems is investigated. The approach may be regarded as a generalized domain decomposition method. Adjacent subdomains have to communicate during the setting up of the preconditioner, and during the application of the preconditioner. Overlap is not necessary to achieve high performance. Fill-in levels are considered in a global way. If necessary, the technique may be implemented as a global re-ordering of the unknowns. Experimental results are reported for two-dimensional problems.

• Type: Conference
• Year: 2000
• Where: HPCN
• Authors: Mardochée Magolu monga Made, Henk A. van der Vorst
• Keywords: Distributed And Parallel Computing, Generalized Domain Decomposition, HPCN 2000, Large Linear Systems, Parallel Incomplete Factorization