Chains of dog-ears for completely positive matrices (Q5940026): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Completely positive matrices with a book-graph / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Bipartite completely positive matrices / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Combinatorial results on completely positive matrices / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On a Conjecture of L. J. Mordell Regarding an Inequality Involving Quadratic Forms / 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 |
Latest revision as of 17:44, 3 June 2024
scientific article; zbMATH DE number 1623821
Language | Label | Description | Also known as |
---|---|---|---|
English | Chains of dog-ears for completely positive matrices |
scientific article; zbMATH DE number 1623821 |
Statements
Chains of dog-ears for completely positive matrices (English)
0 references
23 July 2001
0 references
A necessary and sufficient condition to determine the complete positivity of a matrix with a particular graph, in dependence of complete positivity of smaller matrices, is given. Under some singularity assumptions, this condition furnishes a characterization for completely positive matrices with a non-crossing cycle as associated graph. In particular the characterization holds for singular pentadiagonal matrices. The paper is divided into five sections, namely, Introduction, Deletion of a leaf, Deletion of a dog-ear, Non-crossing cycles, and Non-diminishable matrices.
0 references
doubly nonnegative matrices
0 references
completely positive matrices
0 references
non-crossing cycles
0 references
pentadiagonal matrices
0 references
graph
0 references