Abstract
This paper concerns the Rayleigh–Ritz method for computing an approximation to an eigenspace X \mathcal {X} of a general matrix A A from a subspace W \mathcal {W} that contains an approximation to X \mathcal {X} . The method produces a pair ( N , X ~ ) (N, \tilde X) that purports to approximate a pair ( L , X ) (L, X) , where X X is a basis for X \mathcal {X} and A X = X L AX = XL . In this paper we consider the convergence of ( N , X ~ ) (N, \tilde X) as the sine ϵ \epsilon of the angle between X \mathcal {X} and W \mathcal {W} approaches zero. It is shown that under a natural hypothesis — called the uniform separation condition — the Ritz pairs ( N , X ~ ) (N, \tilde X) converge to the eigenpair ( L , X ) (L, X) . When one is concerned with eigenvalues and eigenvectors, one can compute certain refined Ritz vectors whose convergence is guaranteed, even when the uniform separation condition is not satisfied. An attractive feature of the analysis is that it does not assume that A A has distinct eigenvalues or is diagonalizable.
Cite
CITATION STYLE
Jia, Z., & Stewart, G. (2000). An analysis of the Rayleigh–Ritz method for approximating eigenspaces. Mathematics of Computation, 70(234), 637–647. https://doi.org/10.1090/s0025-5718-00-01208-4
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.