Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
139 tokens/sec
GPT-4o
47 tokens/sec
Gemini 2.5 Pro Pro
43 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

On the real Davies' conjecture (2005.08908v2)

Published 18 May 2020 in math.FA, cs.NA, math.NA, math.PR, and math.SP

Abstract: We show that every matrix $A \in \mathbb{R}{n\times n}$ is at least $\delta$$|A|$-close to a real matrix $A+E \in \mathbb{R}{n\times n}$ whose eigenvectors have condition number at most $\tilde{O}_{n}(\delta{-1})$. In fact, we prove that, with high probability, taking $E$ to be a sufficiently small multiple of an i.i.d. real sub-Gaussian matrix of bounded density suffices. This essentially confirms a speculation of Davies, and of Banks, Kulkarni, Mukherjee, and Srivastava, who recently proved such a result for i.i.d. complex Gaussian matrices. Along the way, we also prove non-asymptotic estimates on the minimum possible distance between any two eigenvalues of a random matrix whose entries have arbitrary means; this part of our paper may be of independent interest.

Citations (11)

Summary

We haven't generated a summary for this paper yet.