On nonnegative factorization of matrices (Q580478)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4017101
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On nonnegative factorization of matrices |
scientific article; zbMATH DE number 4017101 |
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
0.7860469222068787
0 references
0.7751907706260681
0 references
0.7630916833877563
0 references
0.7610858678817749
0 references
