Completely Positive Matrices (Google eBook)

Front Cover
World Scientific, Jan 1, 2003 - Mathematics - 218 pages
0 Reviews
A real matrix is positive semidefinite if it can be decomposed as A = BBOC . 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 = BBOC is known as the cp- rank of A . This invaluable book 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. Contents: Preliminaries: Matrix Theoretic Background; Positive Semidefinite Matrices; Nonnegative Matrices and M -Matrices; Schur Complements; Graphs; Convex Cones; The PSD Completion Problem; Complete Positivity: Definition and Basic Properties; Cones of Completely Positive Matrices; Small Matrices; Complete Positivity and the Comparison Matrix; Completely Positive Graphs; Completely Positive Matrices Whose Graphs are Not Completely Positive; Square Factorizations; Functions of Completely Positive Matrices; The CP Completion Problem; CP Rank: Definition and Basic Results; Completely Positive Matrices of a Given Rank; Completely Positive Matrices of a Given Order; When is the CP-Rank Equal to the Rank?. Readership: Upper level undergraduates, graduate students, academics and researchers interested in matrix theory."
  

What people are saying - Write a review

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

Contents

Complete positrvity
61
CP rank
139

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