Completely Positive Matrices Contributor(s): Berman, Abraham (Author), Shaked-Monderer, Naomi (Author) |
|
ISBN: 9812383689 ISBN-13: 9789812383686 Publisher: World Scientific Publishing Company OUR PRICE: $95.00 Product Type: Hardcover - Other Formats Published: April 2003 Annotation: A real matrix is positive semidefinite if it can be decomposed as A=BBT. 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=BBT 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. |
Additional Information |
BISAC Categories: - Mathematics | Matrices - Mathematics | Number Theory - Mathematics | Combinatorics |
Dewey: 512.943 |
Physical Information: 0.73" H x 6.16" W x 9.36" (1.12 lbs) 216 pages |
Descriptions, Reviews, Etc. |
Publisher Description: 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 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. |