On nonnegative factorization of matrices (Q580478): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q3843714 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonnegative factorization of positive semidefinite nonnegative matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5328177 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonnegative factorization of completely positive matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel concepts in graph theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4182839 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5605274 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5618446 / rank
 
Normal rank

Revision as of 11:20, 18 June 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
    0 references
    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

    Identifiers