Cargando…
Completely Positive Matrices.
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 c...
| Clasificación: | Libro Electrónico |
|---|---|
| Autor principal: | |
| Formato: | Electrónico eBook |
| Idioma: | Inglés |
| Publicado: |
World Scientific
2003.
|
| Temas: | |
| Acceso en línea: | Texto completo |
| Sumario: | 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. |
|---|---|
| Descripción Física: | 1 online resource |
| Bibliografía: | Includes bibliographical references (pages 193-197) and index. |
| ISBN: | 1281935638 9781281935632 9789812795212 9812795219 |