Universality for the Toda algorithm to compute the largest eigenvalue of a random matrix
Probability
2017-02-06 v2 Numerical Analysis
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.
Keywords
Cite
@article{arxiv.1604.07384,
title = {Universality for the Toda algorithm to compute the largest eigenvalue of a random matrix},
author = {Percy Deift and Thomas Trogdon},
journal= {arXiv preprint arXiv:1604.07384},
year = {2017}
}