Uniform Error Estimates for the Lanczos Method
Author:
- John C. UrschelJUJohn C. Urschel
- 1 January 2021
- journal article
- research article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Matrix Analysis and Applications
- Vol. 42 (3) , 1423-1450
Abstract
The Lanczos method is one of the most powerful and fundamental techniques for solving an extremal symmetric eigenvalue problem. Convergence-based error estimates depend heavily on the eigenvalue ga...Keywords
All Related Versions
Funding Information
- Office of Naval Research (N00014-17-1-2177)
This publication has 21 references indexed in Scilit:
- A fast divide-and-conquer algorithm for computing the spectra of real symmetric tridiagonal matricesApplied and Computational Harmonic Analysis, 2013
- Finding Structure with Randomness: Probabilistic Algorithms for Constructing Approximate Matrix DecompositionsSIAM Review, 2011
- An elementary proof of a theorem of Johnson and LindenstraussRandom Structures & Algorithms, 2002
- On the Randomized Error of Polynomial Methods for Eigenvector and Eigenvalue EstimatesJournal of Complexity, 1997
- Probabilistic Bounds on the Extremal Eigenvalues and Condition Number by the Lanczos AlgorithmSIAM Journal on Matrix Analysis and Applications, 1994
- Estimating the Largest Eigenvalue by the Power and Lanczos Algorithms with a Random StartSIAM Journal on Matrix Analysis and Applications, 1992
- On Estimates for the Weights in Gaussian Quadrature in the Ultraspherical CaseMathematics of Computation, 1990
- On estimating the largest eigenvalue with the Lanczos algorithmMathematics of Computation, 1982
- On the Rates of Convergence of the Lanczos and the Block-Lanczos MethodsSIAM Journal on Numerical Analysis, 1980
- Estimates for some computational techniques in linear algebraMathematics of Computation, 1966