Gaussian Regularization of the Pseudospectrum and Davies' Conjecture

06/27/2019
by   Jess Banks, et al.
0

A matrix A∈C^n× n is diagonalizable if it has a basis of linearly independent eigenvectors. Since the set of nondiagonalizable matrices has measure zero, every A∈C^n× n is the limit of diagonalizable matrices. We prove a quantitative version of this fact conjectured by E.B. Davies: for each δ∈ (0,1), every matrix A∈C^n× n is at least δA-close to one whose eigenvectors have condition number at worst c_n/δ, for some constants c_n dependent only on n. 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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/18/2020

On the real Davies' conjecture

We show that every matrix A ∈R^n× n is at least δ A-close to a real ...
research
11/08/2022

Optimal Smoothed Analysis and Quantitative Universality for the Smallest Singular Value of Random Matrices

The smallest singular value and condition number play important roles in...
research
03/03/2023

GMRES, pseudospectra, and Crouzeix's conjecture for shifted and scaled Ginibre matrices

We study the GMRES algorithm applied to linear systems of equations invo...
research
04/13/2018

On the detection of low rank matrices in the high-dimensional regime

We address the detection of a low rank n× ndeterministic matrix X_0 from...
research
11/07/2022

Asymptotics of the Sketched Pseudoinverse

We take a random matrix theory approach to random sketching and show an ...
research
12/01/2020

The Perturbative Resolvent Method: spectral densities of random matrix ensembles via perturbation theory

We present a simple, perturbative approach for calculating spectral dens...
research
03/31/2023

Inference on eigenvectors of non-symmetric matrices

This paper argues that the symmetrisability condition in Tyler (1981) is...

Please sign up or login with your details

Forgot password? Click here to reset