The cycle completable graphs for the completely positive and doubly nonnegative completion problems

DOI10.1016/S0024-3795(00)00110-5zbMath0960.15011OpenAlexW2045884235MaRDI QIDQ1579520

John H. Drew, Steven J. Kilner, Angela M. McKay, Charles R. Johnson

Publication date: 1 May 2001

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

Full work available at URL: https://doi.org/10.1016/s0024-3795(00)00110-5

zbMATH Keywords

matrix completioncompletely positivepartial matrixblock graphdoubly non-negative

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Inverse problems in linear algebra (15A29) Positive matrices and their generalizations; cones of matrices (15B48)

Related Items

Matrix completions for linear matrix equations, The integer cp-rank of \(2 \times 2\) matrices, \(P\)-matrix completions under weak symmetry assumptions

Cites Work

• Unnamed Item
• Unnamed Item
• Positive definite completions of partial Hermitian matrices
• Nonnegative factorization of completely positive matrices
• Nonnegative factorization of positive semidefinite nonnegative matrices
• The real positive definite completion problem for a simple cycle
• On the Matrix Equation X′X = A
• The completely positive and doubly nonnegative completion problems
• The real positive definite completion problem: cycle completability