Parallel preconditioning for sparse linear equations

H.A. Van Der Vorst, T.F. Chan

Research output: Contribution to journalArticlepeer-review

11 Scopus citations


A popular class of preconditioners is known as incomplete factorizations. They can be thought of as approximating the exact LU factorization of a given matrix A (e.g. computed via Gaussian elimination) by disallowing certain fill-ins. As opposed to other PDE-based preconditioners such as multigrid and domain decomposition, this class of preconditioners are primarily algebraic in nature and can in principle be applied to any sparse matrices. In this paper we will discuss some new viewpoints for the construction of effective preconditioners. In particular, we will discuss parallelization aspects, including re-ordering, series expansion and domain decomposition techniques. Generally, this class of preconditioner does not possess a high degree of parallelism in its original form. Re-ordering and approximations by truncating certain series expansion will increase the parallelism, but usually with a deterioration in convergence rate. Domain decomposition offers a compromise.
Original languageEnglish
Pages (from-to)167-170
Number of pages4
JournalZAMM Zeitschrift fur Angewandte Mathematik und Mechanik
Issue numberSUPPL. 3
StatePublished - 1996
Externally publishedYes


Dive into the research topics of 'Parallel preconditioning for sparse linear equations'. Together they form a unique fingerprint.

Cite this