An analysis of the Rayleigh-Ritz method for approximating eigenspaces

Mathematics of Computation

Volumn 70, Issue 234, 2001, Pages 637-647

  Jia, Zhongxiao ^a   Stewart, G W ^b  

^a DALIAN UNIVERSITY OF TECHNOLOGY   (China)

^b University of Maryland ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0035531373     PISSN: 00255718     EISSN: None     Source Type: Journal    
DOI: 10.1090/S0025-5718-00-01208-4     Document Type: Article

References (14)

1. R. Bhatia, L. Elsner, and G. Krause, Bounds for the variation of the roots of a polynomial and the eigenvalues of a matrix, Linear Algebra and Its Applications 142 (1990), 195-209. MR 92i:12001
2. L. Elsner, An optimal bound for the spectral variation of two matrices, Linear Algebra and Its Applications 71 (1985), 77-80. MR 87c:15035
3. G. H. Golub and C. F. Van Loan, Matrix computations, second ed., Johns Hopkins University Press, Baltimore, MD, 1989. MR 90d:65055
4. I. C. F. Ipsen, Absolute and relative perturbation bounds for invariant subspaces of matrices, Technical Report TR97-35, Center for Research in Scientific Computation, Mathematics Department, North Carolina State Unversity, 1998.
5. Z. Jia, Some numerical methods for large unsymmetric eigenproblems, Ph.D. thesis, University of Bielefeld, 1994.
6. _, The convergence of generalized Lanczos methods for large unsymmetric eigenproblems, SIAM Journal on Matrix Analysis and Applications 16 (1995), 843-862. MR 96d:65062
7. _, Refined iterative algorithm based on Arnoldi's process for large unsymmetric eigenproblems, Linear Algebra and Its Applications 259 (1997), 1-23. MR 98c:65060
8. _, Generalized block Lanczos methods for large unsymmetric eigenproblems, Numerische Mathematik 80 (1998), 171-189. MR 95f:65059
9. _, A refined iterative algorithm based on the block Arnoldi algorithm, Linear Algebra and Its Applications 270 (1998), 171-189. MR 98m:65055
10. _, Polynomial characterizations of the approximate eigenvectors by the refined Arnoldi method and an implicitly restarted refined Arnoldi algorithm, Linear Algebra and Its Applications 287 (1999), 191-214. MR 99j:65046
11. _, A refined subspace iteration algorithm for large sparse eigenproblems, To appear in Applied Numerical Mathemtics., 1999.
12. Y. Saad, Numerical methods for large eigenvalue problems: Theory and algorithms, John Wiley, New York, 1992. MR 93h:65052
13. G. L. G. Sleijpen and H. A. Van der Vorst, A Jacobi-Davidson iteration method for linear eigenvalue problems, SIAM Journal on Matrix Analysis and Applications 17 (1996), 401-425. MR 96m:65042
14. G. W. Stewart and J.-G. Sun, Matrix perturbation theory, Academic Press, New York, 1990. MR 92a:65017