A polynomial-time test for M-matrices

DOI10.1016/0024-3795(91)90218-LzbMATH Open0728.65037MaRDI QIDQ805154FDOQ805154

Authors: Hannu Väliaho 

Publication date: 1991

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

Recommendations

• On testing nonnegativity of principal minors of \({\mathbf{Z}} \)-matrices using simplex method
• A stable test to check if a matrix is a nonsingular $M$-matrix
• scientific article; zbMATH DE number 1530329
• Algorithmic detection and construction of N-matrices
• Publication:3495481

zbMATH Keywords

matrix inversionM-matricesZ-matricescomplexity orderpolynomial-time test

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (6)

• Perturbations of \(M\)-matrices via ABS methods and their applications to input-output analysis
• The Boolean pivot operation, \(M\)-matrices, and reducible matrices
• A polynomial-time dependence test for determining integer-valued solutions in multi-dimensional arrays under variable bounds
• A stable test to check if a matrix is a nonsingular $M$-matrix
• On testing nonnegativity of principal minors of \({\mathbf{Z}} \)-matrices using simplex method
• A polynomial time spectral decomposition test for certain classes of inverse M-matrices

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q805154)