Stability of the Lanczos algorithm on matrices with regular spectral distributions

From MaRDI portal
Publication:6185983

DOI10.1016/J.LAA.2023.11.006arXiv2302.14842OpenAlexW4388686898MaRDI QIDQ6185983FDOQ6185983


Authors: Tyler Chen, Thomas Trogdon Edit this on Wikidata


Publication date: 9 January 2024

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Abstract: We study the stability of the Lanczos algorithm run on problems whose eigenvector empirical spectral distribution is near to a reference measure with well-behaved orthogonal polynomials. We give a backwards stability result which can be upgraded to a forward stability result when the reference measure has a density supported on a single interval with square root behavior at the endpoints. Our analysis implies the Lanczos algorithm run on many large random matrix models is fact forward stable, and hence nearly deterministic, even when computations are carried out in finite precision arithmetic. Since the Lanczos algorithm is not forward stable in general, this provides yet another example of the fact that random matrices are far from ``any old matrix, and care must be taken when using them to test numerical algorithms.


Full work available at URL: https://arxiv.org/abs/2302.14842




Recommendations




Cites Work






This page was built for publication: Stability of the Lanczos algorithm on matrices with regular spectral distributions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6185983)