How exponentially ill-conditioned are contiguous submatrices of the Fourier matrix?
Alex H. Barnett

TL;DR
This paper establishes exponential lower bounds on the condition number of contiguous submatrices of the Fourier matrix, revealing their severe ill-conditioning in various applications like super-resolution and diffraction imaging.
Contribution
It provides explicit, non-asymptotic lower bounds on the condition number of Fourier submatrices, using novel analytical techniques including the Kaiser-Bessel transform and sinc function estimates.
Findings
Condition number grows exponentially with N for fixed shape ratios.
Bounds are within a factor of two of empirical rates, sharp in certain regions.
Results are explicit and apply to all relevant matrix sizes, not just asymptotic cases.
Abstract
We show that the condition number of any cyclically contiguous submatrix of the discrete Fourier transform (DFT) matrix is at least up to algebraic prefactors. That is, fixing any shape parameters , the growth is as with rate . Such Vandermonde system matrices arise in many applications, such as Fourier continuation, super-resolution, and diffraction imaging. Our proof uses the Kaiser-Bessel transform pair (of which we give a self-contained proof), and estimates on sums over distorted sinc functions, to construct a localized trial vector whose DFT is also localized. We warm up with an elementary proof of the above but with half the rate, via a periodized Gaussian…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsNumerical methods in inverse problems · Medical Imaging Techniques and Applications · Advanced X-ray Imaging Techniques
