Universality for the Toda algorithm to compute the largest eigenvalue of a random matrix
arXiv:1604.07384
Abstract
We prove universality for the fluctuations of the halting time for the Toda algorithm to compute the largest eigenvalue of real symmetric and complex Hermitian matrices. The proof relies on recent results on the statistics of the eigenvalues and eigenvectors of random matrices (such as delocalization, rigidity and edge universality) in a crucial way.
References in corpus (9)
- Level-Spacing Distributions and the Airy Kernel
- Random matrices: Universality of local eigenvalue statistics up to the edge
- Edge Universality of Beta Ensembles
- Universality at the edge of the spectrum for unitary, orthogonal and symplectic ensembles of random matrices
- How many entries of a typical orthogonal matrix can be approximated by independent normals?
- Universality in Numerical Computations with Random Data. Case Studies
- Typical versus averaged overlap distribution in Spin-Glasses : Evidence for the droplet scaling theory
- Near-extreme eigenvalues and the first gap of Hermitian random matrices
- The Eigenvector Moment Flow and local Quantum Unique Ergodicity