Parallel Acceleration of Krylov Solvers by Factorized Approximate Inverse Preconditioners

This paper describes and tests a parallel implementation of a factorized approximate inverse preconditioner (FSAI) to accelerate iterative linear system solvers. Such a preconditioner reveals an efficient accelerator of both Conjugate gradient and BiCGstab iterative methods in the parallel solution...

Full description

Saved in:
Bibliographic Details
Published inHigh Performance Computing for Computational Science - VECPAR 2004 pp. 623 - 636
Main Authors Bergamaschi, Luca, Martínez, Ángeles
Format Book Chapter Conference Proceeding
LanguageEnglish
Published Berlin, Heidelberg Springer Berlin Heidelberg 2005
Springer
SeriesLecture Notes in Computer Science
Subjects
Online AccessGet full text
ISBN9783540254249
3540254242
ISSN0302-9743
1611-3349
DOI10.1007/11403937_47

Cover

More Information
Summary:This paper describes and tests a parallel implementation of a factorized approximate inverse preconditioner (FSAI) to accelerate iterative linear system solvers. Such a preconditioner reveals an efficient accelerator of both Conjugate gradient and BiCGstab iterative methods in the parallel solution of large linear systems arising from the discretization of the advection-diffusion equation. The resulting message passing code allows the solution of large problems leading to a very cost-effective algorithm for the solution of large and sparse linear systems.
ISBN:9783540254249
3540254242
ISSN:0302-9743
1611-3349
DOI:10.1007/11403937_47