\(N\)-matrix completion problem.

DOI10.1016/S0024-3795(03)00500-7zbMath1049.15008OpenAlexW2019643208MaRDI QIDQ1410715

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

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

partial matrixchordal graphundirected graphcompletion problemN-matrix

Mathematics Subject Classification ID

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

Related Items (4)

The \(N\)-matrix completion problem under digraphs assumptions. ⋮ \(N_0\) completions on partial matrices ⋮ Sign pattern matrices that admit \(M\)-, \(N\)-, \(P\)- or inverse \(M\)-matrices ⋮ The symmetric \(N\)-matrix completion problem

Cites Work

• On characterizing \(N\)-matrices using linear complementarity
• The Production Coefficient Matrix and the Stolper-Samuelson Condition
• On the Alass of Complementary Cones and Lemke’s Algorithm
• N-matrices
• Unnamed Item
• Unnamed Item

This page was built for publication: \(N\)-matrix completion problem.