Efficient Computation of Sparse Approximate Inverses

Research output: Contribution to journalArticlepeer-review

33 Scopus citations

Abstract

We investigate different methods for computing a sparse approximate inverse M for a given sparse matrix A by minimizing ||AM - E|| in the Frobenius norm. Such methods are very useful for deriving preconditioners in iterative solvers, especially in a parallel environment. We compare different strategies for choosing the sparsity structure of M and different ways for solving the small least squares problem that are related to the computation of each column of M. Especially we show how we can take full advantage of the sparsity of A.

Original languageEnglish
Pages (from-to)57-71
Number of pages15
JournalNumerical Linear Algebra with Applications
Volume5
Issue number1
DOIs
StatePublished - 1998

Keywords

  • Preconditioning
  • Sparse approximate inverse

Fingerprint

Dive into the research topics of 'Efficient Computation of Sparse Approximate Inverses'. Together they form a unique fingerprint.

Cite this