A linear programming based analysis of the CP-rank of completely positive matrices

Yingbo Li; Anton Kummert; Andreas Frommer

Displaying similar documents to “A linear programming based analysis of the CP-rank of completely positive matrices”

Zero-term rank preservers of integer matrices

Seok-Zun Song, Young-Bae Jun (2006)

Discussiones Mathematicae - General Algebra and Applications

Similarity:

The zero-term rank of a matrix is the minimum number of lines (row or columns) needed to cover all the zero entries of the given matrix. We characterize the linear operators that preserve the zero-term rank of the m × n integer matrices. That is, a linear operator T preserves the zero-term rank if and only if it has the form T(A)=P(A ∘ B)Q, where P, Q are permutation matrices and A ∘ B is the Schur product with B whose entries are all nonzero integers.

Spaces of rank-2 matrices over GF(2).

Beasley, LeRoy B. (1999)

ELA. The Electronic Journal of Linear Algebra [electronic only]

Similarity:

A new rank formula for idempotent matrices with applications

Yong Ge Tian, George P. H. Styan (2002)

Commentationes Mathematicae Universitatis Carolinae

Similarity:

It is shown that $rank (P^{*} A Q) = rank (P^{*} A) + rank (A Q) - rank (A),$ where $A$ is idempotent, $[P, Q]$ has full row rank and $P^{*} Q = 0$ . Some applications of the rank formula to generalized inverses of matrices are also presented.