Which Eigenvalues Are Found by the Lanczos Method?

Authors:
A. B. J. Kuijlaars
Affiliations:
-
Venue:
SIAM Journal on Matrix Analysis and Applications
Year:
2000

Citing 0
Cited 7

Bipartite isoperimetric graph partitioning for data co-clustering

Data Mining and Knowledge Discovery
A numerical solution of the constrained energy problem

Journal of Computational and Applied Mathematics
A numerical solution of the constrained weighted energy problem

Journal of Computational and Applied Mathematics
On the Convergence of Rational Ritz Values

SIAM Journal on Matrix Analysis and Applications
Investigation of Preconditioning Techniques for the Iteratively Regularized Gauss-Newton Method for Exponentially Ill-Posed Problems

SIAM Journal on Scientific Computing
On spectral approximation, Følner sequences and crossed products

Journal of Approximation Theory
An implicitly restarted Lanczos bidiagonalization method with refined harmonic shifts for computing smallest singular triplets

Journal of Computational and Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

When discussing the convergence properties of the Lanczos iteration method for the real symmetric eigenvalue problem, Trefethen and Bau noted that the Lanczos method tends to find eigenvalues in regions that have too little charge when compared to an equilibrium distribution. In this paper a quantitative version of this rule of thumb is presented. We describe, in an asymptotic sense, the region containing those eigenvalues that are well approximated by the Ritz values. The region depends on the distribution of eigenvalues and on the ratio between the size of the matrix and the number of iterations, and it is characterized by an extremal problem in potential theory which was first considered by Rakhmanov. We give examples showing the connection with the equilibrium distribution.