Answers are grounded in this paper and cite their sources.
A matrix is diagonalizable if it has a basis of linearly independent eigenvectors. Since the set of nondiagonalizable matrices has measure zero, every is the limit of diagonalizable matrices. We prove a quantitative version of this fact conjectured by E. B. Davies: for each , every matrix is at least ‐close to one whose eigenvectors have condition number at worst , for some depending only on n . We further show that the dependence on δ cannot be improved to for any constant . Our proof uses tools from random matrix theory to show that the pseudospectrum of A can be regularized with the addition of a complex Gaussian perturbation. Along the way, we explain how a variant of a theorem of Śniady implies a conjecture of Sankar, Spielman, and Teng on the optimal constant for smoothed analysis of condition numbers.
No takes yet. Share an insight, caveat, or question.
Banks et al. (2021) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: