A stable method for the incomplete factorization of H-matrices
From MaRDI portal
The comparison matrix M(A) of a complex matrix A is defined by \[ m_{ij}=| a_{ii}| \quad if\quad i=j\text{ and } m_{ij}=- | a_{ij}| \quad otherwise. \] A matrix A is called an H-matrix if its comparison matrix is an M-matrix. In this way some results on incomplete factorization of M-matrices are generalized to H-matrices.
Recommendations
Cites work
- A note on factorizations of singular M-matrices
- A Stable Method for the $LU$ Factorization of M-Matrices
- 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
- scientific article; zbMATH DE number 3163242 (Why is no real title available?)
- scientific article; zbMATH DE number 3854346 (Why is no real title available?)
- scientific article; zbMATH DE number 3473182 (Why is no real title available?)
- NOTE ON M-MATRICES
- On the LU factorization of M-matrices
- Stable LU factorization of H-matrices
Cited in
(10)- Stable LU factorization of H-matrices
- On the stability of the incomplete LU-factorizations and characterizations of \(H\)-matrices
- Block ILU factorization preconditioners for a block-tridiagonal \(H\)-matrix
- Incomplete blockwise factorizations of (block) H-matrices
- Hyperbolic Householder Algorithms for Factoring Structured Matrices
- Stability of block LU factorization for block tridiagonal block H-matrices
- Extremal functions for real convex bodies
- Convergence of nonstationary multisplitting methods using ILU factorizations
- scientific article; zbMATH DE number 4186991 (Why is no real title available?)
- Limited-memory LDL\(^{\top}\) factorization of symmetric quasi-definite matrices with application to constrained optimization
This page was built for publication: A stable method for the incomplete factorization of H-matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q915360)