SIAM Journal on Scientific and Statistical Computing
Factorized sparse approximate inverse preconditionings I: theory
SIAM Journal on Matrix Analysis and Applications
A flexible inner-outer preconditioned GMRES algorithm
SIAM Journal on Scientific Computing
Parallel Preconditioning with Sparse Approximate Inverses
SIAM Journal on Scientific Computing
A Sparse Approximate Inverse Preconditioner for Nonsymmetric Linear Systems
SIAM Journal on Scientific Computing
A comparative study of sparse approximate inverse preconditioners
IMACS'97 Proceedings on the on Iterative methods and preconditioners
Robust Approximate Inverse Preconditioning for the Conjugate Gradient Method
SIAM Journal on Scientific Computing
A Scalable Parallel Algorithm for Incomplete Factor Preconditioning
SIAM Journal on Scientific Computing
International Journal of High Performance Computing Applications
Journal of Computational and Applied Mathematics
Journal of Computational and Applied Mathematics
Parallel inexact constraint preconditioners for saddle point problems
Euro-Par'11 Proceedings of the 17th international conference on Parallel processing - Volume Part II
A parallel exponential integrator for large-scale discretizations of advection-diffusion models
PVM/MPI'05 Proceedings of the 12th European PVM/MPI users' group conference on Recent Advances in Parallel Virtual Machine and Message Passing Interface
Advances in Engineering Software
Banded target matrices and recursive FSAI for parallel preconditioning
Numerical Algorithms
A generalized Block FSAI preconditioner for nonsymmetric linear systems
Journal of Computational and Applied Mathematics
Hi-index | 0.00 |
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.