Changing poles in the rational Lanczos method for the Hermitian eigenvalue problem

Numerical Linear Algebra with Applications

Volumn 8, Issue 1, 2001, Pages 33-52

  Meerbergen, K ^a  

^a Free Field Technologies   (Belgium)

Author keywords

Hermitian eigenvalue problem; Lanczos method; Rational Krylov sequence; Spectral transformation

Indexed keywords

EID: 0035585917     PISSN: 10705325     EISSN: None     Source Type: Journal    
DOI: 10.1002/1099-1506(200101/02)8:1<33::AID-NLA226>3.0.CO;2-B     Document Type: Article

References (30)

1. Grimes R, Lewis J, Simon H. Eigenvalue problems and algorithms in structural engineering. In Cullum J, Willoughby R Large Scale Eigenvalue Problems, (eds), Elsevier Science: Amsterdam, 1986; 81-93.
2. Pierce AD. Acoustics - An Introduction to its Physical Principles and Applications. Mc-Graw Hill: New York, 1981.
3. Ericsson T, Ruhe A. The spectral transformation Lanczos method for the numerical solution of large sparse generalized symmetric eigenvalue problems. Mathematics of Computation 1980; 35:1251-1268.
4. Nour-Omid B, Parlett B, Ericsson T, Jensen P. How to implement the spectral transformation. Mathematics of Computation 1987; 48:663-673.
5. Grimes R, Lewis J, Simon H. A shifted block Lanczos algorithm for solving sparse symmetric generalized eigenproblems. SIAM Journal on Matrix Analysis and Applications 1994; 15:228-272.
6. Ruhe A. Rational Krylov sequence methods for eigenvalue computation. Linear Algebra and its Applications 1984; 58:391-405.
7. Ruhe A. Rational Krylov: a practical algorithm for large sparse nonsymmetric matrix pencils. SIAM Journal on Scientific Computing 1998; 19(5):1535-1551.
8. Arnoldi W. The principle of minimized iterations in the solution of the matrix eigenvalue problem. Quarterly of Applied Mathematics 1951; 9:17-29.
9. Saad Y. Numerical Methods for Large Eigenvalue Problems. Algorithms and Architectures for Advanced Scientific Computing. Manchester University Press: Manchester, UK, 1992.
10. Higham N. Accuracy and Stability of Numerical Algorithms. SIAM: Philadelphia, PA, 1996.
11. Lanczos C. An iteration method for the solution of the eigenvalue problem of linear differential and integral operators. Journal of Research of the National Bureau of Standards 1950; 45:255-282.
12. Parlett B. The symmetric eigenvalue problem. Prentice Hall Series in Computational Mathematics. Prentice-Hall: Englewood Cliffs, NJ, 1980.
13. Daniel J, Gragg W, Kaufman L, Stewart G. Reorthogonalization and stable algorithms for updating the Gram-Schmidt QR factorization. Mathematics of Computation 1976; 30:772-795.
14. Sorensen D. Implicit application of polynomial filters in a k-step Arnoldi method. SIAM Journal on Matrix Analysis and Applications, 1992; 13:357-385.
15. Golub G, Van Loan C. Matrix Computations (3rd edn). The Johns Hopkins University Press: Baltimore, MD, 1996.
16. Paige C, Parlett B, van der Vorst H. Approximate solutions and eigenvalue bounds from Krylov subspaces. Numerical Linear Algebra with Applications 1995; 2:115-133.
17. Sleijpen G, van der Vorst H. A Jacobi-Davidson iteration method for linear eigenvalue problems. SIAM Journal on Matrix Analysis and Applications 1996; 17:401-425.
18. Ruhe A. Rational Krylov algorithms for nonsymmetric eigenvalue problems, II: matrix pairs. Linear Algebra and its Applications 1994; 197(198):283-296.
19. Lehoucq R, Sorensen D. Deflation techniques within an implicitly restarted Arnoldi iteration. SIAM Journal on Matrix Analysis and Applications 1996; 17:789-821.
20. De Samblanx G, Meerbergen K, Bultheel A. The implicit application of a rational filter in the RKS method. BIT 1997; 37:925-947.
21. Meerbergen K, Spence A. Implicitly restarted Arnoldi and purification for the shift-invert transformation. Mathematics of Computation 1997; 66:667-689.
22. Lehoucq RB, Sorensen DC, Yang C. ARPACK USERS GUIDE: Solution of Large Scale Eigenvalue Problems with Implicitly Restarted Arnoldi Methods. SIAM: Philadelphia, PA, 1998.
23. Lehoucq R. On the convergence of an implicitly restarted Arnoldi method. Technical Report SAND99-17561, Sandia National Laboratories, MS 1110, P.O. Box 5800, Albuquerque, NM 87185-1110, 1999.
24. Calvetti D, Reichel L, Sorensen D. An implicitly restarted Lanczos method for large symmetric eigenvalue problems. ETNA 1994; 2:1-21.
25. Morgan R. On restarting the Arnoldi method for large nonsymmetric eigenvalue problems. Mathematics of Computation 1996; 65:1213-1230.
26. Björck Å. Numerical Methods for Least Squares Problems. SIAM: Philadelphia PA, 1996.
27. Sandhu R, Pister K. A variational principle for linear coupled field problems in continuum mechanics. International Journal of Engineering and Science 1970; 8:989-999.
28. Simon B, Wu J, Zienkiewicz O, Paul D. Evaluation of u-w and u-p finite element methods for the dynamic response of saturated porous media using one-dimensional models. International Journal for Numerical Analysis and in Methods Geomechaics 1986; 10:461-482.
29. Meerbergen K, Scott J. Design and development of a block rational Lanczos method with partial reorthogonalization and implicit restarting. Technical Report RAL-TR-2000-Oll, Rutherford Appleton Laboratory, Chilton, Didcot, Oxon OX11 OQX, UK, 2000. Available through http://www.numerical. rl.ac.uk/reports/reports.html.
30. HSL 2000. A collection of Fortran codes for large scale scientific computation, 2000. Information available on http://www.numerical.rl.ac.uk/hsl/.