Deflation techniques for an implicitly restarted Arnoldi iteration

SIAM Journal on Matrix Analysis and Applications

Volumn 17, Issue 4, 1996, Pages 789-821

  Lehoucq, R B ^a,b   Sorensen, D C ^a  

^a RICE UNIVERSITY   (United States)

^b ARGONNE NATIONAL LABORATORY   (United States)

Author keywords

Arnoldi method; Deflation; Eigenvalues; Implicit restarting; Lanczos method

Indexed keywords

EID: 0030502142     PISSN: 08954798     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895479895281484     Document Type: Article

References (40)

1. W. E. ARNOLDI, The principle of minimized iterations in the solution of the matrix eigenvalue problem, Quart. Appl. Math., 9 (1951), pp. 17-29.
2. Z. BAI AND J. W. DEMMEL, On swapping diagonal blocks in real Schur form, Linear Algebra Appl., 186 (1993), pp. 73-95.
3. R. H. BARTELS AND G. W. STEWART, Algorithm 432: Solution of the matnx equation AX + XB = C, Comm. ACM, 15 (1972), pp. 820-826.
4. M. BENNANI AND T. BRACONNIER, Stopping Criteria for Eigensolvers, Tech. report TR/PA/93/25, CERFACS, Toulouse, France. 1993.
5. A. BOJANCZYK AND P. VAN DOOREN, Reordering diagonal blocks in the Schur form, in Linear Algebra for Large Scale and Real Time Applications, NATO ASI Series, Kluwer Academic Publishers, Norwell, MA, 1993, pp. 351-352.
6. T. BRACONNIER, The Arnoldi-Tchebycheff Algorithm for Solving Large Nonsymmetric Eigenproblems, Tech. report TR/PA/93/25, CERFACS, Toulouse, France, 1993.
7. D. CALVETTI, L REICHEL, AND D. C. SORENSEN, An implicitly restarted Lanczos method for large symmetric eigenvalue problems, Electron. Trans. Numer. Anal., 2 (1994), pp. 1-21.
8. F. CHATELIN, Eigenvalues of Matrices, John Wiley, New York, 1993.
9. F. CHATELIN AND V. FRAYSÉE, Qualitative Computing: Elements of a Theory for FinitePrecision Computation, Tech. report, CERFACS and THOMSON-CSF, June 1993. Lecture Notes for the Commett European Course, June 8-10, Orsay, France.
10. J. CULLUM AND W. E. DONATH, A block Lanczos algorithm for computing the q algebraically largest eigenvalues and a corresponding eigenspace for large, sparse symmetric matrices, in Proc. 1974 IEEE Conference on Decision and Control, New York, 1974, pp. 505-509.
11. J. DONGARRA, S. HAMMARLING, AND J. WILKINSON, Numerical considerations in computing invariant subspaces, SIAM J. Matrix Anal. Appl., 13 (1992), pp. 145-161.
12. I. S. DUFF AND J. A. SCOTT, Computing selected eigenvalues of large sparse unsymmetric matrices using subspace iteration, ACM Trans. Math. Software, 19 (1993), pp. 137-159.
13. W. FELLER AND G. FORSYTHE, New matrix transformations for obtaining characteristic vectors, Quart. Appl. Math., 8 (1951), pp. 325-331.
14. S. GODET-THOBIE, Eigenvalues of Large Highly Nonnormal Matrices, Ph.D. thesis, University Paris IX, Dauphine, Paris, France, 1993; Tech. report TH/PA/93/06, CERFACS, Toulouse, France, 1993.
15. G. H. GOLUB AND C. F. VAN LOAN, Matrix Computations, 2nd ed., The Johns Hopkins University Press, Baltimore, MD, 1989.
16. G. H. GOLUB, S. NASH, AND C. F. VAN LOAN, A Hessenberg-Schur method for the problem AX + XB = C, IEEE Trans. Automat. Control, AC-24 (1979), pp. 909-913.
17. G. H. GOLUB AND R. UNDERWOOD, The block Lanczos method for computing eigenvalues, in Mathematical Software III, J. R. Rice, ed., Academic Press, New York, 1977, pp. 361-377.
18. 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 (1994), pp. 228-272.
19. N. J. HIGHAM, Perturbation theory and backward error for AX - XB = C, BIT, 33 (1993), pp. 124-136.
20. _, The Test Matrix Toolbox for Matlab, Numerical Analysis Report 237, University of Manchester, England, 1993.
21. W. KARUSH, An iterative method for finding characteristics vectors of a symmetric matrix, Pacific J. Math., 1 (1951), pp. 233-248.
22. C. LANCZOS, An iteration method for the solution of the eigenvalue problem of linear differential and integral operators, J. Research Nat. Bur. Standards, 45 (1950), pp. 255-282.
23. R. B. LEHOUCQ, Analysis and Implementation of an Implicitly Restarted Iteration, Ph.D. thesis, Rice University, Houston, TX, May 1995; Tech. report TR95-13, Dept. of Computational and Applied Mathematics, Rice University, Houston, TX, 1993.
24. R. B. LEHOUCQ, D. C. SORENSEN, AND P. VU, ARPACK: An Implementation of the Implicitly Re-started Arnoldi Iteration That Computes Some of the Eigenvalues and Eigenvectors of a Large Sparse Matrix, 1995. Available from netlib@ornl.gov under the directory scalapack.
25. C. C. PAIGE, The Computation of Eigenvalues and Eigenvectors of Very Large Sparse Matrices, Ph.D. thesis, University of London, London, England, 1971.
26. B. N. PARLETT, The Symmetric Eigenvalue Problem, Prentice-Hall, Englewood Cliffs, NJ, 1980.
27. B. N. PARLETT AND J. LE, Forward instability of tridiagonal QR, SIAM J. Matrix Anal. Appl., 14 (1993), pp. 279-316.
28. B. N. PARLETT AND B. NOUR-OMID, The use of a refined error bound when updating eigenvalues of tridiagonals, Linear Algebra Appl., 68 (1984), pp. 179-219.
29. A. RUHE, An algorithm for numerical determination of the structure of a general matrix, BIT, 10 (1970), pp. 196-216.
30. Y. SAAD, Variations on Arnoldi's method for computing eigenelements of large unsymmetric matrices, Linear Algebra Appl., 34 (1980), pp. 269-295.
31. _, Numerical Methods for Large Eigenvalue Problems, Halsted Press, New York, 1992.
32. M. SADKANE, A block Arnoldi-Chebyshev method for computing the leading eigenpairs of large sparse unsymmetric matrices, Numer. Math., 64 (1993), pp. 181-193.
33. J. A. SCOTT, An Arnoldi code for computing selected eigenvalues of sparse real unsymmetric matrices, ACM Trans. Math. Software, 21 (1995), pp. 432-475.
34. D. C. SORENSEN, Implicit application of polynomial filters in a k-step Arnoldi method, SIAM J. Matrix Anal. Appl., 13 (1992), pp. 357-385.
35. G. W. STEWART, ALGORITHM 506: HQR3 and EXCHANG: Fortran subroutines for calculating and ordering the eigenvalues of a real upper Hessenberg matrix [F2], ACM Trans. Math. Software, 2 (1976), pp. 275-280.
36. _, Perturbation bounds for the QR factorization of a matrix, SIAM J. Numer. Anal., 14 (1977), pp. 509-518.
37. W. STEWART AND A. JENNINGS, A simultaneous iteration algorithm for real matrices, ACM Trans. Math. Software, 7 (1981), pp. 184-198.
38. J. M. VARAH, On the separation of two matrices, SIAM J. Numer. Anal., 16 (1979), pp. 216-222.
39. D. S. WATKINS, Forward stability and transmission of shifts in the QR algorithm, SIAM J. Matrix Anal Appl., 16 (1995), pp. 469-487.
40. J. H. WILKINSON, The Algebraic Eigenvalue Problem, Clarendon Press, Oxford, UK, 1965.