The completely positive and doubly nonnegative completion problems
Authors:
- 1 April 1998
- journal article
- research article
- Published by Taylor & Francis in Linear and Multilinear Algebra
- Vol. 44 (1) , 85-92
Abstract
We prove the following. Let G be an undirected graph. Every partially specified symmetric matrix, the graph of whose specified entries is G and each of whose fully specified submatrices is completely positive (equal to BB T for some entrywise nonnegative matrix B), may be completed to a completely positive matrix if and only if G is a block-clique graph (a chordal graph in which distinct maximal cliques overlap in at most one vertex). The same result holds for matrices that are doubly nonnegative (entrywise nonnegative and positive semidefinite).Keywords
This publication has 5 references indexed in Scilit:
- The No Long Odd Cycle Theorem for Completely Positive Matrices1996
- Completely positive matrices associated withM-matricesLinear and Multilinear Algebra, 1994
- Matrix Theory and Applications1990
- Positive definite completions of partial Hermitian matricesLinear Algebra and its Applications, 1984
- Nonnegative factorization of completely positive matricesLinear Algebra and its Applications, 1983