A comparative study of sparse approximate inverse preconditioners

被引：188

作者：

Benzi, M

Tuma, M

机构：

[1] Los Alamos Natl Lab, Los Alamos, NM 87545 USA

[2] Acad Sci Czech Republ, Inst Comp Sci, Prague 18207 8, Czech Republic

来源：

APPLIED NUMERICAL MATHEMATICS | 1999年 / 30卷 / 2-3期

关键词：

sparse linear systems; sparse matrices; preconditioned Krylov subspace methods; incomplete factorizations; factorized approximate inverses; SPAI; FSAI; incomplete biconjugation;

D O I：

10.1016/S0168-9274(98)00118-4

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

A number of recently proposed preconditioning techniques based on sparse approximate inverses are considered. A description of the preconditioners is given, and the results of an experimental comparison performed on one processor of a Gray C98 vector computer using sparse matrices from a variety of applications are presented. A comparison with more standard preconditioning techniques, such as incomplete factorizations, is also included. Robustness, convergence rates, and implementation issues are discussed, (C) 1999 Elsevier Science B.V. and IMACS. All rights reserved.

引用

页码：305 / 340

页数：36

共 82 条

[1] Sparse approximate inverse preconditioning for dense linear systems arising in computational electromagnetics [J].