The real positive definite completion problem for a 4-cycle (Q5954849)
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: The real positive definite completion problem for a 4-cycle |
scientific article; zbMATH DE number 1702096
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The real positive definite completion problem for a 4-cycle |
scientific article; zbMATH DE number 1702096 |
Statements
The real positive definite completion problem for a 4-cycle (English)
0 references
23 February 2003
0 references
Previous works on the positive semidefinite (PSD) completion problem [cf. for example \textit{W. W. Barrett}, Mem. Am. Math. Soc. 584, 69 p. (1996; Zbl 0857.05068)] focused with determining the existence of a PSD completion of a given partial matrix, examining characteristics of the graph of the matrix. The present paper is concerned with describing the set of all PSD completions of a given partial matrix. The cases considered are quite general and the matrices have several dimensions.
0 references
4-cycle
0 references
matrix completion problem
0 references
nonchordal graph
0 references
partial matrix
0 references
positive definite completion problem
0 references
singular points
0 references
two specified entries
0 references
0.9347662
0 references
0 references
0.8553872
0 references
0.8377645
0 references
0.83015054
0 references
0 references
0.8140031
0 references
