Submatrices with the best-bounded inverses: an asymptotically tight upper bound for $\mathbb{C}^{n \times 2}$
Numerical Analysis
2026-04-28 v1 Numerical Analysis
Abstract
The long-standing hypothesis formulated by Goreinov, Tyrtyshnikov and Zamarashkin \cite{GTZ1997} has recently been solved affirmatively in the case of real two-column matrices by Sengupta and Pautov \cite{SP2026}. In this paper, we consider the complex variant of this problem and prove the asymptotically tight upper bound for spectral norms of the best-bounded inverse submatrices of an arbitrary complex matrix with orthonormal columns.
Keywords
Cite
@article{arxiv.2604.24087,
title = {Submatrices with the best-bounded inverses: an asymptotically tight upper bound for $\mathbb{C}^{n \times 2}$},
author = {Yuri Nesterenko},
journal= {arXiv preprint arXiv:2604.24087},
year = {2026}
}