Minimal rank completions of partial banded matrices (Q4274552)

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 482268
Language Label Description Also known as
default for all languages
No label defined
    English
    Minimal rank completions of partial banded matrices
    scientific article; zbMATH DE number 482268

      Statements

      Minimal rank completions of partial banded matrices (English)
      0 references
      3 January 1994
      0 references
      matrix completion
      0 references
      partially defined matrix
      0 references
      minimal rank
      0 references
      partial banded matrix
      0 references
      0 references
      A partially defined matrix is one in which certain elements are specified. This poses the problem of determining the remaining elements so that the final matrix satisfies some criterion. In this paper the criterion is that it should be of minimal rank. The author shows that the minimal rank of a partial banded matrix (partially defined with a banded pattern) is the same as the maximum of the minimal ranks of all triangular subpatterns. This gives a partial proof of a conjecture made by \textit{N. Cohen}, \textit{C. R. Johnson}, \textit{L. Rodman} and \textit{H. J. Woerdeman} [Oper. Theory Adv. Appl. 40, 165-185 (1989; Zbl 0676.15001)]. The results are applied to the problem of simultaneously completing a matrix and its inverse.
      0 references

      Identifiers