The completion problem for N-matrices

MaRDI QIDQ3075104zbMATH OpenFDO

Authors Claudia Mendes, Juan Ramón Torregrosa Sánchez

Publication date 10 February 2011

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Positive matrices and their generalizations; cones of matrices (15B48)

Recommendations

• N-matrix completion problem.
• The doubly negative matrix completion problem
• The symmetric N-matrix completion problem
• Totally nonpositive completions on partial matrices
• The \(N\)-matrix completion problem under digraphs assumptions.

Cited in

(14)

• N₀ completions on partial matrices
• Completions of \(M\)-matrix patterns
• N-matrix completion problem.
• The \(N\)-matrix completion problem under digraphs assumptions.
• The doubly negative matrix completion problem
• Algorithmic detection and construction of N-matrices
• Matrix completions for linear matrix equations
• On the maximum rank of completions of entry pattern matrices
• The symmetric N-matrix completion problem
• Completing any low-rank matrix, provably
• The \(N_{0}^{1}\)-matrix completion problem
• scientific article; zbMATH DE number 2144792 (Why is no real title available?)
• Completing a (k − 1)-Assignment
• The combinatorially symmetric partial N-matrix completion

This page was built for publication: The completion problem for \(N\)-matrices

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