Sparse Approximate Inverses and Target Matrices

DOI10.1137/030601132zbMath1077.65044OpenAlexW2029087005MaRDI QIDQ4652365

G. J. Shaw, Ruth M. Holland, Andrew J. Wathen

Publication date: 25 February 2005

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

Full work available at URL: https://semanticscholar.org/paper/b6f71d0cf36d72e89c839400c6326576cee4d0c1

zbMATH Keywords

numerical examplespreconditioningparallel computationlinear least squares problemssparse approximate inversestarget matrices

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35)

Related Items

Geometrical and spectral properties of the orthogonal projections of the identity ⋮ Frobenius norm minimization and probing for preconditioning ⋮ Robust dropping criteria for F-norm minimization based sparse approximate inverse preconditioning ⋮ Preconditioning for sparse linear systems at the dawn of the 21st century: history, current developments, and future perspectives ⋮ A numerical study on preconditioning and partitioning schemes for reactive transport in a PEMFC catalyst layer ⋮ Banded target matrices and recursive FSAI for parallel preconditioning ⋮ Smoothing and regularization with modified sparse approximate inverses ⋮ An efficient parallel implementation of the MSPAI preconditioner ⋮ Incremental incomplete LU factorizations with applications ⋮ Preconditioning Parametrized Linear Systems ⋮ The effect of graph partitioning techniques on parallel block FSAI preconditioning: a computational study