Positive semidefinite matrices with a given sparsity pattern (Q1109100): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0024-3795(88)90240-6 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2034769312 / rank | |||
Normal rank | |||
Revision as of 19:06, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Positive semidefinite matrices with a given sparsity pattern |
scientific article |
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
