An extended compact profile iterative method criterion for sparse \(H\)-matrices

DOI10.1016/j.laa.2004.03.011zbMath1058.65040OpenAlexW1987534307MaRDI QIDQ1887628

Apostolos Hadjidimos

Publication date: 22 November 2004

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2004.03.011

zbMATH Keywords

successive overrelaxationGauss-Seidel methodJacobi methodprofile methodlarge sparse matrixstrictly diagonally dominant matricescriteria for \(H\)-matrices\(Z\)-, \(M\)- and \(H\)-matrices

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Iterative numerical methods for linear systems (65F10)

Related Items (6)

On iterative criteria for H- and non-H-matrices ⋮ Fast verified solutions of linear systems ⋮ Is \(A\in\mathbb C^{n,n}\) a general \(H\)-matrix? ⋮ A new iterative criterion for \(H\)-matrices: The reducible case ⋮ A parallel characterization of H-matrices ⋮ A linearly convergent iterative method for identifying H-matrices

Uses Software

• ITPACK

Cites Work

• 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
• A note on generalized diagonally dominant matrices
• An iterative test for \(H\)-matrix
• Criteria for generalized diagonally dominant matrices and \(M\)-matrices. II
• An extension of the criteria for generalized diagonally dominant matrices
• Algorithm 586: ITPACK 2C: A FORTRAN Package for Solving Large Sparse Linear Systems by Adaptive Accelerated Iterative Methods
• On the Iterative Criterion for Generalized Diagonally Dominant Matrices
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An extended compact profile iterative method criterion for sparse \(H\)-matrices