MSP: A Class of Parallel Multistep Successive Sparse Approximate Inverse Preconditioning Strategies

DOI10.1137/S1064827502400832zbMath1034.65022OpenAlexW2015269712MaRDI QIDQ4442106

Kai Wang, Jun Zhang

Publication date: 20 January 2004

Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s1064827502400832

zbMATH Keywords

numerical experimentspreconditioningparallel computationsparse matricessparse approximate inversemultistage method

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Spectral, collocation and related methods for boundary value problems involving PDEs (65N35) Iterative numerical methods for linear systems (65F10) Parallel numerical computation (65Y05)

Related Items (8)

Application of an improved \(\mathrm{P}(m)\)-SOR iteration method for flow in partially saturated soils ⋮ Sparse Matrix Computational Techniques in Concept Decomposition Matrix Approximation ⋮ Robust dropping criteria for F-norm minimization based sparse approximate inverse preconditioning ⋮ FSAIPACK ⋮ Factored approximate inverse preconditioners with dynamic sparsity patterns ⋮ Banded target matrices and recursive FSAI for parallel preconditioning ⋮ A generalization of the optimal diagonal approximate inverse preconditioner ⋮ A two-phase preconditioning strategy of sparse approximate inverse for indefinite matrices

Uses Software

• BILUM
• SparseMatrix
• BILUTM
• ParaSails

This page was built for publication: MSP: A Class of Parallel Multistep Successive Sparse Approximate Inverse Preconditioning Strategies