A refined iterative algorithm based on the block Arnoldi process for large unsymmetric eigenproblems

Linear Algebra and Its Applications

Volumn 270, Issue 1-3, 1998, Pages 171-189

  Jia, Zhongxiao ^a  

^a DALIAN UNIVERSITY OF TECHNOLOGY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0042496332     PISSN: 00243795     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0024-3795(97)00023-2     Document Type: Article

References (24)

1. W. E. Arnoldi, The principle of minimized iterations in the solution of the matrix eigenvalue problem, Quart. Appl. Math. 9:17-29 (1951).
2. Z. Bai, R. Barrett, D. Day, J. Demmel, and J. Dongarra, Test matrix collection (non-Hermitian eigenvalue problems), Tech. Rep., Mathematics Dept., Univ. of Kentucky, 1996.
3. G. H. Golub and C. F. van Loan, Matrix Computations, 2nd ed., Johns Hopkins U.P., Baltimore, 1989.
4. D. Ho, Tchebychev acceleration technique for large scale nonsymmetric matrices, Numer. Math. 86:721-734 (1990).
5. Z. Jia, Some Numerical Methods for Large Unsymmetric Eigenproblems, Ph.D. Thesis, Mathematics Dept., Univ. of Bielefeld, Germany, 1994.
6. Z. Jia, The convergence of generalized Lanczos methods for large unsymmetric eigenproblems, SIAM J. Matrix Anal. Appl. 16:843-862 (1995).
7. Z. Jia, A block incomplete orthogonalization method for large nonsymmetric eigenproblems, BIT 35:516-539 (1995).
8. Z. Jia, Generalized block Lanczos methods for large unsymmetric eigenproblems, Numer. Math., to appear.
9. Z. Jia, Refined iterative algorithms based on Arnoldi's process for large unsymmetric eigenproblems, Linear Algebra Appl. 259:1-23 (1997).
10. Z. Jia, Arnoldi type algorithms for large unsymmetric multiple eigenvalue problems, J. Comput. Math., to appear.
11. Z. Jia, A class of new projection methods for non-Hermitian matrix eigenproblems, in Proceedings of the Third China-Japan Seminar on Numerical Mathematics (Z. C. Shi, Ed.), Academic Press, Beijing, 1997.
12. Z. Jia, Some natures and properties of refined orthogonal projection methods for large eigenproblems, submitted for publication.
13. Z. Jia, A refined subspace iteration algorithm for large sparse eigenproblems, submitted for publication.
14. W. Kerner, Large-scale complex eigenvalue problems, J. Comput. Phys. 53:1-85 (1989).
15. A. Ruhe, The two-sided Arnoldi algorithm for nonsymmetric eigenvalue problems, in Matrix Pencils (B. Kågström and A. Ruhe, Eds.), Lecture Notes in Math. 973, Springer-Verlag, Berlin, 1983, pp. 104-120.
16. A. Ruhe, Rational Krylov algorithms for nonsymmetric eigenvalue problems. II. Matrix pairs, Linear Algebra Appl. 197/198:283-296 (1994).
17. Y. Saad, Variations on Arnoldi's method for computing eigenelements of large unsymmetric matrices, Linear Algebra Appl. 34:269-295 (1980).
18. Y. Saad, Projection methods for solving large sparse eigenvalue problems, in Matrix Pencils (B. Kågström and A. Ruhe, Eds.), Lecture Notes in Mathematics 973, Springer-Verlag, Berlin, 1983, pp. 121-144.
19. Y. Saad, Chebyshev acceleration techniques for solving nonsymmetric eigenvalue problems, Math. Comput. 42:567-588 (1984).
20. Y. Saad, Numerical Methods for Large Eigenvalue Problems, Algorithms and Architecture for Advanced Scientific Computing, Manchester U.P., 1992.
21. M. Sadkane, A block Arnoldi-Chebyshev method for computing the leading eigenpairs of large sparse unsymmetric matrices, Numer. Math. 64:181-194 (1993).
22. M. Sadkane, Block-Arnoldi and Davidson methods for unsymmetric large eigenvalue problems, Numer. Math. 64:195-212 (1993).
23. J. A. Scott, An Arnoldi code for computing selected eigenvalues of sparse real unsymmetric matrices, ACM Trans. Math. Software 21:432-475 (1995).
24. D. C. Sorensen, Implicit application of polynomial filters in a k-step Arnoldi method, SIAM J. Matrix Anal. Appl. 13:357-385 (1992).