Incomplete Sparse Approximate Inverses for Parallel Preconditioning

Hartwig Anzt, Thomas K Huckle, Jurgen Brackle, Jack Dongarra

Research output: Contribution to journalArticlepeer-review

Abstract

In this paper, we propose a new preconditioning method that can be seen as a generalization of block-Jacobi methods, or as a simplification of the sparse approximate inverse (SAI) preconditioners. The “Incomplete Sparse Approximate Inverses” (ISAI) is in particular efficient in the solution of sparse triangular linear systems of equations. Those arise, for example, in the context of incomplete factorization preconditioning. ISAI preconditioners can be generated via an algorithm providing fine-grained parallelism, which makes them attractive for hardware with a high concurrency level. In a study covering a large number of matrices, we identify the ISAI preconditioner as an attractive alternative to exact triangular solves in the context of incomplete factorization preconditioning.
Original languageEnglish
Number of pages22
JournalParallel Computing
Volume71
Early online date28 Oct 2017
DOIs
Publication statusPublished - Jan 2018

Keywords

  • Preconditioning
  • Incomplete Sparse Approximate Inverse
  • incomplete LU factorization
  • Appropriate sparse triangular solves
  • parallel computing

Fingerprint

Dive into the research topics of 'Incomplete Sparse Approximate Inverses for Parallel Preconditioning'. Together they form a unique fingerprint.

Cite this