Minimal rank completions for block matrices (Q1823288)
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 4114801
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimal rank completions for block matrices |
scientific article; zbMATH DE number 4114801 |
Statements
Minimal rank completions for block matrices (English)
0 references
1989
0 references
The following problem is discussed: Given the lower triangular part of a block matrix, characterize the set of all completions of this matrix such that the resulting matrix has a minimal rank. The structure of the set of such matrices is described and for the particular case of block Toeplitz matrices, the relationship to the partial realization problem is given.
0 references
block completion problem
0 references
block Hankel matrix
0 references
minimal rank
0 references
block Toeplitz matrices
0 references
partial realization problem
0 references
0 references
0.874046266078949
0 references
0.8731340169906616
0 references
0.8380631804466248
0 references
0.8301883935928345
0 references
