On nonnegative factorization of matrices (Q580478): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claim: reviewed by (P1447): Item:Q1773998 |
||
| Property / reviewed by | |||
| Property / reviewed by: Q593508 / rank | |||
Revision as of 14:38, 29 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On nonnegative factorization of matrices |
scientific article |
Statements
On nonnegative factorization of matrices (English)
0 references
1987
0 references
The author utilizes techniques from graph theory to show that if A is an \(n\times n\) nonnegative diagonally dominant symmetric matrix, then there is an \(n\times m\) nonnegative matrix B such that \(A=BB^ t\). Under these conditions he produces an algorithm to compute B.
0 references
completely positive
0 references
vertex-edge incidence matrix
0 references
nonnegative diagonally dominant symmetric matrix
0 references
algorithm
0 references
