Toward an Effective Sparse Approximate Inverse Preconditioner

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 fro...

Full description

Saved in:
Bibliographic Details
Published in:SIAM journal on matrix analysis and applications 1999, Vol.20 (4), p.970-986
Main Author: Tang, Wei-Pai
Format: Article
Language:English
Subjects:
Approximation
Computer science
Contamination
Sparsity
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:0895-4798
1095-7162
DOI:10.1137/S0895479897320071