Which eigenvalues are found by the Lanczos method?
\textit{L. N. Trefethen} and \textit{D. B. Bau} [Numerical linear algebra (1997; Zbl 0874.65013)] stated the thumb rule that the Lanczos iteration tends to converge to eigenvalues of real symmetric matrices that lie in regions of ``too little charge for an equilibrium distribution, so that outliers are well approximated, whereas eigenvalues in the bulk of the spectrum are poorly approximated.NEWLINENEWLINENEWLINEThe paper has the goal to provide a quantitative version of this rule, asymptotically for matrix size \(N\) and number of iterations \(n\). It uses results of \textit{E. A. Rakhmanov} [Sb. Math. 187, No. 8, 1213-1228 (1996; Zbl 0873.42014)] to obtain a potential-theoretic characterization of the problem as an extremal problem.
- The Lanczos Algorithm Under Few Iterations: Concentration and Location of the Output
- Sharpness in rates of convergence for the symmetric Lanczos method
- On Stabilization and Convergence of Clustered Ritz Values in the Lanczos Method
- scientific article; zbMATH DE number 4143345
- Probabilistic Bounds on the Extremal Eigenvalues and Condition Number by the Lanczos Algorithm
- Analysis of peaks and plateaus in a Galerkin/minimal residual pair of methods for solving \(Ax=b\)
- An implicit filter for rational Krylov using core transformations
- Random matrix theory for complexity growth and black hole interiors
- An extended Hessenberg form for Hamiltonian matrices
- Necessary and sufficient conditions for orthogonal similarity transformations to obtain the Arnoli(Lanczos)-Ritz values
- An implicitly restarted Lanczos bidiagonalization method with refined harmonic shifts for computing smallest singular triplets
- Extremal polynomials on the \(n\)-grid
- Rational Krylov approximation of matrix functions: numerical methods and optimal pole selection
- Agglomeration multigrid methods with implicit Runge-Kutta smoothers applied to aerodynamic simulations on unstructured grids
- Sharpness in rates of convergence for the symmetric Lanczos method
- On spectral approximation, Følner sequences and crossed products
- A reflection on the implicitly restarted Arnoldi method for computing eigenvalues near a vertical line
- Superlinear convergence of the rational Arnoldi method for the approximation of matrix functions
- Convergence of the block Lanczos method for eigenvalue clusters
- The Lanczos Algorithm Under Few Iterations: Concentration and Location of the Output
- Constrained Leja points and the numerical solution of the constrained energy problem
- A numerical solution of the constrained weighted energy problem
- Extremal rational functions on symmetric discrete sets and superlinear convergence of the ADI method
- Towards understanding CG and GMRES through examples
- A unification of unitary similarity transforms to compressed representations
- A numerical solution of the constrained energy problem
This page was built for publication: Which eigenvalues are found by the Lanczos method?
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2706258)
