Minimal rank completions for overlapping blocks
From MaRDI portal
Publication:2041773
DOI10.1016/j.laa.2021.06.011zbMath1470.15022arXiv2106.11267OpenAlexW3175541615MaRDI QIDQ2041773
Shivkumar Chandrasekaran, Ethan N. Epperly, Nithin Govindarajan
Publication date: 23 July 2021
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2106.11267
Inverse problems in linear algebra (15A29) Matrix completion problems (15A83) Numerical methods for low-rank matrix approximation; matrix compression (65F55)
Cites Work
- The lower order of lower triangular operators and minimal rank extensions
- The computational complexity of some problems of linear algebra
- Minimal rank completions for block matrices
- Unique minimal rank extensions of triangular operators
- Separable type representations of matrices and fast algorithms. Volume 2. Eigenvalue method
- The complexity of matrix completion
- Interior-Point Method for Nuclear Norm Approximation with Application to System Identification
- Minimal rank completions of partial banded matrices
- Numerical Methods for Computing Angles Between Linear Subspaces
- Some Fast Algorithms for Sequentially Semiseparable Representations
This page was built for publication: Minimal rank completions for overlapping blocks