A refined shift-and-invert arnoldi algorithm for large unsymmetric generalized eigenproblems

Computers and Mathematics with Applications

Volumn 44, Issue 8-9, 2002, Pages 1117-1127

  Jia, Zhongxiao ^a   Zhang, Yong ^b  

^a TSINGHUA UNIVERSITY   (China)

^b DALIAN UNIVERSITY OF TECHNOLOGY   (China)

Author keywords

Arnoldi method; Convergence; Large generalized eigenproblem; Matrix pair; Refined Arnoldi method; Refined Ritz vector; Ritz value; Ritz vector; Shift and invert

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; CONVERGENCE OF NUMERICAL METHODS; EIGENVALUES AND EIGENFUNCTIONS; MATRIX ALGEBRA; VECTORS;

ARNOLDI ALGORITHM;

PROBLEM SOLVING;

EID: 0036773184     PISSN: 08981221     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0898-1221(02)00220-1     Document Type: Article

References (21)

1. Z. Bai, R. Barret, D. Day. J. Demmel and J Dongarra, Test Matrix Collection for Non-Hermitian Eigenvalue Problems, Matrix Market, (1998); http://math.nist.gov/MatrixMarket.
2. Y. Saad, Numerical Methods for Large Eigenvalue Problems, Manchester University Press in Algorithms and Architectures for Advanced Scientific Computing, (1992).
3. T. Ericsson and A. Ruhe, The spectral transformation Lanczos method for the numerical solution of large sparse generalized symmetric eigenvalue problems, Math. Comput. 35, 1251-1268, (1980).
4. R.G. Grimes, J.G. Lewis and H.D. Simon, A shifted block Lanczos algorithm for solving sparse symmetric generalized eigenproblems, SIAM J. Matrix Anal. Appl. 15, 228-272, (1994).
5. A. Ruhe, Rational Krylov sequence methods for eigenvalue computation, Linear Algebra Appl. 58, 391-405, (1984).
6. A. Ruhe, Rational Krylov algorithms for nonsymmetric eigenvalue problems, In Recent Advances in Iterative Methods, IMA Vol. Math. Appl. 60, (Edited by G. Golub, A. Greenbaum and M. Luskin), pp. 149-164, Springer-Verlag, New York, (1994).
7. A. Ruhe, Rational Krylov algorithms for nonsymmetric eigenvalue problems, II: Matrix pairs, Linear Algebra Appl. 197/198. 283-296. (1994).
8. A. Ruhe, The rational Krylov algorithms for nonsymmetric eigenvalue problems, III: Complex shifts for real matrices, BIT 34, 165-176, (1994).
9. A. Ruhe, Rational Krylov: A practical algorithm for large sparse nonsymmetric matrix pencils, SIAM J. Sci. Comput. 19, 1535-1551, (1998).
10. Z. Jia, The convergence of generalized Lanczos methods for large unsymmetric eigenproblems, SIAM J. Matrix Anal. Appl. 16, 843-862, (1995).
11. Z. Jia. Composite orthogonal projection methods for large eigenproblems, Science in China, Set. A 42, 577-585. (1999).
12. Z. Jia and G.W. Stewart, An analysis of the Rayleigh-Ritz method for approximate eigenspaces, Math. Comput. 70, 637-647, (2001).
13. Z. Jia, Refined iterative algorithms based on Arnoldi's process for large unsymmetric eigenproblems, Linear Algebra Appl. 259, 1-23, (1997).
14. Z. Jia, A refined iterative algorithm based on the block Arnoldi process for large unsymmetric eigenproblems, Linear Algebra Appl. 270, 171-189, (1998).
15. Z. Jia, Polynomial characterizations of the approximate eigenvectors by the refined Arnoldi method and an implicitly restarted refined Arnoldi algorithm, Linear Algebra Appl. 287, 191-214, (1999).
16. Z. Jia, A refined subspace iteration algorithm for large sparse eigenproblems, Appl. Numer. Math. 32, 35-52, (2000).
17. Z. Jia, Residuals of refined projection methods for large matrix eigenproblems, Computers Math. Applic. 41 (7/8), 813-820, (2001).
18. Z. Jia, The refined harmonic Arnoldi method and an implicitly restarted refined algorithm for computing interior eigenpairs of large matrices, Appl. Numer. Math. (to appear).
19. G.W. Stewart, Matrix Algorithms: Vol. II, Eigensystems, SIAM. Philadelphia, (2001).
20. H.A. Van der Vorst, Computational Methods for Large Eigenvalue Problems, Elsevier-North Holland, (2001).
21. The Math Works, Partial Differential Toolbox for Use with MATLAB, Natick, MA, (1995).