Residuals of refined projection methods for large matrix eigenproblems

Computers and Mathematics with Applications

Volumn 41, Issue 7-8, 2001, Pages 813-820

  Jia, Zhongxiao ^a  

^a DALIAN UNIVERSITY OF TECHNOLOGY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; CONVERGENCE OF NUMERICAL METHODS; ERROR STATISTICS; ITERATIVE METHODS; MATRIX ALGEBRA; POLYNOMIALS; VECTORS;

ARNOLDI ALGORITHMS; REFINED PROJECTION METHODS; REFINED RITZ VECTORS;

EIGENVALUES AND EIGENFUNCTIONS;

EID: 0035313102     PISSN: 08981221     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0898-1221(00)00321-7     Document Type: Article

References (19)

1. Saad Y. Numerical methods for large eigenvalue problems. Algorithms and Architectures for Advanced Scientific Computing. 1992;Manchester University Press.
2. Parlett B.N. The Symmetric Eigenvalue Problem. 1980;Prentice-Hall, Englewood Cliffs, NJ.
3. Arnoldi W.E. The principle of minimized iterations in the solution of the matrix eigenvalue problem. Quart. Appl. Math. 9:1951;17-29.
4. Jia Z. Generalized block Lanczos methods for large unsymmetric eigenproblems. Numer. Math. 80:1998;239-266.
5. Morgan R.B., Zeng M. Harmonic projection methods for large nonsymmetric eigenvalue problems. Numer. Linear Algebra Appl. 5:1998;33-55.
6. Sleijpen G.L.G., Van der Vorst H.A. A Jacobi-Davidson iteration methods for linear eigenvalue problems. SIAM J. Matrix Anal. Appl. 17:1996;401-425.
7. Jia Z. Some numerical methods for large unsymmetric eigenproblems. Ph.D. Thesis. February 1994;University of Bielefeld.
8. Jia Z. The convergence of generalized Lanczos methods for large unsymmetric eigenproblems. SIAM J. Matrix Anal. Appl. 16:1995;843-862.
9. Jia Z. Composite orthogonal projection methods for large matrix eigenproblems. Science in China (Series A). 42:1999;577-585.
10. Z. Jia and G.W. Stewart, An analysis of the Rayleigh-Ritz method for approximating eigenspaces, Math. Comput. (to appear).
11. Jia Z. Refined iterative algorithms based on Arnoldi's process for large unsymmetric eigenproblems. Linear Algebra Appl. 259:1997;1-23.
12. Jia Z. A refined iterative algorithm based on the block Arnoldi process for large unsymmetric eigenproblems. Linear Algebra Appl. 270:1998;171-189.
13. Jia Z. A refined subspace iteration algorithm for large sparse eigenproblems. Appl. Numer. Appl. 32:2000;35-52.
14. Z. Jia and Y. Zhang, An implicitly restarted harmonic Arnoldi algorithm for large unsymmetric matrix eigenproblems, Tech. Rep., (submitted).
15. Chen G. Some refined algorithms for large unsymmetric eigenproblems. Ph.D. Thesis. July 2000;Dalian University of Technology. Department of Applied Mathematics.
16. Jia Z. Polynomial characterizations of the approximate eigenvectors by the refined Arnoldi method and an implicitly restarted refined Arnoldi algorithm. Linear Algebra Appl. 287:1999;191-214.
17. G.W. Stewart, Matrix Algorithms: Volume II, Eigensystems, SIAM, Philadelphia, PA (to appear).
18. Sorensen D. Implicit application of polynomial filters in a k-step Arnoldi method. SIAM J. Matrix Anal. Appl. 12:1992;357-385.
19. rd Edition Matrix Computations. 1996;The Hopkins University Press, Baltimore, MD.