N-matrix completion problem.

DOI10.1016/S0024-3795(03)00500-7MaRDI QIDQ1410715zbMATH OpenOpenAlexFDO

Authors C. Mendes Araújo, Juan Ramón Torregrosa Sánchez, Ana M. Urbano

Publication date 15 October 2003

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

Full work available at URL https://doi.org/10.1016/s0024-3795(03)00500-7

zbMATH Keywords

chordal graphcompletion problemN-matrixpartial matrixundirected graph

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Inverse problems in linear algebra (15A29)

Review text

An \(n \times n\) matrix is called an \(N\)-matrix if all principal minors are negative. The authors prove that a combinatorially symmetric partial \(N\)-matrix has an \(N\)-matrix completion if the graph of its specified entries is a 1-chordal graph. They also prove that there exists an \(N\)-matrix completion for a partial \(N\)-matrix whose associated graph is an undirected cycle.

Recommendations

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

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)

• N₀ completions on partial matrices
• Sign pattern matrices that admit \(M\)-, \(N\)-, \(P\)- or inverse \(M\)-matrices
• The \(N\)-matrix completion problem under digraphs assumptions.
• The doubly negative matrix completion problem
• Algorithmic detection and construction of N-matrices
• The symmetric N-matrix completion problem
• The \(N_{0}^{1}\)-matrix completion problem
• The completion problem for N-matrices
• The nonsingular matrix completion problem
• Adjacent edge conditions for the totally nonnegative completion problem
• scientific article; zbMATH DE number 16877 (Why is no real title available?)
• The combinatorially symmetric partial N-matrix completion
• Totally nonpositive completions on partial matrices

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)