Is A C^n,n a general H-matrix?

DOI10.1016/J.LAA.2011.03.009MaRDI QIDQ651209zbMATH OpenOpenAlexFDO

Authors R. Bru, Isabel Giménez, A. Hadjidimos

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

zbMATH Keywords

numerical examplesalgorithm\(H\)-matricesirreduciblecomparison matrixreducibleFrobenius normal formgeneral \(H\)-matrices

Mathematics Subject Classification ID

Positive matrices and their generalizations; cones of matrices (15B48)

Recommendations

• Characterization of H-matrices
• scientific article; zbMATH DE number 2202149
• A new iterative criterion for \(H\)-matrices: The reducible case
• Classes of general H-matrices
• A new algorithmic characterization of \(H\)-matrices

Cites work

• 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?)
• A New Iterative Criterion for H‐Matrices
• A new iterative criterion for \(H\)-matrices: The reducible case
• 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
• 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

Cited in

(22)

• Self-corrective iterations (SCI) for generalized diagonally dominant matrices
• Comparison of three classes of algorithms for the solution of the linear complementarity problem with an \(H_+\)-matrix
• A two-step modulus-based matrix splitting iteration method for horizontal linear complementarity problems
• A modified modulus-based matrix splitting iteration method for solving implicit complementarity problems
• A new subclass of \(H\)-matrices
• The solution of the linear complementarity problem by the matrix analogue of the accelerated overrelaxation iterative method
• A linearly convergent iterative method for identifying H-matrices
• General \(H\)-matrices and their Schur complements
• An algorithm for identifying irreducible M-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
• Accurate determinants of some classes of matrices
• Error bounds for linear complementarity problems of Nekrasov matrices
• A note on Ostrowski's theorem
• A generalized Sassenfeld criterion and its relation to H-matrices
• On Brauer-Ostrowski and Brualdi sets
• 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
• Classes of general \(H\)-matrices
• Can one factor the classical adjoint of a generic matrix?
• A convergence analysis of SOR iterative methods for linear systems with weak \(H\)-matrices
• A relaxation modulus-based matrix splitting iteration method for solving linear complementarity problems

Describes a project that uses

Uses Software

• ITPACK

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)