A linearly convergent iterative method for identifying H-matrices
From MaRDI portal
Publication:5240730
DOI10.1080/03081087.2018.1494696zbMath1436.65052OpenAlexW2883111653MaRDI QIDQ5240730
Zhaohui Huang, Li-ping Zhang, Jun-Jie Yue
Publication date: 29 October 2019
Published in: Linear and Multilinear Algebra (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/03081087.2018.1494696
Computational methods for sparse matrices (65F50) Numerical solutions to overdetermined systems, pseudoinverses (65F20) Conditioning of matrices (15A12)
Related Items
Cites Work
- Unnamed Item
- Sparse solutions of linear complementarity problems
- Minimal zero norm solutions of linear complementarity problems
- New criteria for identifying \(H\)-matrices
- Is \(A\in\mathbb C^{n,n}\) a general \(H\)-matrix?
- A new iterative criterion for \(H\)-matrices: The reducible case
- Classes of general \(H\)-matrices
- Criteria for generalized diagonally dominant matrices and \(M\)-matrices
- An iterative criterion for \(H\)-matrices
- Simple criteria for nonsingular H-matrices.
- A new criterion for the H-matrix property
- An extended compact profile iterative method criterion for sparse \(H\)-matrices
- A note on generalized diagonally dominant matrices
- An iterative test for \(H\)-matrix
- Criteria for generalized diagonally dominant matrices and \(M\)-matrices. II
- A nonparameter criterion for generalized diagonally dominant matrices
- On the Iterative Criterion for Generalized Diagonally Dominant Matrices
- A New Iterative Criterion for H‐Matrices
