Minimal rank completions for block matrices (Q1823288)

From MaRDI portal
Revision as of 22:20, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
scientific article
Language Label Description Also known as
English
Minimal rank completions for block matrices
scientific article

    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

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references