A refined unsymmetric Lanczos eigensolver for computing accurate eigentriplets of a real unsymmetric matrix

Electronic Transactions on Numerical Analysis

Volumn 28, Issue , 2007, Pages 95-113

  Tremblay, Jean Christophe ^a   Carrington Jr , Tucker ^a  

^a UNIVERSITÉ DE MONTRÉAL   (Canada)

Author keywords

Eigenproblem; Lanczos algorithm; Un symmetric matrices

Indexed keywords

MATRIX ALGEBRA;

EIGENPROBLEM; EIGENSOLVERS; EIGENVALUES; EIGENVALUES AND EIGENVECTORS; LANCZOS ALGORITHM; LANCZOS VECTORS; SYMMETRIC MATRICES; UNSYMMETRIC MATRICES;

EIGENVALUES AND EIGENFUNCTIONS;

EID: 54549105422     PISSN: None     EISSN: 10689613     Source Type: Journal    
DOI: None     Document Type: Article

References (44)

1. P. ARBENZ, U. L. HETMANIUK, R. B. LEHOUCQ, AND R. S. TUMINARO, A comparison of eigensolvers for large-scale 3D modal analysis using AMG-preconditioned iterative methods, Internat. J. Numer. Methods Engrg., 64 (2005), pp. 204-236.
2. J. BAOLAMA, D. CALVETTI, AND L. REICHEL, Iterative methods for the computation of a few eigenvalues of a large symmetric matrix, BIT, 36 (1996), pp. 400-421.
3. Z. BAI, Error analysis of the Lanczos algorithm for the nonsymmetric eigenvalue problem, Math. Comp., 62 (1994), pp. 209-226.
4. Z. BAI, D. DAY, AND Q. YE ABLE: An adaptive block-Lanczos method for non-Hermitian eigenvalue problems, SIAM J. Matrix Anal. Appl., 20 (1999), pp. 1060-1082.
5. Z. BAI, J. DEMMEL, J. DONOARRA, A. RUHE, AND H. A. VAN DER VORST, eds., Templates for the Solution of Algebraic Eigenvalue Problems: A Practical Guide, SIAM, Philadelphia, 2000.
6. J. G. L. BOOTEN AND H. A. VAN DER VORST, Cracking large-scale eigenvalue computations, part I: algorithms, Comput. Phys., 10 (1996), pp. 239-242.
7. M. J. BRAMLEY AND T. CARRINGTON JR. A general discrete variable method to calculate vibrational energy levels of three- and four-atom molecules, J. Chem. Phys., 99, (1993), pp. 8519-8541.
8. T. CARRINOTON JR., Methods for calculating vibrational energy levels, Can. J. Chem., 82 (2003), pp. 900-914.
9. J. K. CULLUM AND R. A. WILLOUOHBY, Computing eigenvalues of very large symmetric matrices-an implementation of a Lanczos algorithm with no reorthogonalization, J. Comput. Phys., 44 (1981), pp. 329-358.
10. _, Lanczos Algorithms for Large Symmetric Eigenvalue Computations. Volume 1, Theory, Birkhäuser, Boston, 1985.
11. _, A practical procedure for computing eigenvalues of large sparse nonsymmetric matrices, in Large Scale Eigenvalue Problems, J. K. Cullum and R. A. Willoughby, eds., North-Holland, Amsterdam, 1986.
12. E. R. DAVIDSON, The iterative calculation of a few of the lowest eigenvalues and corresponding eigenvectors of large real symmetric matrices, J. Comput. Phys., 17 (1975), pp. 87-94.
13. D. DAY, An efficient implementation of the nonsymmetric Lanczos algorithm, SIAM J. Matrix Anal. Appl., 18 (1997), pp. 566-589.
14. U. ELSNER, V. MEHRMANN, F. MILDE, R. A. RÖMER, AND M. SCHREIBER, The Anderson model of localization: a challenge for modern eigenvalue methods, SIAM J. Sci. Comput., 20 (1999), pp. 2089-2102.
15. D. R. FOKKEMA, G. L .G. SLEIJPEN, AND H. A. VAN DER VORST, Jacobi-Davidson style QR and QZ algorithms for the partial reduction of matrix pencils, SIAM J. Sci. Comput., 20 (1998), pp. 94-125.
16. R. W. FREUND, M. GUTKNECHT, AND N. M. NACHTIGAL, An implementation of the look-ahead Lanczos algorithm for non-Hermitian matrices, SIAM J. Sci. Comput., 14 (1993), pp. 137-158.
17. G. H. GOLUB AND C. F. VAN LOAN, Matrix Computations, 2nd ed., Johns Hopkins University Press, Baltimore, 1989.
18. M. E. HOCHSTENBACH AND G. L. G. SLEIJPEN, Two-sided and alternating Jacobi-Davidson, Linear Algebra Appl., 358 (2003), pp. 145-172.
19. S. HUANG AND T. CARRINGTON JR., Calculating interior eigenvalues and eigenvectors with an implicitly restarted and a filter diagonalization method, Appl. Numer. Math., 37 (2001), pp. 307-317.
20. Z. JIA, Refined iterative algorithms based on Arnoldi's process for large unsymmetric eigenproblems, Linear Algebra Appl., 259 (1997), pp. 1-23.
21. R. B. LEHOUCQ, S. K. GRAY, D. H. ZHANG, AND J. C. LIGHT, Vibrational eigenstates of four-atom molecules: a parallel strategy employing the implicitly restarted Lanczos method, Comput. Physics Comm., 109 (1998), pp. 15-26.
22. R.B. LEHOUCQ AND J. A. SCOTT, An evaluation of software for computing eigenvalues of sparse nonsymmetric matrices, Preprint MCS-P547-1195, Argonne National Laboratory.
23. R.B. LEHOUCQ, D. C. SORENSEN, AND C. YANG, AR/MOT Users' Guide: Solution of Large-Scale Eigenvalue Problems with Implicitly Restarted Arnoldi Methods, SIAM, Philadelphia, 1998.
24. J. C. LIGHT AND T. CARRINGTON JR., Discrete variable representations and their utilization Adv. Chem. Phys., 114 (2000), pp. 263-310.
25. V. A. MANDELSHTAM AND A. NEUMAIER, Further generalization and numerical implementation of pseudotime Schrödinger equations for quantum scattering calculations, J. Theor. Comput. Chem., 1 (2002), pp. 1-12.
26. A. NEUMAIER AND V. A. MANDELSHTAM, Pseudotime Schrödinger equation with absorbing potential for quantum scattering calculations, Phys. Rev. Lett., 86, (2001), pp. 5031-5034.
27. C. C. PAIGE, The Computation of Eigenvalues and Eigenvectors of Very Large Sparse Matrices, PhD thesis, University of London, 1971.
28. _, Computational variants of the Lanczos method for the eigenproblem, J. Inst. Math. Appl., 10 (1972), pp. 373-381.
29. _, Error analysis of the Lanczos algorithm for tridiagonalizing a symmetric matrix, J. Inst. Math. Appl., 18 (1996), pp. 341-349.
30. B. N. PARLETT, D. R. TAYLOR AND Z. A. LUI, A look-ahead Lanczos algorithm for unsymmetric matrices, Math. Comp., 44 (1985), pp. 105-124
31. P.-N. ROY AND T. CARRINGTON JR., An evaluation of methods designed to calculate energy levels in a selected range and application to a (one-dimensional) Morse oscillator and (three-dimensional) HCN/HNC, J. Chem. Phys., 103 (1995), pp. 5600-5612.
32. F. SARTORETTO, G. GAMBPMATO, AND G. FINI, Accelerated simultaneous iterations for large finite element eigenvalues, J. Comput. Phys., 81 (1989), pp. 53-69.
33. D. C. SORENSEN, Implicit application of polynomial filters in a k-step Arnoldi method, SIAM J. Matrix Anal. Appl., 13 (1992), pp. 357-385.
34. G. W. STEWART, Matrix Algorithms, Volume II: Eigensystems, SIAM, Philadelphia, 2001.
35. J. R. TAYLOR, Scattering Theory, Wiley, New York, 1972
36. L. N. TREFETHEN AND D. BAU, III, Numerical Linear Algebra, SIAM, Philadelphia, 1997.
37. J. C. TREMBLAY AND T. CARRINGTON JR., Computing resonance energies, widths, and wave functions using a Lanczos method in real arithmetic, J. Chem. Phys., 122 (2005), pp. 244107:1-11.
38. D. G. TRUHLAR ed., Resonances in Electron-Molecule Scattering, Van der Waals Complexes, and Reactive Chemical Dynamics, American Chemical Society, Symposium Series No. 263, Washington, 1984.
39. H. I. VAN DER VEEN AND K. VUIK, Bi-Lanczos with partial orthogonalization, Comput. & Structures, 56 (1995), pp.605-613.
40. J. S. WARSA, T. A. WAREING, J. E. MOREL, J. M. MCGHEE, AND R. B. LEHOUCQ, Krylov subspace iterations for deterministic k-eigenvalue calculations, Nucl. Sci. Eng., 147 (2004), pp. 26-42.
41. J. H. WILKINSON, The Algebraic Eigenvalue Problem, Oxford University Press, New York, 1988.
42. http://www.caam.rice.edu/software/ARPACK/
43. http://math.nist.gov/MatrixMarket/
44. http://www.ma.man.ac.uk/~higham/mctoolbox/