Skip to main content Accessibility help
×
×
Home

Variational and numerical methods for symmetric matrix pencils

  • Peter Lancaster (a1) and Qiang Ye (a1)
Abstract

A review is presented of some recent advances in variational and numerical methods for symmetric matrix pencils λAB in which A is nonsingular, A and B are hermitian, but neither is definite. The topics covered include minimax and maximin characterisations of eigenvalues, perturbation by semidefinite matrices and interlacing properties of real eigenvalues, Rayleigh quotient algorithms and their convergence properties, Rayleigh-Ritz methods employing Krylov subspaces, and a generalised Lanczos algorithm.

    • Send article to Kindle

      To send this article to your Kindle, first ensure no-reply@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about sending to your Kindle. Find out more about sending to your Kindle.

      Note you can select to send to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be sent to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

      Find out more about the Kindle Personal Document Service.

      Variational and numerical methods for symmetric matrix pencils
      Available formats
      ×
      Send article to Dropbox

      To send this article to your Dropbox account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Dropbox.

      Variational and numerical methods for symmetric matrix pencils
      Available formats
      ×
      Send article to Google Drive

      To send this article to your Google Drive account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Google Drive.

      Variational and numerical methods for symmetric matrix pencils
      Available formats
      ×
Copyright
References
Hide All
[1]Beattie, C. and Fox, D.W., ‘Localization criteria and containment for Rayleigh quotient iteration’, SIAM J. Matrix Anal. Appl. 10 (1989), 8093.
[2]Burgoyne, N. and Cushman, R., ‘Normal forms for real linear Hamiltonian systems with purely imaginary eigenvalues’, Celestial Mech. 8 (1974), 435443.
[3]Courant, R., ‘Uber die Eigenwerte bei den Differentialgleichungen der mathematischen Physik’, Math Z. 7 (1920), 157.
[4]Crandall, S.H., ‘Iterative procedures related to relaxation methods for eigenvalue problems’, Proc. Roy. Soc. London Ser. A 207 (1951), 416423.
[5]Crawford, C.R., ‘A stable generalized eigenvalue problem’, SIAM J. Numer. Anal. 6 (1976), 854860.
[6]Duffin, R.J., ‘A minimax theory for overdamped networks’, Arch. Rational Mech. Anal. 4 (1955), 221233.
[7]Ericsson, T. and Ruhe, A., ‘Lanczos algorithm and field of value rotations for symmetric matrix pencils’, Linear Algebra Appl. 88/89 (1987), 733746.
[8]Fischer, E., ‘Uber quadratische Formen mit reellen Koeffizienten’, Monatsh. Math. 16 (1905), 234409.
[9]Gohberg, I., Lancaster, P. and Rodman, L., Matrices and Indefinite Scalar Products (Birkhäuser, Basel, 1983).
[10]Inman, D.J., Vibration (Prentice Hall, Englewood Cliffs, 1989).
[11]Kahan, W., ‘Inclusion theorems for clusters of eigenvalues of hermitian matrices’, in Technical Report (Dept. of Comp. Sci., University of Toronto, 1967).
[12]Kahan, W., Parlett, B. and Jiang, E., ‘Residual bounds on approximate eigensystems of nonnormal matrices’, SIAM J. Numer. Anal. 19 (1982), 470484.
[13]Kaniel, S., ‘Estimates for some computational techniques in linear algebra’, Math. Comp. 20 (1966), 369378.
[14]Lancaster, P., ‘A generalized Rayleigh quotient iteration for lambda-matrices’, Arch. Rational Mech. Anal. 8 (1961), 309322.
[15]Laub, A. and Meyer, K., ‘Canonical forms for sympletic and Hamiltonian matrices’, Celestial Mechanics 9 (1974), 213238.
[16]Lancaster, P. and Ye, Q., ‘Inverse spectral problems for linear and quadratic matrix pencils’, Linear Alg. Appl. 107 (1988), 293309.
[17]Lancaster, P. and Ye, Q., ‘Variational properties and Rayleigh quotient algorithms for symmetric matrix pencils’, in Operator Theory: Advances and Applications 40, pp. 247278 (Birkhauser, Basel, 1989).
[18]Lancaster, P. and Ye, Q., ‘Rayleigh-Ritz and Lanczos methods for symmetric matrix pencils’, (preprint).
[19]Lancaster, P. and Tismentsky, M., The Theory of Matrices (Academic Press, Orlando, 1985).
[20]Najman, B. and Ye, Q., ‘A minimax characterization for eigenvalues of hermitian pencils’, Linear Algebra Appl. (to appear).
[21]Ostrowski, A., ‘On the convergence of the Rayleigh quotient iteration for the computation of characteristic roots and vectors’, I–VI, Arch. Rational Mech. Anal. 14 (1958/1959), 233241, 423428, 325340, 341347, 472481, 153165.
[22]Paige, C., The computation of eigenvalues and eigenvectors of very large sparse matrices, Ph.D. dissertation (University of London, 1971).
[23]Parlett, B.N., The Symmetric Eigenvalue Problem (Prentice-Hall, Englewood Cliffs, N.J., 1980).
[24]Parlett, B.N., ‘The Rayleigh quotient iteration and some generalizations for non-normal matrices’, Math. Comp. 28 (1974), 679693.
[25]Parlett, B.N. and Chen, H., ‘Use of an indefinite inner product for computing damped natural modes’, (preprint).
[26]Parlett, B.N. and Kahan, W., ‘On the convergence of a practical QR algorithm’, Information Processing 68, I Mathematics, Software, pp. 114118, (North-Holland, Amsterdam, 1969).
[27]Phillips, R.S., ‘A minimax characterization for the eigenvalues of a positive symmetric operator in a space with an indefinite metric’, J. Fac. Sci. Univ. Tokyo Sect. IA Math. 17 (1970), 5159.
[28]Rogers, E.H., ‘A minimax theory for overdamped systems’, Arch. Rational Mech. Anal. 16 (1964), 8996.
[29]Saad, Y., ‘On the rate of convergence of the Lanczos and block Lanczos methods’, SIAM J. Numer. Anal. 17 (1980), 687706.
[30]Stewart, G.W., ‘Perturbation bounds for the definite generalized eigenvalue problem’, Linear Alg. Appl. 23 (1979), 6985.
[31]Temple, G., ‘The accuracy of Rayleigh's method of calculating the natural frequencies of vibrating systems’, Proc. Roy. Soc. London 211 (1952), 204224.
[32]Textorius, B., ‘Minimaxprinzipe zur Bestimmung der Eigenwerte J-nichtnegativer Operatoren’, Math. Scand. 35 (1974), 105114.
[33]Turner, R., ‘Some variational principles for a nonlinear eigenvlaue problem’, J. Math. Anal. Appl. 17 (1967), 151165.
[34]Van Dooren, P. and Dewilde, P., ‘The eigenstructure of an arbitrary polynomial matrix: computational aspects’, Linear Algebra Appl. 50 (1983), 545579.
[35]Weierstrass, K., ‘Zur Theorie der bilinearen und quadratischen Formen’, Monatsber. Akad. Wiss. Berl. (1868), p. 310.
[36]Ye, Q., Variational principles and numerical algorithms for symmetric matrix pencils, Ph.D. Thesis (University of Calgary, 1989).
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Bulletin of the Australian Mathematical Society
  • ISSN: 0004-9727
  • EISSN: 1755-1633
  • URL: /core/journals/bulletin-of-the-australian-mathematical-society
Please enter your name
Please enter a valid email address
Who would you like to send this to? *
×
MathJax

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed