Matrix Completion

Matrix Completion is a problem in numerical linear algebra that involves reconstructing a low-rank matrix from a subset of its observed entries by exploiting the inherent structural redundancy of the matrix.

1.7K

Publications

127.4K

Citations

3.6K

Authors

1.1K

Institutions

Publications per year

2017–2026

684

Authors

3.6K

  1. CR
    Charles R. Johnson

    William & Mary, United States

    21 publications · 1.2K citations

    16

    h-index

  2. MK
    Michael K. Ng

    Hong Kong Baptist University, Hong Kong SAR China

    17 publications · 821 citations

    15

    h-index

  3. KX
    Kun Xie

    Hunan University, China

    15 publications · 800 citations

    15

    h-index

  4. IS
    Inderjit S. Dhillon

    The University of Texas at Austin, United States

    15 publications · 1.8K citations

    15

    h-index

  5. XZ
    Xi-Le Zhao

    University of Electronic Science and Technology of China, China

    14 publications · 956 citations

    14

    h-index

1–5 of 3.6K

Venues

  1. arXiv (Cornell University)

    Repository · 176 publications · 10.1K citations

    46

    h-index

  2. Linear Algebra and its Applications

    113 publications · 4.9K citations

    36

    h-index

  3. IEEE Transactions on Signal Processing

    58 publications · 5.3K citations

    36

    h-index

  4. IEEE Transactions on Information Theory

    30 publications · 6.5K citations

    22

    h-index

  5. IEEE Transactions on Image Processing

    20 publications · 1.9K citations

    20

    h-index

1–5