The doubly negative matrix completion problem

DOI10.1016/J.LAA.2004.07.009MaRDI QIDQ1779397zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

double negative matrixmatrix completion problempartial matrixundirected graph

Mathematics Subject Classification ID

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

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

Cites work

• Graph theoretic methods for matrix completion problems
• scientific article; zbMATH DE number 554762 (Why is no real title available?)
• Positive definite completions of partial Hermitian matrices
• The combinatorially symmetric P-matrix completion problem
• The completion problem for M-matrices and inverse M-matrices

Cited in

(9)

• The negative signature of some Hermitian matrices
• Extending chains of factorizations and minimal negative signatures
• N-matrix completion problem.
• The symmetric N-matrix completion problem
• SPN completable graphs
• The completion problem for N-matrices
• Double-path in the totally nonnegative completion problem
• The completely positive and doubly nonnegative completion problems
• 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)