The \(N\)-matrix completion problem under digraphs assumptions.

DOI10.1016/j.laa.2003.10.017zbMath1067.15010OpenAlexW2070949687MaRDI QIDQ1428622

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

Publication date: 29 March 2004

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

Full work available at URL: https://doi.org/10.1016/j.laa.2003.10.017

zbMATH Keywords

directed graphscompletion problemPartial matrix\(N\)-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 (1)

On the inverses of general tridiagonal matrices

Cites Work

• On characterizing \(N\)-matrices using linear complementarity
• \(N\)-matrix completion problem.
• 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
• Unnamed Item

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