Completely Positive Matrices (Google eBook)

Front Cover
World Scientific, Jan 1, 2003 - Mathematics - 206 pages
0 Reviews
A real matrix is positive semidefinite if it can be decomposed as A=BB'. In some applications the matrix B has to be elementwise nonnegative. If such a matrix exists, A is called completely positive. The smallest number of columns of a nonnegative matrix B such that A=BB' is known as the cp rank of A. This work focuses on necessary conditions and sufficient conditions for complete positivity, as well as bounds for the cp rank. The methods are combinatorial, geometric and algebraic. The required background on nonnegative matrices, cones, graphs and Schur complements is outlined.

What people are saying - Write a review

We haven't found any reviews in the usual places.


Complete positrvity
CP rank

Common terms and phrases

Popular passages

Page 6 - A is an eigenvalue of A, and x is an eigenvector.
Page viii - This research was supported by the fund for promotion of research at the Technion.
Page 3 - Here \A\ denotes the matrix whose elements are the absolute values of the corresponding elements in A.

Bibliographic information