On the real Davies' conjecture

05/18/2020
by   Vishesh Jain, et al.
0

We show that every matrix A ∈R^n× n is at least δ A-close to a real matrixA+E ∈R^n× nwhose eigenvectors have condition number at mostÕ_n(δ^-1). In fact, we prove that, with high probability, takingEto 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.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset

Sign in with Google

×

Use your Google Account to sign in to DeepAI

×

Consider DeepAI Pro