Some results on sparse block factorization iterative methods
From MaRDI portal
Publication:756924
DOI10.1016/0024-3795(91)90295-8zbMATH Open0723.65019OpenAlexW1970648200MaRDI QIDQ756924FDOQ756924
Authors: Chun-Hua Guo 
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)
Cites Work
- An Iterative Solution Method for Linear Systems of Which the Coefficient Matrix is a Symmetric M-Matrix
- Incomplete blockwise factorizations of (block) H-matrices
- Title not available (Why is that?)
- Title not available (Why is that?)
- A Generalization of the Conjugate-Gradient Method to Solve Complex Systems
- An Incomplete Factorization Technique for Positive Definite Linear Systems
- NOTE ON M-MATRICES
- Block Preconditioning for the Conjugate Gradient Method
- A general incomplete block-matrix factorization method
- On Sparse Block Factorization Iterative Methods
- Incomplete Factorizations of Matrices and Connections with H-Matrices
- On some versions of incomplete block-matrix factorization iterative methods
Cited In (7)
- On some new approximate factorization methods for block tridiagonal matrices suitable for vector and parallel processors
- Title not available (Why is that?)
- Sparsified block elimination for directed laplacians
- A note on two block-SOR methods for sparse least squares problems
- Block-Krylov techniques in the context of sparse-FGLM algorithms
- Title not available (Why is that?)
- Incomplete block factorization preconditioning for linear systems arising in the numerical solution of the Helmholtz equation
This page was built for publication: Some results on sparse block factorization iterative methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q756924)
