The doubly negative matrix completion problem

DOI10.1016/J.LAA.2004.07.009zbMATH Open1074.15015OpenAlexW2050377853MaRDI QIDQ1779397FDOQ1779397

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

Publication date: 1 June 2005

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

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

Recommendations

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

zbMATH Keywords

undirected graphmatrix completion problempartial matrixdouble negative matrix

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Inverse problems in linear algebra (15A29)

Cites Work

• Positive definite completions of partial Hermitian matrices
• Title not available (Why is that?)
• The completion problem for \(M\)-matrices and inverse \(M\)-matrices
• The combinatorially symmetric P-matrix completion problem
• Graph theoretic methods for matrix completion problems

Cited In (8)

• SPN completable graphs
• The negative signature of some Hermitian matrices
• The completion problem for \(N\)-matrices
• Extending chains of factorizations and minimal negative signatures
• The symmetric \(N\)-matrix completion problem
• \(N\)-matrix completion problem.
• Double-path in the totally nonnegative completion problem
• \(2n\)-by-\(2n\) symplectic completions of matrices of order \(2n-1\)

This page was built for publication: The doubly negative matrix completion problem

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