Multiple typical ranks in matrix completion

Low-rank matrix completion addresses the problem of completing a matrix from a certain set of generic specified entries. Over the complex numbers a matrix with a given entry pattern can be uniquely completed to a specific rank, called the generic completion rank. Completions over the reals may gener...

Full description

Saved in:
Bibliographic Details
Published inLinear algebra and its applications Vol. 710; pp. 165 - 182
Main Authors Dressler, Mareike, Krone, Robert
Format Journal Article
LanguageEnglish
Published Elsevier Inc 01.04.2025
Subjects
Circulant graph
Generic rank
Matrix completion
Typical rank
secondary
Circulant graph
Typical rank
primary
Matrix completion
Generic rank
Online AccessGet full text

Cover

More Information
Summary:Low-rank matrix completion addresses the problem of completing a matrix from a certain set of generic specified entries. Over the complex numbers a matrix with a given entry pattern can be uniquely completed to a specific rank, called the generic completion rank. Completions over the reals may generically have multiple completion ranks, called typical ranks. We demonstrate techniques for proving that many sets of specified entries have only one typical rank, and show other families with two typical ranks, specifically focusing on entry sets represented by circulant graphs. This generalizes the results of Bernstein, Blekherman, and Sinn. In particular, we provide a complete characterization of the set of unspecified entries of an n×n matrix such that n−1 is a typical rank and fully determine the typical ranks of an n×n matrix with unspecified diagonal for n<9. Moreover, we study the asymptotic behavior of typical ranks and present results regarding unique matrix completions.
ISSN:0024-3795
DOI:10.1016/j.laa.2025.01.026