A polynomial-time test for M-matrices

DOI10.1016/0024-3795(91)90218-LzbMath0728.65037MaRDI QIDQ805154

Hannu Väliaho

Publication date: 1991

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

zbMATH Keywords

matrix inversionM-matricesZ-matricescomplexity orderpolynomial-time test

Mathematics Subject Classification ID

Positive matrices and their generalizations; cones of matrices (15B48) Miscellaneous inequalities involving matrices (15A45) Direct numerical methods for linear systems and matrix inversion (65F05)

Related Items (3)

The Boolean pivot operation, \(M\)-matrices, and reducible matrices ⋮ On testing nonnegativity of principal minors of \({\mathbf{Z}} \)-matrices using simplex method ⋮ Perturbations of \(M\)-matrices via ABS methods and their applications to input-output analysis

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A polynomial algorithm for testing the nonnegativity of principal minors of Z-matrices
• On the inverse M-matrix problem for (0,1)-matrices
• Nonnegative matrices with power invariant zero patterns
• Inverse M-matrices
• A generalization of N-matrices
• The general quadratic optimization problem

This page was built for publication: A polynomial-time test for M-matrices