Chains of dog-ears for completely positive matrices (Q5940026)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Chains of dog-ears for completely positive matrices |
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
doubly nonnegative matrices
0 references
completely positive matrices
0 references
non-crossing cycles
0 references
pentadiagonal matrices
0 references
graph
0 references
0 references
0 references
0.8434324
0 references
0 references
0.8405407
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.NEWLINENEWLINENEWLINEThe 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
