Some results on sparse block factorization iterative methods
From MaRDI portal
Publication:756924
Convergence and existence theorems are developed for the general case of the general sparse block factorization iterative method.
Cites work
- A general incomplete block-matrix factorization method
- A Generalization of the Conjugate-Gradient Method to Solve Complex Systems
- An Incomplete Factorization Technique for Positive Definite Linear Systems
- An Iterative Solution Method for Linear Systems of Which the Coefficient Matrix is a Symmetric M-Matrix
- Block Preconditioning for the Conjugate Gradient Method
- scientific article; zbMATH DE number 3736894 (Why is no real title available?)
- scientific article; zbMATH DE number 3215568 (Why is no real title available?)
- Incomplete blockwise factorizations of (block) H-matrices
- Incomplete Factorizations of Matrices and Connections with H-Matrices
- NOTE ON M-MATRICES
- On some versions of incomplete block-matrix factorization iterative methods
- On Sparse Block Factorization Iterative Methods
Cited in
(7)- On some new approximate factorization methods for block tridiagonal matrices suitable for vector and parallel processors
- A note on two block-SOR methods for sparse least squares problems
- Incomplete block factorization preconditioning for linear systems arising in the numerical solution of the Helmholtz equation
- Block-Krylov techniques in the context of sparse-FGLM algorithms
- scientific article; zbMATH DE number 6533779 (Why is no real title available?)
- scientific article; zbMATH DE number 3992794 (Why is no real title available?)
- Sparsified block elimination for directed laplacians
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)
