A parallel algorithm to approximate inverse factors of a matrix via sparse-sparse iterations

DOI10.1016/j.amc.2006.02.006zbMath1155.65320OpenAlexW2074180397MaRDI QIDQ945424

Davod Khojasteh Salkuyeh, Saeed Karimi, Faezeh Toutounian

Publication date: 12 September 2008

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2006.02.006

zbMATH Keywords

preconditioningsparse matricesKrylov subspace methodsparallelAIB algorithmBAIB algorithminverse factors

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05)

Uses Software

• ILUS
• SPARSKIT
• CGS
• Harwell-Boeing sparse matrix collection

Cites Work

• Unnamed Item
• Unnamed Item
• A sparse-sparse iteration for computing a sparse incomplete factorization of the inverse of an SPD matrix
• A comparative study of sparse approximate inverse preconditioners
• A block version algorithm to approximate inverse factors
• A sparse approximate inverse preconditioner for parallel preconditioning of general sparse matrices
• Preconditioning techniques for large linear systems: A survey
• GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
• Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
• Factorized Sparse Approximate Inverse Preconditionings I. Theory
• Parallel Preconditioning with Sparse Approximate Inverses
• ILUS: An incomplete LU preconditioner in sparse skyline format
• Approximate Inverse Techniques for Block-Partitioned Matrices
• Sparse Approximate-Inverse Preconditioners Using Norm-Minimization Techniques
• A Sparse Approximate Inverse Preconditioner for Nonsymmetric Linear Systems
• Approximate Inverse Preconditioners via Sparse-Sparse Iterations
• Iterative Solution Methods