Approximate inverse preconditionings for sparse linear systems
DOI10.1080/00207169208804097zbMath0762.65025OpenAlexW1987573671WikidataQ57389701 ScholiaQ57389701MaRDI QIDQ4021058
No author found.
Publication date: 17 January 1993
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207169208804097
numerical examplesparallel computationsparse linear systemsadaptive methodcondition number estimatesinverse preconditioningsminimum-residual-type iterative method
Computational methods for sparse matrices (65F50) Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35) Direct numerical methods for linear systems and matrix inversion (65F05)
Related Items (37)
Cites Work
- Optimal preconditioners of a given sparsity pattern
- Explicit preconditioning of systems of linear algebraic equations with dense matrices
- Fully vectorizable block preconditionings with approximate inverses for non-symmetric systems of equations
- Block Preconditioning for the Conjugate Gradient Method
- Parallel algorithms for the solution of certain large sparse linear systems
- On Minimizing the Special Radius of a Nonsymmetric Matrix Function: Optimality Conditions and Duality Theory
- Unnamed Item
- Unnamed Item
This page was built for publication: Approximate inverse preconditionings for sparse linear systems