Block approximate inverse preconditioners for sparse nonsymmetric linear systems
From MaRDI portal
Publication:964129
zbMath1191.65023MaRDI QIDQ964129
Publication date: 14 April 2010
Published in: ETNA. Electronic Transactions on Numerical Analysis (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/232615
block algorithmsSherman-Morrison-Woodbury formulaapproximate inverse preconditionersKrylov iterative methodsvariable rank updates
Computational methods for sparse matrices (65F50) Iterative numerical methods for linear systems (65F10) Preconditioners for iterative methods (65F08)
Related Items (5)
A Block Compression Algorithm for Computing Preconditioners ⋮ On an augmented Lagrangian-based preconditioning of Oseen type problems ⋮ Supporting theory for a block approximate inverse preconditioner ⋮ Low-rank updates of balanced incomplete factorization preconditioners ⋮ The effect of graph partitioning techniques on parallel block FSAI preconditioning: a computational study
Uses Software
This page was built for publication: Block approximate inverse preconditioners for sparse nonsymmetric linear systems
