Arnoldi type algorithms for large unsymmetric multiple eigenvalue problems

Journal of Computational Mathematics

Volumn 17, Issue 3, 1999, Pages 257-274

  Jia, Zhong Xiao ^a  

^a DALIAN UNIVERSITY OF TECHNOLOGY   (China)

Author keywords

Arnoldi's process; Diagonalizable; Error bounds; Large unsymmetric matrix; Multiple eigenvalue

Indexed keywords

EID: 33644476760     PISSN: 02549409     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (30)

1. W.E. Arnoldi, The principle of minimized iteration in the solution of the matrix eigenvalue problem, Quart. Appt. Math., 9 (1951), 11-29.
2. Z. Bai, R. Barrett, D. Day, J. Demmel, J. Dongarra, Test matrix collection (non-Hermitian eigenvalue problems), Tech. Rep., Math. Dept., University of Kentucky, 1996.
3. F. Chatelin, S. Godet-Thobie, Stability Analysis in Aeronautical Industries, Proceedings of the 2nd Symposium on High Performance Computing, Eds. M. Durand and F.E1. Dabaghi, Elsevier/North-Holland, (1991), 415-422.
4. F. Chatelin, Eigenvalues of Matrices, John Wiley and Sons, 1993.
5. J. Cullum, R.A. Willoughby, Lanczos Algorithms for Large Symmetric Eigenvalue Computations, Vol.1, Theory, Vol.2, Programs, Birkhäuser, Basel, 1985.
6. J. Cullum, R.A. Willoughby, A Practical Procedure for Computing Eigenvalues of Large Sparse Nonsymmetric Matrices, in Large Scale Eigenvalue Problem, Eds. J. Cullum and R.A. Willoughby, Elsevier/North-Holland, 1986, 199-240.
7. G.W. Daniel, G.B. Gragg, L. Kaufmann G.W. Stewart, Reorthogonalization and stable algorithms for updating the Gram-Schmidt QR factorization, Math. Comput., 30 (1976), 772-795.
8. R.G. Grimes, J.G. Lewis, H.D. Simon, A shifted block Lanczos algorithm for solving sparse symmetric generalized eigenproblems, SIAM J. Matrix Anal. Appl., 15 (1994), 228-272.
9. D. Ho, F. Chatelin, M. Bennani, Arnoldi-Tchebychev procedure for large nonsymmetric matrices, Math. Mod. Numer. Anal., 24 (1990), 53-65.
10. Z. Jia, Some Numerical Methods for Large Unsymmetric Eigenproblems, Ph.D. thesis, Math. Dept., University of Bielefeld, Germany, 1994.
11. Z. Jia, The convergence of generalized Lanczos methods for large unsymmetric eigenproblems, SIAM J. Matrix Anal. Appl., 16 (1995), 843-862.
12. Z. Jia, A block incomplete orthogonalization method for large unsymmetric eigenproblem, BIT, 35 (1995), 516-539.
13. Z. Jia, Refined iterative algorithms based on Arnoldi's process for large unsymmetric eigenproblems, Linear Algebra Appl., 259 (1997), 1-23.
14. Z. Jia, Generalized block Lanczos methods for large unsymmetric eigenproblems, Numer. Math., 80 (1998), 239-266.
15. Z. Jia, A refined iterative algorithm based on the block Arnoldi process for large unsymmetric eigenproblems, Linear Algebra Appl., 270 (1998), 171-189.
16. Z. Jia, 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. Z. Jia, Composite orthogonal projection methods for large matrix eigenproblems, Science in China (Series A), 42 (1999), 577-585.
18. Z. Jia, Arnoldi type algorithms for large unsymmetric multiple eigenvalue problems, Tech. Rep. 95-026, Math. Dept., University of Bielefeld, Germany, 1995.
19. Z. Jia, L. Elsner, Improving eigenvectors in Arnoldi's method, J. Comput. Math., to appear.
20. C. Lanczos, An iteration method for the solution of the eigenvalue problem of linear differential and integral operators, J. Res. Nat. Bur. Stand., 45 (1950), 225-280.
21. B.N. Parlett, D.C. Scott, The Lanczos algorithm with selective orthogonalization, Math. Comput., 33 (1979), 217-238.
22. B.N. Parlett, The Symmetric Eigenvalue Problem, Prentice-Hall, Englewood Cliffs, N.J., 1980.
23. A. Ruhe, The Two Sided Arnoldi Algorithm for Nonsymmetric Eigenvalue Problems, Matrix Pencils, Lecture Notes in Mathematics 973, Eds. B.K. Kagström and A. Ruhe, Springer-Verlag, Berlin, 1983, 104-120.
24. A. Ruhe, Rational Krylov algorithms for nonsyrametric eigenvalue problems. II. Matrix pairs, Linear Algebra Appl., 197/198 (1994), 283-295.
25. Y. Saad, Variations on Arnoldi's method for computing eigenelements of large nonsymmetric matrices, Linear Algebra Appl., 34 (1980), 269-295.
26. Y. Saad, Projection Methods for Solving Large Eigenvalues Problems, Matrix Pencils, Lecture Notes in Mathematics 973, Eds. B.K. Kagström and A. Ruhe, Springer-Verlag, Berlin, 1983, 121-144.
27. Y. Saad, Chebyshev acceleration techniques for solving nonsymmetric eigenvalue problems, Math. Comput., 42 (1984), 567-588.
28. D.C. Sorensen, Implicit application of polynomial filters in a fc-step Arnoldi method, SIAM J. Matrix Anal. Appl., 13 (1992), 357-385.
29. G.W. Stewart, J.-G. Sun, Matrix Perturbation Theory, Academic Press, Boston, 1990.
30. J.H. Wilkinson, The Algebraic Eigenvalue Problem, Clarendon Press, Oxford, 1965.