Matrix transformations for computing rightmost eigenvalues of large sparse non-symmetric eigenvalue problems

IMA Journal of Numerical Analysis

Volumn 16, Issue 3, 1996, Pages 297-346

  Meerbergen, Karl ^a   Roose, Dirk ^a  

^a UNIVERSITY OF LEUVEN   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

ITERATIVE METHODS; LINEAR TRANSFORMATIONS; MATHEMATICAL TRANSFORMATIONS; POLYNOMIALS;

CAYLEY TRANSFORMS; CHEBYSHEV POLYNOMIALS; DISCRETIZATIONS; LARGE-SCALE EIGENVALUE PROBLEMS; MATRIX TRANSFORMATION; SYMMETRIC EIGENVALUE PROBLEMS; TRANSFORMATION TECHNIQUES; TRUST REGION;

EIGENVALUES AND EIGENFUNCTIONS;

EID: 0030500518     PISSN: 02724979     EISSN: None     Source Type: Journal    
DOI: 10.1093/imanum/16.3.297     Document Type: Article

References (111)

1. ABDEL-AZIZ, M. R. 1994 Safeguarded use of the implicit restarted Lanczos technique for solving non-linear structural eigensystems. Int. J. Numer. Methods Eng. 37, 3117-3133.
2. ANDERSON, E., BAI, Z., BISCHOF, C., DEMMEL, J., DONGARRA, J., Du Croz, J., GREENBAUM, A., HAMMARLING, S., MCKENNEY, A., OSTROUCHOV, S., & SORENSEN, D. 1995 LAPACK Users' Guide. Philadelphia, PA: SIAM.
3. ANGELIDIS, G., & SEMLYEN, A. 1994 Efficient calculation of critical clusters in the small signal stability analysis of large power systems. IEEE/PES 1994 Summer Meeting (San Francisco, July 1994). IEEE Power Engineering Society.
4. ANGELIDIS, G., & SEMLYEN, A. 1995 Improved methodologies for the calculation of critical eigenvalues in small signal stability analysis. IEEE Trans. Power Systems 10, 427-132.
5. ARNOLDI, W. E. 1951 The principle of minimized iterations in the solution of the matrix eigenvalue problem. Quart. Appl. Math. 9, 17-29.
6. BAI, Z. 1994 A spectral transformation block Lanczos algorithm for solving sparse non-Hermitian eigenproblems. Proc. Fifth SIAM Conf. on Applied Linear Algebra (J. G. Lewis, ed). Philadelphia, PA: SIAM, pp 307-311.
7. BAI, Z., DAY, D., & YE, Q. 1995 ABLE: an adaptive block Lanczos method for non-Hermitian eigenvalue problems. Research Report 95-04, University of Kentucky, Department of Mathematics, Lexington, KY, USA.
8. BAI, Z., & STEWART, G. W. 1992 SRRIT - A FORTRAN subroutine to calculate the dominant invariant subspaces of a nonsymmetric matrix. Technical Report 2908, University of Maryland, College Park, MD, USA. Submitted to ACM Trans. Math. Softw.
9. BARRETT, R., BERRY, M., CHAN, T., DEMMEL, J., DONATO, J., DONGARRA, J., EIJKHOUT, V., POZO, R., ROMINE, C., & VAN DER VORST, H. 1994 Templates for the Solution of Linear Systems: Building Blocks for Iterative Methods. Philadelphia, PA: SIAM.
10. BENNANI, M., & BRACONNIER, T. 1994 Stopping criteria for eigensolvers. Technical Report TR/PA/94/22, CERFACS, Toulouse, France.
11. BRACONNIER, T. 1993 The Arnoldi Tchebycheff algorithm for solving large nonsymmetric eigenproblems. Technical Report TR/PA/93/25, CERFACS, Toulouse, France.
12. CALVETTI, D., REICHEL, L., & SORENSEN, D. C. 1994 An implicitly restarted Lanczos method for large symmetric eigenvalue problems. ETNA 2, 1-21.
13. CHATELIN, F. 1983 Spectral Approximation of Linear Operators. New York: Academic.
14. CHATELIN, F. 1993 Eigenvalues of Matrices. New York: Wiley.
15. CHRISTODOULOU, K. N., & SCRIVEN, L. E. 1988 Finding leading modes of a viscous free surface flow: an asymmetric generalized eigenproblem. J. Sci. Comput. 3, 355-406.
16. CHRONOPOULOS, A. T. 1991 S-step iterative methods for (non)symmetric (in)definite linear systems. SIAM J. Numer. Anal. 28, 1776-1789.
17. CLIFFE, K. A., GARRATT, T. J., GOLDING, J. F., & SPENCE, A. 1994a On the equivalence of block matrices under Arnoldi's method. Technical Report Preprint 94/08, School of Mathematical Sciences, University of Bath, Bath, UK.
18. CLIFFE, K. A., GARRATT, T. J., & SPENCE, A. 1990 Calculation of eigenvalues of the discretized Navier-Stokes and related equations. The Mathematics of Finite Elements and Applications VII MAFELAP (J. R. Whiteman, ed). New York: Academic, pp 479-486.
19. CLIFFE, K. A., GARRATT, T. J., & SPENCE, A. 1993 Eigenvalues of the discretized Navier-Stokes equation with application to the detection of Hopf bifurcations. Adv. Comput. Math. 1, 337-356.
20. CLIFFE, K. A., GARRATT, T. J., & SPENCE, A. 1994b Eigenvalues of block matrices arising from problems in fluid mechanics. SIAM J. Matrix Anal. Applic. 15, 1310-1318.
21. CLIFFE, K. A., & WINTERS, K. H. 1985 Convergence properties of the finite-element method for Bénard convection in an infinite layer. J. Comput. Phys. 60, 346-351.
22. CROUZEIX, M., PHILIPPE, B., & SADKANE, M. 1994 The Davidson method. SIAM J. Sci. Comput. 15, 62-76.
23. CULLUM, J. 1994 Block Lanczos algorithms for large matrix eigenvalue problems: part II. Nonsymmetric case. Proc. of the Cornelius Lanczos Int. Centenary Conf. (J. D. Brown, M. T. Chu, D. C. Ellison and R. J. Plemmons, eds). Philadelphia, PA: SIAM, pp 316-318.
24. CULLUM, J., KERNER, W., & WILLOUGHBY, R. 1989 A generalized nonsymmetric Lanczos procedure. Comput. Phys. Commun. 53, 19-48.
25. CULLUM, J., & WILLOUGHBY, R. 1991 Computing eigenvalues of large matrices, some Lanczos algorithms and a shift and invert strategy. Advances in Numerical Partial Differential Equations and Optimization, vol. 47 of Proc. Applied Mathematics (S. Gomes, J. P. Hennart and R. A. Tapia, eds). Philadelphia, PA: SIAM.
26. DANIEL, J. W., GRAGG, W. B., KAUFMAN, L., & STEWART, G. W. 1976 Reorthogonalization and stable algorithms for updating the Gram-Schmidt QR factorization. Math. Comput. 30, 772-795.
27. DAVIDSON, E. R. 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.
28. DAVIS, T. A. 1995 Users' guide for the unsymmetric-pattern multifrontal package (UMFPACK). Technical Report TR-95-004, Computer and Information Sciences Department, University of Florida, Gainesville, FL, USA.
29. DONG, H., CHRONOPOULOS, A., ZOU, J., & GOPINATH, A. 1993 Vectorial integrated finite-difference analysis of dielectric waveguides. J. Lightwave Technol. 11, 1559-1564.
30. DUFF, I. S., & REID, J. K. 1993 MA48, a Fortran code for direct solution of sparse unsymmetric linear systems of equations. Technical Report RAL-93-072, Rutherford Appleton Laboratory, Rutherford, UK.
31. DUFF, I. S., & SCOTT, J. A. 1993 Computing selected eigenvalues of large sparse unsymmetric matrices using subspace iteration. ACM Trans. Math. Softw. 19, 137-159.
32. DUPRET, F., & LEVIEUX, F. 1994 Private communication.
33. ERICSSON, T. 1986 A generalized eigenvalue problem and the Lanczos algorithm. Large Scale Eigenvalue Problems (J. Cullum and R. A. Willoughby, eds). Amsterdam: Elsevier, pp 95-119.
34. ERICSSON, T., & RUHE, A. 1980 The spectral transformation Lanczos method for the numerical solution of large sparse generalized symmetric eigenvalue problems. Math. Comput. 35, 1251-1268.
35. ERIKSSON, L. E., & RIZZI, A. 1985 Computer-aided analysis of the convergence to steady state of discrete approximations to the Euler equations. J. Comput. Phys. 57, 90-128.
36. FRANKLIN, J. N. 1968 Matrix Theory. Englewood Cliffs, NJ: Prentice Hall.
37. FREUND, R. W., GUTKNECHT, M. H., & NACHTIGAL, N. M. 1990 An implementation of the look-ahead Lanczos algorithm for non-Hermitian matrices, part I. Technical Report RIACS 90.45. NASA Ames Research Center, Moffett Field, CA, USA.
38. GALICK, A. T. 1994 Efficient solution of large sparse eigenvalue problems in microelectronic simulation. Proc. of the Cornelius Lanczos Int. Centenary Conf. (J. D. Brown, M. T. Chu, D. C. Ellison and R. J. Plemmons, eds). Philadelphia, PA: SIAM, pp 258-260.
39. GALICK, A. T., KERKHOVEN, T., & RAVAIOLI, U. 1992 Iterative solution of the eigenvalue problem for a dielectric waveguide. IEEE Trans. MTT 40, 699-705.
40. GALLOPOULOS, E., & SAAD, Y. 1992 Efficient solution of parabolic equations by Krylov approximation methods. SIAM J. Sci. Statist. Comput. 13, 1236-1264.
41. GARRATT, T. J. 1991a The numerical detection of Hopf bifurcations in large systems arising in fluid mechanics. PhD Thesis, University of Bath, UK.
42. GARRATT, T. J. 1991b Using approximations to the matrix exponential to solve nonsymmetric eigenvalue problems. Unpublished manuscript.
43. GARRATT, T. J., MOORE, G., & SPENCE, A. 1991 Two methods for the numerical detection of Hopf bifurcations. Bifurcation and Chaos: Analysis, Algorithms, Applications (R. Seydel, F. W. Schneider and H. Troger, eds). Basel: Birkhäuser, pp 119-123.
44. GARRATT, T. J., MOORE, G., & SPENCE, A. 1993 A generalized Cayley transform for the numerical detection of Hopf bifurcations in large systems. Contributions in Numerical Mathematics (R. P. Agarwal, ed). Singapore: World Scientific, pp 177-185.
45. GARY, J. 1964 On certain finite difference schemes for hyperbolic systems. Math. Comput. 18, 1-18.
46. GOLDHIRSCH, I., ORSZAG, S. A., & MAULIK, B. K. 1987 An efficient method for computing leading eigenvalues and eigenvectors of large asymmetric matrices. J. Sci. Comput. 2, 33-58.
47. GOLUB, G., & VAN LOAN, C. 1989 Matrix Computations, 2nd edn. Baltimore, MD: The Johns Hopkins University Press.
48. GRIMES, R. G., LEWIS, J. G., & SIMON, H. D. 1986 Eigenvalue problems and algorithms in structural engineering. Large Scale Eigenvalue Problems (J. Cullum and R. A. Willoughby, eds). Amsterdam: Elsevier.
49. GRIMES, R. G., LEWIS, J. G., & SIMON, H. D. 1994 A shifted block Lanczos algorithm for solving sparse symmetric generalized eigenproblems. SIAM J. Matrix Anal. Applic. 15, 228-272.
50. GRINDROD, P. 1991 Patterns and Waves: The Theory and Applications of Reaction-Diffusion Equations (Oxford Applied Mathematics and Computing Science Series). Oxford: Clarendon.
51. GRINFELD, M. 1993 Dynamics of a model equation in viscoelasticity. Proc. Equadiff 91. Singapore: World Scientific.
52. GUTKNECHT, M. H. 1992 A completed theory of the unsymmetric Lanczos process and related algorithms, part I. SIAM J. Matrix Anal. Applic. 13, 594-639.
53. HEINEMANN, R. F., & POORE, A. B. 1981 Multiplicity, stability, and oscillatory dynamics of a tubular reactor. Chem. Eng. Sci. 36, 1411-1419.
54. HO, D. 1990 Tchebyshev acceleration technique for large scale nonsymmetric matrices. Numer. Math. 56, 721-734.
55. HO, D., CHATELIN, F., & BENNANI, M. 1990 Arnoldi-Tchebychev procedure for large scale nonsymmetric matrices. Math. Modelling Numer. Anal. 24, 53-65.
56. JACOBI, C. G. J. 1846 Ueber ein leichtes Verfahren, die in der Theorie der Säcularstörungen vorkommenden Gleichungen numerisch aufzulösen. Journal für die Reine und Angewandte Mathematik, pp 51-94.
57. KOOPER, M. N., VAN DER VORST, H. A., POEDTS, S., & GOEDBLOED, J. 1995 Application of the implicitly updated Arnoldi method with a complex shift and invert strategy in MHD. J. Comput. Phys. 118, 320-328.
58. LANCZOS, C. 1950 An iteration method for the solution of the eigenvalue problem of linear differential and integral operators. J. Res. Natl. Bur. Stand. 45, 255-282.
59. LEHOUCQ, R. B. 1995 Analysis and implementation of an implicitly restarted Arnoldi iteration. PhD Thesis, Rice University. Houston, TX, USA.
60. LEHOUCQ, R. B., & SCOTT, J. A. 1995 An evaluation of software for computing eigenvalues of sparse nonsymmetric matrices. Technical Report MCS-P547-1195, Argonne National Laboratory, Argonne, IL, USA.
61. LEHOUCQ, R. B., & SORENSEN, D. C. 1996 Deflation techniques within an implicitly restarted Arnoldi iteration. SIAM J. Matrix Anal. Applic. To appear.
62. LEHOUCQ, R. B., SORENSEN, D. C., VU, P., & YANG, C. 1995 ARPACK: an implementation of the implicitly re-started Arnoldi iteration that computes some of the eigenvalues and eigenvectors of a large sparse matrix. Available from netlib@ornl.gov under the directory scalapack.
63. MALKUS, D. S. 1981 Eigenproblems associated with the discrete LBB condition for incompressible finite elements. Int. J. Eng. Sci. 19, 1299-1310.
64. MANTEUFFEL, T. 1977 The Tchebyshev iteration for nonsymmetric linear systems. Numer. Math. 28, 307-327.
65. MEERBERGEN, K., & ROOSE, D. 1994 The restarted Arnoldi method applied to iterative linear system solvers for computation of rightmost eigenvalues. Report TW214, Department of Computer Science, K. U. Leuven. Accepted by SIAM J. Matrix Anal. Appl.
66. MEERBERGEN, K., & ROOSE, D. 1996 Finding eigenvalues to the right of a given line. AMS Contemporary Mathematics Series. (IMACS Symp. on Iterative Methods in Linear Algebra) (P. S. Vassilevski and S. D. Margenov, eds). To appear.
67. MEERBERGEN, K., & SPENCE, A. 1995 Implicitly restarted Arnoldi and purification for the shift-invert transformation. Technical Report TW225, K. U. Leuven, Department of Computer Science, Heverlee, Belgium.
68. MEERBERGEN, K., SPENCE, A., & ROOSE, D. 1994 Shift-invert and Cayley transforms for detection of rightmost eigenvalues of nonsymmetric matrices. BIT 34, 409-423.
69. MITTELMANN, H. D., CHANG, K.-T., JANKOWSKI, D. F., & NEITZEL, G. P. 1992a Linear stability of axisymmetric thermocapillary convection in crystal growth. Bifurcation with Symmetries (International Series of Numerical Mathematics, vol. 104). Basel: Birkhauser, pp 275-283.
70. MITTELMANN, H. D., CHANG, K.-T., JANKOWSKI, D. F., & NEITZEL, G. P. 1994 Iterative solution of the eigenvalue problem in Hopf bifurcation for the Boussinesq equations. SIAM J. Sci. Comput. 15, 704-712.
71. MITTELMANN, H., LAW, C., JANKOWSKI, D., & NEITZEL, P. 1992b A large, sparse, and indefinite generalized eigenvalue problem from fluid mechanics. SIAM J. Sci. Statist. Comput. 13, 411-424.
72. MOLER, C., & VAN LOAN, C. 1978 Nineteen dubious ways to compute the exponential of a matrix. SIAM Rev. 20, 801-836.
73. MORGAN, R. B. 1992 Generalizations of Davidson's method for computing eigenvalues of large nonsymmetric matrices. J. Comput. Phys. 101, 287-291.
74. MORGAN, R. B. 1996 On restarting the Arnoldi method for large nonsymmetric eigenvalue problems. Math. Comput. To appear.
75. MORGAN, R. B., & SCOTT, D. S. 1986 Generalizations of Davidson's method for computing eigenvalues of sparse symmetric matrices. SIAM J. Sci. Statist. Comput. 7, 817-825.
76. MORGAN, R. B., & SCOTT, D. S. 1993 Preconditioning the Lanczos algorithm for sparse symmetric eigenvalue problems. SIAM J. Sci. Comput. 14, 585-593.
77. NATARAJAN, R. 1992 An Arnoldi-based iterative scheme for nonsymmetric matrix pencils arising in finite element stability problems. J. Comput. Phys. 100, 128-142.
78. NEUBERT, R. 1993 Predictor-corrector techniques for detecting Hopf bifurcation points. Int. J. Bifurcation Chaos 3, 1311-1318.
79. NOUR-OMID, B., PARLETT, B. N., ERICSSON, T., & JENSEN, P. S. 1987 How to implement the spectral transformation. Math. Comput. 48, 663-673.
80. OLMSTEAD, W. E., DAVIS, W. E., ROSENBLAT, S. H., & KATH, W. L. 1986 Bifurcation with memory. SIAM J. Appl. Math. 40, 171-188.
81. PARLETT, B. N. 1980 The Symmetric Eigenvalue Problem (Prentice Hall Series in Computational Mathematics). Englewood Cliffs, NJ: Prentice-Hall.
82. PARLETT, B. N., & SAAD, Y. 1987 Complex shift and invert strategies for real matrices. Linear Alg. Appl. 88/89, 575-595.
83. PARLETT, B. N., TAYLOR, D. R., & LIU, Z. S. 1985 A look-ahead Lanczos algorithm for nonsymmetric matrices. Math. Comput. 44, 105-124.
84. PHILIPPE, B., & SADKANE, M. 1996 Improving the spectral transformation block Arnoldi method. AMS Contemporary Mathematics Series (IMACS Symp. on Iterative Methods in Linear Algebra) (P. S. Vassilevski and S. D. Margenov, eds). To appear.
85. RUHE, A. 1984 Rational Krylov sequence methods for eigenvalue computation. Linear Alg. Appl. 58, 391-405.
86. RUHE, A. 1993 Rational Krylov algorithms for nonsymmetric eigenvalue problems. Recent Advances in Iterative Methods (IMA Volumes in Mathematics and its Applications, vol. 60) (G. Golub, A. Greenbaum and M. Luskin, eds). Berlin: Springer, pp 149-164.
87. RUHE, A. 1994a Rational Krylov algorithms for nonsymmetric eigenvalue problems. II: matrix pairs. Linear Alg. Appl. 197/198, 283-296.
88. RUHE, A. 1994b The Rational Krylov algorithm for nonsymmetric eigenvalue problems, III: complex shifts for real matrices. BIT 34, 165-176.
89. RUHE, A. 1995 Rational Krylov, a practical algorithm for large sparse nonsymmetric matrix pencils. Technical Report UCB/CSD-95-87], Computer Science Division, University of California, Berkeley, CA, USA.
90. SAAD, Y. 1980 Variations on Arnoldi's method for computing eigenelements of large unsymmetric matrices. Linear Alg. Appl. 34, 269-295.
91. SAAD, Y. 1983 Least squares polynomials in the complex plane with applications to solving sparse nonsymmetric matrix problems. Research Report YALEU/DCS/RR-276, Yale University, New Haven, CT, USA.
92. SAAD, Y. 1984 Chebyshev acceleration techniques for solving nonsymmetric eigenvalue problems. Math. Comput. 42,(166) 567-588.
93. SAAD, Y. 1987 Least squares polynomials in the complex plane and their use for solving nonsymmetric linear systems. SIAM J. Numer. Anal. 24, 155-169.
94. SAAD, Y. 1989 Numerical solution of large nonsymmetric eigenvalue problems. Comput. Phys. Commun. 53, 71-90.
95. SAAD, Y. 1992 Numerical Methods for Large Eigenvalue Problems. Algorithms and Architectures for Advanced Scientific Computing. Manchester: Manchester University Press.
96. SAAD, Y. 1994 SPARSKIT: A Basic Tool Kit for Sparse Matrix Computations. Version 2. Computer Science Department, University of Minnesota, Minneapolis, MN, USA.
97. SADKANE, M. 1993a A block Amoldi-Chebyshev method for computing the leading eigenpairs of large sparse unsymmetric matrices. Numer. Math. 64, 181-193.
98. SADKANE, M. 1993b Block-Arnoldi and Davidson methods for unsymmetric large eigenvalue problems. Numer. Math. 64, 195-211.
99. SCOTT, D. S. 1981 Solving sparse symmetric generalized eigenvalue problems without factorization. SIAM J. Numer. Anal. 18, 102-110.
100. SCOTT, D. S. 1982 The advantages of inverted operators in Rayleigh-Ritz approximations. SIAM J. Sci. Statist. Comput. 3, 68-75.
101. SCOTT, J. A. 1995 An Arnoldi code for computing selected eigenvalues of sparse unsymmetric matrices. ACM Trans. Math. Softw. 21, 432-475.
102. SILVERMAN, R. A. 1967 Introductory Complex Analysis. Englewood Cliffs, NJ: Prentice Hall.
103. SLEIJPEN, G. L. G., & VAN DER VORST, H. A. 1994 A Jacobi-Davidson iteration method for linear eigenvalue problems. Preprint 856, Department of Mathematics, Universiteit Utrecht, Utrecht, The Netherlands. To appear in SIAM J. Matrix Anal. Appl.
104. SLEIJPEN, L. G., BOOTEN, G. L., FOKKEMA, D. R., & VAN DER VORST, H. A. 1995 Jacobi Davidson type methods for generalized eigenproblems and polynomial eigenproblems: part I. Preprint nr 923. Department of Mathematics, Universiteit Utrecht, Utrecht, The Netherlands.
105. SMITH, H. A., SORENSEN, D. C., & SINGH, R. K. 1993 A Lanczos based technique for exact vibration analysis of skeletal structures. Int. J. Numer. Methods Eng. 36, 1987-2000.
106. SORENSEN, D. C. 1992 Implicit application of polynomial filters in a k-step Arnoldi method. SIAM J. Matrix Anal. Applic. 13, 357-385.
107. STEWART, G. W. 1976 Simultaneous iteration for computing invariant subspaces of non-Hermitian matrices. Numer. Math. 25, 123-136.
108. STEWART, W. J., & JENNINGS, A. 1981a A simultaneous iteration algorithm for real matrices. ACM Trans. Math. Softw. 7, 184-198.
109. STEWART, W. J., & JENNINGS, A. 1981b Algorithm 570: LOPSI a simultaneous iteration method for real matrices. ACM Trans. Math. Softw. 7, 230-232.
110. WATKINS, D. 1993 Some perspectives on the eigenvalue problem. SIAM Rev. 35, 430-471.
111. WILKINSON, J. H. 1965 The Algebraic Eigenvalue Problem. Oxford: Clarendon.