A polynomial-time test for M-matrices
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 4109935 (Why is no real title available?)
- scientific article; zbMATH DE number 3760340 (Why is no real title available?)
- scientific article; zbMATH DE number 3212891 (Why is no real title available?)
- A generalization of N-matrices
- A polynomial algorithm for testing the nonnegativity of principal minors of Z-matrices
- Inverse M-matrices
- Nonnegative matrices with power invariant zero patterns
- On the inverse M-matrix problem for (0,1)-matrices
- The general quadratic optimization problem
Cited in
(6)- A polynomial-time dependence test for determining integer-valued solutions in multi-dimensional arrays under variable bounds
- The Boolean pivot operation, \(M\)-matrices, and reducible matrices
- A stable test to check if a matrix is a nonsingular $M$-matrix
- A polynomial time spectral decomposition test for certain classes of inverse M-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
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)