An n ร n real matrix A is called completely positive (CP) if it can be factored as A = B B (" " stands for transpose) where B is an m ร n entrywise nonnegative matrix for some integer m. The smallest such number m is called the cprank of A. In this paper we present a necessary and sufficient conditi
Completely positive matrices associated with M -matrices
โ Scribed by Drew, John H; Johnson, Charles R.; Loewy, Raphael
- Book ID
- 120926939
- Publisher
- Taylor and Francis Group
- Year
- 1994
- Tongue
- English
- Weight
- 864 KB
- Volume
- 37
- Category
- Article
- ISSN
- 0308-1087
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Let A be a n ร n symmetric matrix and in the closure of inverse M-matrices. Then A can be factored as A = BB r for some nonnegative lower triangular n ร n matrix B, and cp-rank A ~< n. If A is a positive semidefinite (0, 1) matrix, then A is completely positive and cp-rank A = rank A; if A is a non
A new class of graphs, called "book-graphs", extending the class of completely positive graphs is defined. Necessary and sufficient conditions for the complete positivity of a matrix with graph in this class are given. The main questions concerning completely positive matrices with cyclic graph are