Numerical methods for large eigenvalue problems

Acta Numerica

Volumn 11, Issue , 2002, Pages 519-584

  Sorensen, Danny C ^a  

^a The NanoCarbon Center and Welch Institute for Advanced Materials   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 2442500838     PISSN: 09624929     EISSN: 14740508     Source Type: Journal    
DOI: 10.1017/S0962492902000089     Document Type: Article

References (74)

1. E. Anderson, Z. Bai, C. Bischof, J. Demmel, J. Dongarra, J. DuCroz, A. Green-baum, S. Hammarling, A. McKenney, S. Ostrouchov and D. Sorensen (1992), LAPACK User's Guide, SIAM, Philadelphia, PA.
2. J. Baglama, D. Calvetti and L. Reichel (1996), 'Iterative methods for the computation of a few eigenvalues of a large symmetric matrix', BIT 36, 400-440.
3. J. Baglama, D. Calvetti and L. Reichel (1998), 'Fast Leja points', ETNA 7, 124-140.
4. Z. Bai and G. W. Stewart (1997), 'SRRIT: A FORTRAN subroutine to calculate the dominant invariant subspace of a nonsymmetric matrix', ACM Trans. Math. Software 23, 494.
5. C. Beattie, M. Embree and J. Rossi (2001), Convergence of restarted Krylov subspaces to invariant subspaces, Numerical Analysis Technical Report 01/21, OUCL, Oxford, UK.
6. M. Berry (1992), 'Large scale singular value computations', Supercomput. Appl. 6, 13-49.
7. E. A. Burroughs, L. A. Romero, R. B. Lehoucq and A. J. Salinger (2001), Large scale eigenvalue calculations for computing the stability of buoyancy driven flows, Technical Report 2001-0113J, Sandia National Laboratories. Submitted to J. Comput. Phys.
8. D. Calvetti, L. Reichel and D. Sorensen (1994), 'An implicitly restarted Lanczos method for large symmetric eigenvalue problems', ETNA 2, 1-21.
9. M. Crouzeix, B. Philippe and M. Sadkane (1994), 'The Davidson method', SIAM J. Sci. Comput. 15, 62-76.
10. J. Cullum and W. E. Donath (1974), 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, pp. 505-509.
11. J. Cullum and R. A. Willoughby (1981), 'Computing eigenvalues of very large symmetric matrices: An implementation of a Lanczos algorithm with no reorthogonalization', J. Comput. Phys. 434, 329-358.
12. J. Cullum and R. A. Willoughby (1985), Lanczos Algorithms for Large Symmetric Eigenvalue Computations, Vol. 1: Theory, Birkhäuser, Boston, MA.
13. J. Cullum and R. A. Willoughby (1986), A practical procedure for computing eigenvalues of large sparse nonsymmetric matrices, in Large Scale Eigenvalue Problems (J. Cullum and R. A. Willoughby, eds), North-Holland, Amsterdam, pp. 193-240.
14. J. Daniel, W. B. Gragg, L. Kaufman and G. W. Stewart (1976), 'Reorthogonaliza-tion and stable algorithms for updating the Gram-Schmidt QR factorization', Math. Comput. 30, 772-795.
15. E. R. Davidson (1975), 'The iterative calculation of a few of the lowest eigenvalues and corresponding eigenvectors of large real symmetric matrices', J. Comput. Phys. 17, 87-94.
16. E. R. Davidson (1993), 'Monster matrices: Their eigenvalues and eigenvectors', Comput. Phys. 7, 519-522.
17. M. P. Debicki, P. Jedrzejewski, J. Mielewski, P. Przybyszewski and M. Mrozowski (1995), Application of the Arnoldi method to the solution of electromagnetic eigenproblems on the multiprocessor power challenge architecture, Preprint 19/95, Department of Electronics, Technical University of Gdansk, Gdansk, Poland.
18. J. Dongarra and R. C. Whaley (1995), A User's Guide to the BLACS v1.0, Technical Report UT CS-95-281, LAPACK Working Note #94, University of Tennessee.
19. J. J. Dongarra, J. DuCroz, I. Duff and S. Hammarling (1990), 'A set of Level 3 Basic Linear Algebra Subprograms: Model implementation and test programs', ACM Trans. Math. Software 16, 18-28.
20. J. J. Dongarra, J. DuCroz, S. Hammarling and R. Hanson (1988), 'An extended set of Fortran Basic Linear Algebra Subprograms', ACM Trans. Math. Software 14, 1-17.
21. T. Ericsson and A. Ruhe (1980), 'The spectral transformation Lanczos method for the numerical solution of large sparse generalized symmetric eigenvalue problems', Math. Comput. 35, 1251-1268.
22. B. Fischer and L. Reichel (1989), 'Newton interpolation in Chebyshev and Fejér points', Math. Comput. 53, 265-278.
23. D. R. Fokkema, G. L. G. Sleijpen and H. A. van der Vorst (1996), Jacobi-Davidson style QR and QZ algorithms for the partial reduction of matrix pencils, Technical Report 941, Mathematical Institute, Utrecht University.
24. R. W. Freund (1992), 'Conjugate gradient-type methods for a linear systems with complex symmetric coefficient matrices', SIAM J. Sci. Comput. 13, 425-448.
25. R. W. Freund and N. M. Nachtigal (1991), 'QMR: A quasi-minimal residual method for non-Hermitian linear systems', Numer. Math. 60, 315-339.
26. D. Gaier (1987), Lectures on Complex Approximation, Birkhäuser.
27. T. J. Garratt (1991), The numerical detection of Hopf bifurcations in large systems arising in fluid mechanics, PhD thesis, University of Bath, School of Mathematical Sciences, Bath, UK.
28. G. H. Golub and R. Underwood (1977), The block Lanczos method for computing eigenvalues, in Mathematical Software III (J. Rice, ed.), Academic Press, New York, pp. 361-377.
29. G. H. Golub and C. F. Van Loan (1996), Matrix Computations, The Johns Hopkins University Press, Baltimore.
30. R. G. Grimes, J. G. Lewis and H. D. Simon (1994), 'A shifted block Lanczos algorithm for solving sparse symmetric generalized eigenproblems', SIAM J. Matrix Anal. Appl. 15, 228-272.
31. Z. Jia (1995), 'The convergence of generalized Lanczos methods for large unsym-metric eigenproblems', SIAM J. Matrix Anal. Appl. 16, 843-862.
32. W. Karush (1951), 'An iterative method for finding characteristics vectors of a symmetric matrix', Pacific J. Math. 1, 233-248.
33. A. Knyazev (2001), 'Toward the optimal preconditioned eigensolver: Locally optimal block preconditioned conjugate gradient method', SIAM J. Sci. Comput. 23, 517-541.
34. C. Lanczos (1950), 'An iteration method for the solution of the eigenvalue problem of linear differential and integral operators', J. Res. Nat. Bur. Standards 45, 255-282. Research Paper 2133.
35. C. Lawson, R. Hanson, D. Kincaid and F. Krogh (1979), 'Basic Linear Algebra Subprograms for Fortran usage.', ACM Trans. Math. Software 5, 308-329.
36. R. B. Lehoucq (1995), Analysis and Implementation of an Implicitly Restarted Iteration, PhD thesis, Rice University, Houston, TX. Also available as Technical report TR95-13, Department of Computational and Applied Mathematics.
37. R. B. Lehoucq (2001), 'Implicitly restarted Arnoldi methods and subspace iteration', SIAM J. Matrix Anal. Appl. 23, 551-562.
38. R. B. Lehoucq and A. G. Salinger (2001), 'Large-scale eigenvalue calculations for stability analysis of steady flows on massively parallel computers', Internat. J. Numer. Methods Fluids 36, 309-327.
39. R. B. Lehoucq and J. A. Scott (1996), An evaluation of software for computing eigenvalues of sparse nonsymmetric matrices, Preprint MCS-P547-1195, Ar-gonne National Laboratory, Argonne, IL.
40. R. B. Lehoucq and D. C. Sorensen (1996), 'Deflation techniques for an implicitly restarted Arnoldi iteration', SIAM J. Matrix Anal. Appl. 17, 789-821.
41. R. B. Lehoucq, D. C. Sorensen and C. Yang (1998), ARPACK Users Guide: Solution of Large Scale Eigenvalue Problems with Implicitly Restarted Arnoldi methods, SIAM Publications, Philadelphia, PA.
42. T. A. Manteuffel (1978), 'Adaptive procedure for estimating parameters for the nonsymmetric Tchebychev iteration', Numer. Math. 31, 183-208.
43. K. J. Maschhoff and D. C. Sorensen (1996), P ARPACK: An efficient portable large scale eigenvalue package for distributed memory parallel architectures, in Applied Parallel Computing in Industrial Problems and Optimization, Springer, Berlin, pp. 478-486.
44. K. Meerbergen (1996), Robust methods for the calculation of rightmost eigenvalues of nonsymmetric eigenvalue problems, PhD thesis, Katholieke Universiteit Leuven, Belgium.
45. K. Meerbergen and A. Spence (1997), 'Implicitly restarted Arnoldi with purification for the shift-invert transformation', Math. Comput. 218, 667-689.
46. R. B. Morgan (1991), 'Computing interior eigenvalues of large matrices', Lin. Alg. Appl. 154-156, 289-309.
47. R. B. Morgan (1996), 'On restarting the Arnoldi method for large nonsymmetric eigenvalue problems', Math. Comput. 65, 1213-1230.
48. R. B. Morgan and D. S. Scott (1993), 'Preconditioning the Lanczos algorithm for sparse symmetric eigenvalue problems', SIAM J. Sci. Comput. 14, 585-593.
49. MPI Forum (1994), 'MPI: A Message-Passing Interface standard', Internat. J. Su-percomput. Appl. High Performance Comput. Special issue on MPI. Electronic form: ftp://www.netlib.org/mpi/mpi-report.ps.
50. J. Olsen, P. Jørgensen and J. Simons (1990), 'Passing the one-billion limit in full configuration-interaction (FCI) calculations', Chem. Phys. Lett. 169, 463-472.
51. C. C. Paige (1971), The computation of eigenvalues and eigenvectors of very large sparse matrices, PhD thesis, University of London.
52. C. C. Paige, B. N. Parlett and H. A. van der Vorst (1995), 'Approximate solutions and eigenvalue bounds from Krylov subspaces', Numer. Lin. Alg. Appl. 2, 115-134.
53. B. N. Parlett (1980), The Symmetric Eigenvalue Problem, Prentice-Hall, Englewood Cliffs, NJ.
54. B. N. Parlett and J. K. Reid (1981), 'Tracking the progress of the Lanczos algorithm for large symmetric eigenproblems', IMA J. Numer. Anal. 1, 135-155.
55. B. N. Parlett and D. Scott (1979), 'The Lanczos algorithm with selective orthogon-alization', Math. Comput. 33, 217-238.
56. L. Reichel (1990), 'Newton interpolation at Leja points', BIT 30, 332-346.
57. A. Ruhe (1994a), 'The rational Krylov algorithm for nonsymmetric eigenvalue problems, III: Complex shifts for real matrices', BIT 34, 165-176.
58. A. Ruhe (1994b), 'Rational Krylov algorithms for nonsymmetric eigenvalue problems, II: Matrix pairs', Lin. Alg. Appl. 197-198, 283-295.
59. Y. Saad (1980), 'Variations on Arnoldi's method for computing eigenelements of large unsymmetric matrices', Lin. Alg. Appl. 34, 269-295.
60. Y. Saad (1984), 'Chebyshev acceleration techniques for solving nonsymmetric eigenvalue problems', Math. Comput. 42, 567-588.
61. Y. Saad (1992), Numerical Methods for Large Eigenvalue Problems, Manchester University Press, Manchester, UK.
62. Y. Saad (1994), 'ILUT: A dual threshold incomplete LU factorization', Numer. Lin. Alg. Appl. 1, 387-402.
63. J. A. Scott (2000), 'An Arnoldi code for computing selected eigenvalues of sparse real unsymmetric matrices', ACM Trans. Math. Software.
64. H. Simon (1984), 'Analysis of the symmetric Lanczos algorithm with reorthogon-alization methods', Lin. Alg. Appl. 61, 101-131.
65. V. Simoncini (1996), 'Ritz and pseudo-Ritz values using matrix polynomials', Lin. Alg. Appl. 241-243, 787-801.
66. G. L. G. Sleijpen and H. A. van der Vorst (1995), 'An overview of approaches for the stable computation of hybrid BiCG methods', Appl. Numer. Math. 19, 235-254.
67. G. L. G. Sleijpen and H. A. van der Vorst (1996), 'A Jacobi-Davidson iteration method for linear eigenvalue problems', SIAM J. Matrix Anal. Appl. 17, 401-425.
68. D. C. Sorensen (1992), 'Implicit application of polynomial filters in a k-step Arnoldi method', SIAM J. Matrix Anal. Appl. 13, 357-385.
69. D. C. Sorensen and C. Yang (1998), 'A truncated RQ-iteration for large scale eigenvalue calculations', SIAM J. Matrix Anal. Appl. 19, 1045-1073.
70. A. Stathopoulos, Y. Saad and K. Wu (1998), 'Dynamic thick restarting of the Davidson, and the implicitly restarted Arnoldi methods', SIAM J. Sci. Comput. 19, 227-245.
71. G. W. Stewart (2001), 'A Krylov-Schur algorithm for large eigenproblems', SIAM J. Matrix Anal. Appl. 23, 601-614.
72. W. J. Stewart and A. Jennings (1981), 'Algorithm 570: LOPSI, A Fortran subroutine for approximations to right or left eigenvectors corresponding to the dominant set of eigenvalues of a real symmetric matrix', ACM Trans. Math. Software 7, 230-232.
73. L. N. Trefethen (1992), Pseudospectra of matrices, in Numerical Analysis 1991 (D. F. Griffiths and G. A. Watson, eds), Longman, pp. 234-266.
74. L. N. Trefethen (1999), Computation of pseudospectra, in Acta Numerica, Vol. 9, Cambridge University Press, pp. 247-296.