Combinatorial results on completely positive matrices (Q1091401): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Characterization of acyclic D-stable matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3943082 / rank
 
Normal rank
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: Q5592263 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonnegative factorization of completely positive matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: On values and strategies for infinite-time linear quadratic games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4182839 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5605274 / rank
 
Normal rank

Latest revision as of 09:41, 18 June 2024

scientific article
Language Label Description Also known as
English
Combinatorial results on completely positive matrices
scientific article

    Statements

    Combinatorial results on completely positive matrices (English)
    0 references
    0 references
    0 references
    1987
    0 references
    A sufficient condition for complete positivity of a matrix, in terms of complete positivity of smaller matrices, is given. Those patterns for which this condition is also necessary are characterized. These results are used to characterize complete positivity of matrices under some acyclicity assumptions on their graph. The exact value of the factorization index is given for acyclic matrices.
    0 references
    completely positive matrices
    0 references
    acyclic graphs
    0 references

    Identifiers