The real positive semidefinite completion problem for series-parallel graphs (Q676039)
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 991129
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The real positive semidefinite completion problem for series-parallel graphs |
scientific article; zbMATH DE number 991129 |
Statements
The real positive semidefinite completion problem for series-parallel graphs (English)
0 references
11 May 1997
0 references
The author considers the partial real symmetric matrices \(X\) whose diagonal entries are equal to 1 and off-diagonal entries are specified only on a subset of the positions. The author gives a set of necessary conditions for \(X\) to be completable to a positive semidefinite matrix, and shows that these conditions are also sufficient if and only if the graph corresponding to the positions of the specified entries has no \(K_4\)-minor.
0 references
real symmetric matrices
0 references
positive semidefinite matrix
0 references
0.8684696555137634
0 references
0.8632140159606934
0 references
0.8499157428741455
0 references
0.8477321267127991
0 references
