Linearly constrained positive definite completions (Q2277549): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 12:20, 2 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Linearly constrained positive definite completions |
scientific article |
Statements
Linearly constrained positive definite completions (English)
0 references
1991
0 references
A partial matrix is a matrix, where some of the elements are fixed and the rest are unspecified complex numbers. It is shown that if \(A(z)\) is a partial matrix (with \(z\) the vector of unspecified elements) such that \(A(z)\) is positive semidefinite and \(z\) satisfies some linear constraints then if the problem is feasible then there is a unique such matrix \(A(z)\) maximizing the determinant of \(A(z)\). This is applied to the case when \(A(z)\) is positive semidefinite and Toeplitz.
0 references
Toeplitz matrix
0 references
partial matrix
0 references
determinant
0 references
positive semidefinite
0 references