Some results on sparse block factorization iterative methods
From MaRDI portal
Publication:756924
DOI10.1016/0024-3795(91)90295-8zbMath0723.65019OpenAlexW1970648200MaRDI QIDQ756924
Publication date: 1991
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0024-3795(91)90295-8
Computational methods for sparse matrices (65F50) Iterative numerical methods for linear systems (65F10)
Related Items
Incomplete block factorization preconditioning for linear systems arising in the numerical solution of the Helmholtz equation, On some new approximate factorization methods for block tridiagonal matrices suitable for vector and parallel processors
Cites Work
- Unnamed Item
- Unnamed Item
- On some versions of incomplete block-matrix factorization iterative methods
- A general incomplete block-matrix factorization method
- Incomplete blockwise factorizations of (block) H-matrices
- Block Preconditioning for the Conjugate Gradient Method
- NOTE ON M-MATRICES
- On Sparse Block Factorization Iterative Methods
- An Incomplete Factorization Technique for Positive Definite Linear Systems
- Incomplete Factorizations of Matrices and Connections with H-Matrices
- An Iterative Solution Method for Linear Systems of Which the Coefficient Matrix is a Symmetric M-Matrix
- A Generalization of the Conjugate-Gradient Method to Solve Complex Systems
