On nonnegative factorization of matrices (Q580478): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / author | |||
| Property / author: Sumit K. Garg / rank | |||
Normal rank | |||
| Property / review text | |||
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. | |||
| Property / review text: 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. / rank | |||
Normal rank | |||
| Property / reviewed by | |||
| Property / reviewed by: Q593508 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 15B48 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 15A23 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 65F05 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 4017101 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
completely positive | |||
| Property / zbMATH Keywords: completely positive / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
vertex-edge incidence matrix | |||
| Property / zbMATH Keywords: vertex-edge incidence matrix / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
nonnegative diagonally dominant symmetric matrix | |||
| Property / zbMATH Keywords: nonnegative diagonally dominant symmetric matrix / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
algorithm | |||
| Property / zbMATH Keywords: algorithm / rank | |||
Normal rank | |||
Revision as of 18:40, 1 July 2023
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
