An \(n \times n\) real symmetric matrix \(A\) is called \textit{completely positive} if \(A\) could be decomposed as \(A=BB^T\) for some (not necessarily square) matrix \(B\) which is entrywise nonnegative. The minimal number of columns in such \(B\) is called the \(cp\)-\(rank\) of \(A\). It follows that the \(cp\)-\(rank\) of \(A\) is at least the rank of \(A\). Also, it is clear that if \(A\) is completely positive, then it is both positive semidefinite and entrywise nonnegative (namely, \(A\) is doubly nonnegative). An \(n \times n\) symmetric doubly nonnegative matrix (with \(n \geq 5\)) is called a \textit{house matrix} if \(a_{i,i}\) for \(1 \leq i \leq n\), \(a_{i,i+1}\) for \(1 \leq i \leq n-1\), \(a_{1,3},a_{1,n}\) are all positive. The authors show, among other results, that the \(cp\)-\(rank\) of a completely positive house matrix is at least \(n-1\) and give a complete characterization of the singular completely positive house matrices.
- A characterization of tridiagonal matrices
- Characterization of completely positive graphs
- Completely positive matrices associated withM-matrices
- scientific article; zbMATH DE number 3144516 (Why is no real title available?)
- scientific article; zbMATH DE number 1933860 (Why is no real title available?)
- scientific article; zbMATH DE number 3201668 (Why is no real title available?)
- On the Matrix Equation X′X = A
- Notes on completely positive matrices
- The complete positivity of symmetric tridiagonal and pentadiagonal matrices
- Hermitian completely positive matrices
- Remarks on completey positive matrices
- Completely positive matrices of order 5 with \(\widehat{CP}\)-graph
- scientific article; zbMATH DE number 2144319 (Why is no real title available?)
- The graphs of pyramids are determined by their spectrum
- 5 5 completely positive matrices
This page was built for publication: Completely positive house matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q648914)
