Is A C^n,n a general H-matrix?
The aim of the paper is to develop an algorithm that determines the \(H\)-matrix character and identifies the class to which a given matrix \(A\in\mathbf C^{n,n}\) belongs. The first section is an introduction in nature. The second section presents the basic notation and definitions, and the required background material is presented. Also, some new results on classes of \(H\)- and non-\(H\)-matrices are summarized. The two parts of the third section develop the IRR algorithm, whose purpose is to determine the irreducible character of a square complex matrix. In the fourth section, based on the previous results the authors present the complete algorithm to determine the irreducible/reducible character as well the \(H\)-/non-\(H\)-matrix character and the class of a general matrix \(A\in\mathbf C^{n,n}\). In order to support the theory, the fifth section gives some numerical examples that cover all six mutually exclusive classes of \(H\)-/non-\(H\)-matrices.
- A new iterative criterion for \(H\)-matrices: The reducible case
- A New Iterative Criterion for H‐Matrices
- Algorithm 586: ITPACK 2C: A FORTRAN Package for Solving Large Sparse Linear Systems by Adaptive Accelerated Iterative Methods
- An extended compact profile iterative method criterion for sparse \(H\)-matrices
- An iterative criterion for \(H\)-matrices
- Classes of general H-matrices
- scientific article; zbMATH DE number 3124012 (Why is no real title available?)
- scientific article; zbMATH DE number 194139 (Why is no real title available?)
- scientific article; zbMATH DE number 734901 (Why is no real title available?)
- scientific article; zbMATH DE number 2120941 (Why is no real title available?)
- scientific article; zbMATH DE number 3215568 (Why is no real title available?)
- On recurring theorems on diagonal dominance
- On the Iterative Criterion for Generalized Diagonally Dominant Matrices
- Schur complement of general H-matrices
- Solution of nonsymmetric, linear complementarity problems by iterative methods
- A new subclass of \(H\)-matrices
- Comparison of three classes of algorithms for the solution of the linear complementarity problem with an \(H_+\)-matrix
- 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
- On the solution of the linear complementarity problem by the generalized accelerated overrelaxation iterative method
- The matrix analogue of the scalar AOR iterative method
- A note on Ostrowski's theorem
- On Brauer-Ostrowski and Brualdi sets
- A two-step modulus-based matrix splitting iteration method for horizontal linear complementarity problems
- Self-corrective iterations (SCI) for generalized diagonally dominant matrices
- An algorithm for identifying irreducible M-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
- Error bounds for linear complementarity problems of Nekrasov matrices
- A relaxation modulus-based matrix splitting iteration method for solving linear complementarity problems
- A linearly convergent iterative method for identifying H-matrices
- A generalized Sassenfeld criterion and its relation to H-matrices
- An accurate chase-like iterative algorithm for H-matrices
- Accurate determinants of some classes of matrices
- Can one factor the classical adjoint of a generic matrix?
- Classes of general H-matrices
This page was built for publication: Is \(A\in\mathbb C^{n,n}\) a general \(H\)-matrix?
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q651209)
