Is \(A\in\mathbb C^{n,n}\) a general \(H\)-matrix?
From MaRDI portal
Publication:651209
DOI10.1016/j.laa.2011.03.009zbMath1234.65026OpenAlexW171369683MaRDI QIDQ651209
Isabel Giménez, Apostolos Hadjidimos, Rafael Bru
Publication date: 8 December 2011
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2011.03.009
algorithmnumerical examplesirreducible\(H\)-matricesFrobenius normal formcomparison matrixreduciblegeneral \(H\)-matrices
Related Items
Self-corrective iterations (SCI) for generalized diagonally dominant matrices ⋮ Accurate determinants of some classes of matrices ⋮ A convergence analysis of SOR iterative methods for linear systems with weak \(H\)-matrices ⋮ The solution of the linear complementarity problem by the matrix analogue of the accelerated overrelaxation iterative method ⋮ A two-step modulus-based matrix splitting iteration method for horizontal linear complementarity problems ⋮ A generalized Sassenfeld criterion and its relation to H-matrices ⋮ Comparison of three classes of algorithms for the solution of the linear complementarity problem with an \(H_+\)-matrix ⋮ A note on Ostrowski's theorem ⋮ On Brauer-Ostrowski and Brualdi sets ⋮ Error bounds for linear complementarity problems of Nekrasov matrices ⋮ A relaxation modulus-based matrix splitting iteration method for solving linear complementarity problems ⋮ General \(H\)-matrices and their Schur complements ⋮ A modified modulus-based matrix splitting iteration method for solving implicit complementarity problems ⋮ Infinity norm bounds for the inverse of Nekrasov matrices using scaling matrices ⋮ On convergence of the modulus-based matrix splitting iteration method for horizontal linear complementarity problems of \(H_+\)-matrices ⋮ A linearly convergent iterative method for identifying H-matrices ⋮ On the solution of the linear complementarity problem by the generalized accelerated overrelaxation iterative method ⋮ The matrix analogue of the scalar AOR iterative method
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new iterative criterion for \(H\)-matrices: The reducible case
- Classes of general \(H\)-matrices
- Solution of nonsymmetric, linear complementarity problems by iterative methods
- On recurring theorems on diagonal dominance
- An iterative criterion for \(H\)-matrices
- An extended compact profile iterative method criterion for sparse \(H\)-matrices
- Schur complement of generalH-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
- A New Iterative Criterion for H‐Matrices