Positive semidefinite matrices with a given sparsity pattern (Q1109100)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4069090
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Positive semidefinite matrices with a given sparsity pattern |
scientific article; zbMATH DE number 4069090 |
Statements
Positive semidefinite matrices with a given sparsity pattern (English)
0 references
1988
0 references
Given a sparsity pattern, the cone of positive matrices which have zero in prescribed entries is considered. The highest rank of the extremal matrices in the cone is called the order of pattern. The order is linked with graph properties of the pattern. It leads to a classification of certain subgraphs of the pattern.
0 references
algorithmic graph theory
0 references
completion problems
0 references
sparsity pattern
0 references
cone of positive matrices
0 references
extremal matrices
0 references
order of pattern
0 references
0.8729531168937683
0 references
0.8373153209686279
0 references
0.8373149633407593
0 references
0.8351714015007019
0 references
0.8225765228271484
0 references
