Ordering, Anisotropy, and Factored Sparse Approximate Inverses

DOI10.1137/S1064827598335842zbMath0955.65018MaRDI QIDQ4702416

Robert Bridson, Wei-Pai Tang

Publication date: 24 November 1999

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

zbMATH Keywords

convergencenumerical examplesanisotropypreconditionerKrylov subspace methodapproximate inverseordering methodsminimum inverse penaltysparse inverse 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

Graph coarsening: from scientific computing to machine learning, \(\mathcal H\)-FAINV: hierarchically factored approximate inverse preconditioners, Iterative Solvers for Elliptic Problems with Arbitrary Anisotropy Strengths, Sparse approximate inverse preconditioners on high performance GPU platforms, Stabilized and block approximate inverse preconditioners for problems in solid and structural mechanics, Preconditioning of Linear Least Squares by Robust Incomplete Factorization for Implicitly Held Normal Equations, Matrix Reordering Using Multilevel Graph Coarsening for ILU Preconditioning, Refining an approximate inverse, The effect of graph partitioning techniques on parallel block FSAI preconditioning: a computational study, Preconditioning techniques for large linear systems: A survey