Toward an Effective Sparse Approximate Inverse Preconditioner

Authors:
Wei-Pai Tang
Affiliations:
-
Venue:
SIAM Journal on Matrix Analysis and Applications
Year:
1999

Citing 0
Cited 5

Sparse approximate inverse smoothers for geometric and algebraic multigrid

Applied Numerical Mathematics - Developments and trends in iterative methods for large systems of equations—in memoriam Rüdiger Weiss
The effect of orderings on sparse approximate inverse preconditioners for non-symmetric problems

Advances in Engineering Software - Engineering computational technology
Almost optimal order approximate inverse based preconditioners for 3-d convection dominated problems on tensor-grids

International Journal of Computing Science and Mathematics
Dirichlet degrees of freedom need not be eliminated

Applied Numerical Mathematics
On the Gauss, Cholesky and Householder algorithms

Advances in Engineering Software

Quantified Score

Hi-index	0.00

Visualization

Abstract

Sparse approximate inverse preconditioners have attracted much attention recently, because of their potential usefulness in a parallel environment. In this paper, we explore several performance issues related to effective sparse approximate inverse preconditioners (SAIPs) for the matrices derived from PDEs. Our refinements can significantly improve the quality of existing SAIPs and/or reduce the cost of computing them. For the test problems from the Harwell--Boeing collection and some other applications, the performance of our preconditioners can be comparable or superior to incomplete LU (ILU) preconditioners with similar preconditioning cost.