Loading...
research article
Computing symmetric nonnegative rank factorizations
Kalofolias, V.
•
Gallopoulos, E.
An algorithm is described for the nonnegative rank factorization (NRF) of some completely positive (CP) matrices whose rank is equal to their CP-rank. The algorithm can compute the symmetric NRF of any nonnegative symmetric rank-r matrix that contains a diagonal principal submatrix of that rank and size with leading cost O(rm2) operations in the dense case. The algorithm is based on geometric considerations and is easy to implement. The implications for matrix graphs are also discussed.
Loading...
Name
main.pdf
Type
Postprint
Access type
openaccess
Size
311.12 KB
Format
Adobe PDF
Checksum (MD5)
ffcc7d88a993e66e80949744ae0c72fe