Toeplitz minimal rank completions (Q1329934)
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 614119
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Toeplitz minimal rank completions |
scientific article; zbMATH DE number 614119 |
Statements
Toeplitz minimal rank completions (English)
0 references
15 August 1994
0 references
A partial block matrix is a rectangular array some of whose blocks are given matrices over the field \(\mathbb{F}\) (of real or complex numbers), while the remaining entries are unspecified. A completion is an allowed choice of values for the unspecified entries. A partial block matrix is called Toeplitz if it allows a completion \({\mathbf A} = (a_{ij})\) such that \(a_{ij} = a_{i + 1,j + 1}\). If \(A\) is a partial block matrix, its minimal rank \(\text{mr}A\) is defined as \(\text{mr} A = \min \{\text{rank} {\mathbf A} \mid{\mathbf A}\) is a completion of \(A\}\). Define the Toeplitz minimal rank \(\text{mr}_ TA\) as follows: \(\text{mr}_ TA = \min \{\text{rank} {\mathbf A} \mid{\mathbf A}\) is a Toeplitz completion of \(A\}\). The main result is as follows. If \(A\) is a Toeplitz partial block matrix with a banded pattern (i.e. consecutive diagonals are specified) then \(\text{mr}A = \text{mr}_ TA\).
0 references
Toeplitz matrix
0 references
partial block matrix
0 references
completion
0 references
Toeplitz minimal rank
0 references
0.8731340169906616
0 references
0.8545522093772888
0 references
0.8197051882743835
0 references
0.8196680545806885
0 references