N-matrix completion problem.
From MaRDI portal
\(N\)-matrix completion problem.
Recommendations
Cites work
- scientific article; zbMATH DE number 3647833 (Why is no real title available?)
- scientific article; zbMATH DE number 554762 (Why is no real title available?)
- N-matrices
- On characterizing \(N\)-matrices using linear complementarity
- On the Alass of Complementary Cones and Lemke’s Algorithm
- The Production Coefficient Matrix and the Stolper-Samuelson Condition
Cited in
(13)- Adjacent edge conditions for the totally nonnegative completion problem
- The \(N\)-matrix completion problem under digraphs assumptions.
- The symmetric \(N\)-matrix completion problem
- Totally nonpositive completions on partial matrices
- The combinatorially symmetric partial \(N\)-matrix completion
- Sign pattern matrices that admit \(M\)-, \(N\)-, \(P\)- or inverse \(M\)-matrices
- Algorithmic detection and construction of N-matrices
- The \(N_{0}^{1}\)-matrix completion problem
- The completion problem for \(N\)-matrices
- \(N_0\) completions on partial matrices
- scientific article; zbMATH DE number 16877 (Why is no real title available?)
- The doubly negative matrix completion problem
- The nonsingular matrix completion problem
This page was built for publication: \(N\)-matrix completion problem.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1410715)