Refining an approximate inverse
type: Item
instance of: scholarly article
title: Refining an approximate inverse
zbMATH Open document ID: 0982.65035
DOI: 10.1016/S0377-0427(00)00399-X
author: Robert Bridson
author: Wei-Pai Tang
published in: Journal of Computational and Applied Mathematics
publication date: 2000-12-19T00:00:00Z
review text: The authors propose algorithmic techniques for improving the performance of stabilized sparse approximate inverse (SAINV) preconditioners for general regular matrices \(A\). The SAINV preconditioners are then used to accelerate some Krylov space method for solving linear systems of the form \(Ax=b\). The algorithmic techniques (symbolic factorization, reordering etc.) are basically borrowed from the direct factorization algorithms. The authors also extend this approach to the block case.
reviewed by: Ulrich Langer
Mathematics Subject Classification ID: 65F10
Mathematics Subject Classification ID: 65Y20
Mathematics Subject Classification ID: 65F35
Mathematics Subject Classification ID: 68W30
zbMATH DE Number: 1546551
zbMATH Keywords: Krylow space methods
zbMATH Keywords: preconditioners
zbMATH Keywords: approximate inverse
zbMATH Keywords: ordering
zbMATH Keywords: cache
zbMATH Keywords: performance
zbMATH Keywords: symbolic factorization
describes a project that uses: ATLAS
describes a project that uses: symrcm
MaRDI profile type: Publication
cites work: Robust approximate inverse preconditioning for the conjugate gradient method
cites work: A Sparse Approximate Inverse Preconditioner for the Conjugate Gradient Method
cites work: A Sparse Approximate Inverse Preconditioner for Nonsymmetric Linear Systems
cites work: Orderings for Factorized Sparse Approximate Inverse Preconditioners
cites work: Algebraic multigrid by smoothed aggregation for second and fourth order elliptic problems
cites work: Ordering, Anisotropy, and Factored Sparse Approximate Inverses
cites work: Exploiting Structural Symmetry in Unsymmetric Sparse Symbolic Factorization
cites work: Q3664299
cites work: Elimination Structures for Unsymmetric Sparse $LU$ Factors
cites work: Predicting Structure in Sparse Matrix Computations
cites work: A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
cites work: Generalized Nested Dissection
cites work: A compact row storage scheme for Cholesky factors using elimination trees
cites work: The Role of Elimination Trees in Sparse Factorization
cites work: On Finding Supernodes for Sparse Matrix Computations
Recommended article: Improving the Accuracy of Inverse Iteration
Recommended article: Q3099055
Recommended article: Inverse approximate reasoning
Recommended article: Q3027700
Recommended article: Q4878610
Recommended article: Approximate inverse for linear and some nonlinear problems
Recommended article: Q3486815
Recommended article: The method of approximate inverse: Theory and applications
description: scientific article; zbMATH DE number 1546551