2011 IEEE 73rd Vehicular Technology Spring Conference

• Record Nr.: UNISA996197655903316
• Pubbl/distr/stampa: [Place of publication not identified], : IEEE, 2011
• ISBN: 1-4244-8331-X
• Lingua di pubblicazione: Inglese
• Formato: Materiale a stampa
• Livello bibliografico: Monografia
• Note generali: Bibliographic Level Mode of Issuance: Monograph

Completely positive matrices [[electronic resource] /] / Abraham Berman, Naomi Shaked-Monderer

• Record Nr.: UNINA9910782115903321
• Autore: Berman Abraham
• Pubbl/distr/stampa: [River Edge] New Jersey, : World Scienfic, c2003
• ISBN: 1-281-93563-8; 9786611935634; 981-279-521-9
• Descrizione fisica: 1 online resource (ix, 206 p. ) : ill
• Altri autori (Persone): Shaked-MondererNaomi
• Disciplina: 512.9/434
• Soggetti: Matrices
• Lingua di pubblicazione: Inglese
• Formato: Materiale a stampa
• Livello bibliografico: Monografia
• Note generali: Bibliographic Level Mode of Issuance: Monograph
• Nota di bibliografia: Includes bibliographical references (p. 193-197) and index.
• Nota di contenuto: ch. 1. Preliminaries. 1.1. Matrix theoretic background. 1.2. Positive semidefinite matrices. 1.3. Nonnegative matrices and M-matrices. 1.4. Schur complements. 1.5. Graphs. 1.6. Convex cones. 1.7. The PSD completion problem -- ch. 2. Complete positivity. 2.1. Definition and basic properties. 2.2. Cones of completely positive matrices. 2.3. Small matrices. 2.4. Complete positivity and the comparison matrix. 2.5. Completely positive graphs. 2.6. Completely positive matrices whose graphs are not completely positive. 2.7. Square factorizations. 2.8. ; Functions of completely positive matrices. 2.9. The CP completion problem -- ch. 3. CP rank. 3.1. Definition and basic results. 3.2. Completely positive matrices of a given rank. 3.3. Completely positive matrices of a given order. 3.4. When is the cp-rank equal to the rank?
• Sommario/riassunto: A real matrix is positive semidefinite if it can be decomposed as A=BB[symbol]. 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[symbol] 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.