Skip to main content

Abstract

In recent years, there has been a great deal of interdisciplinary work between numerical analysis and dynamical systems. The theme of this chapter is that techniques from dynamical systems can be applied to the study of certain problems in numerical analysis. We will focus on the particular numerical analysis problem of approximating the eigenvalues of a real matrix. The discussion is from the point of view of dynamical systems and assumes a basic knowledge of dynamical systems [D2] and general topology [M]. A substantial portion of the chapter consists of motivating and defining the relevant numerical algorithms and no background in numerical analysis is required.

The author was partially supported by the NSF.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J. Akao, The dynamics of Rayleigh quotient iteration on 2 × 2 matrices, honors thesis, Emory University, 1989.

    Google Scholar 

  2. S. Batterson, Stuctually stable Grassmann transformations, Trans. Amer. Math. Soc. 231 (1977), 385–405.

    Article  MathSciNet  MATH  Google Scholar 

  3. S. Batterson and J. Smille, The dynamics of Rayleigh quotient iteration, SIAM J. Numer. Anal. 26 (1989), 624–636.

    Article  Google Scholar 

  4. S. Batterson and J. Smillie, Rayleigh quotient iteration for nonsymmetric matrices, Math. Comput. 55 (1990), 169–178.

    Article  MathSciNet  MATH  Google Scholar 

  5. S. Batterson, Convergence of the shifted QR algorithm on 3 x 3 normal matrices, Numer. Math., 58 (1990), 341–352.

    Article  MathSciNet  MATH  Google Scholar 

  6. Z. Bai and J. Demmel, On a block implementation of Hessenberg multi-shift QR iteration, Int. J. of High Speed Comput. (1989), 97–112.

    Google Scholar 

  7. P. Deift, L. Li, T. Nanda, and C. Tomei, The Toda flow on a generic orbit is integrable, Commun. Pure Appl. Math. 39 (1986), 183–232.

    Article  MathSciNet  MATH  Google Scholar 

  8. R. Devaney, An Introduction to Chaotic Dynamical Systems, Addison-Wesley, Redwood City, CA, 1989.

    MATH  Google Scholar 

  9. J. Francis, The QR transformation: A unitary analogue to the LR transformation, Parts I and II, Comput. J. 4 (1961), 265–272, 332–345.

    Article  MathSciNet  Google Scholar 

  10. G. Golub and C. Van Loan, Matrix Computations, Johns Hopkins University Press, Baltimore, MD, 1983.

    MATH  Google Scholar 

  11. R. Horn and C. Johnson, Matrix Analysis, Cambridge University Press, Cambridge, 1985.

    MATH  Google Scholar 

  12. M. Hirsch and S. Smale, Differential Equations, Dynamical Systems, and Linear Algebra, Academic Press, New York, 1974.

    MATH  Google Scholar 

  13. J. Munkres, Topology, Prentice-Hall, Englewood Cliffs, NJ, 1975.

    MATH  Google Scholar 

  14. R. Martin, G. Peters, and J. Wilkinson, The QR algorithm for Real Hessenberg matrices, Numer. Math. 14 (1970), 219–231.

    Article  MathSciNet  MATH  Google Scholar 

  15. A. Ostrowski, On the convergence of the Rayleigh quotient iteration for the computation of characteristic roots and vectors, I, II, III, IV, V, VI, Arch. Rat. Mech. Anal. 1, 2, 3, 4 (1957–60).

    Google Scholar 

  16. B. Parlett, Global convergence of the basic QR algorithm on Hessenberg matrices, Math. Comput. 22 (1968), 803–817.

    MathSciNet  MATH  Google Scholar 

  17. B. Parlett and W. Kahan, On the convergence of a practical QR algorithm, Mathematical Software, Information Processing 68, sect 1, North-Holland, Amsterdam, 1969, pp. 114–118.

    Google Scholar 

  18. B. Parlett, The Symmetric Eigenvalue Problem, Prentice-Hall, Englewood Cliffs, NJ, 1980.

    MATH  Google Scholar 

  19. G. Peters and J. Wilkinson, Eigenvectors of real and complex matrices by LR and QR triangularizations, Numer. Math. 16 (1970), 181–204.

    Article  MathSciNet  Google Scholar 

  20. M. Shub, The geometry and topology of dynamical systems and algorithms for numerical problems, preprint, 1983.

    Google Scholar 

  21. M. Shub, Some remarks on dynamical systems and numerical analysis, Dynamical Systems and Numerical Analysis: Proceedings of the VII ELAM, Equinoccio, Universidad Simon Bolivar, Caracas, 1986, pp. 69–92.

    Google Scholar 

  22. M. Shub and A. Vasquez, Some linearly induced Morse-Smale systems, the QR algorithm and the Toda lattice, preprint.

    Google Scholar 

  23. S. Smale, On the efficiency of algorithms of analysis, Bull. Amer. Math. Soc. 13 (1985), 87–121.

    Article  MathSciNet  MATH  Google Scholar 

  24. G. Stewart, Introduction to Matrix Computations, Academic Press, New York, 1973.

    MATH  Google Scholar 

  25. D. Watkins, Understanding the QR algorithm, SIAM Rev. 24 (1982), 427–440.

    Article  MathSciNet  MATH  Google Scholar 

  26. D. Watkins, On GR algorithms for the eigenvalue problem, preprint, 1988.

    Google Scholar 

  27. D. Watkins and L. Elsner, Convergence of algorithms of decomposition type for the eigenvalue problem, preprint, 1990.

    Google Scholar 

  28. J. Wilkinson, The Algebraic Eigenvalue Problem, Clarendon Press, Oxford, 1965.

    MATH  Google Scholar 

Download references

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag New York, Inc.

About this chapter

Cite this chapter

Batterson, S. (1993). The Dynamics of Eigenvalue Computation. In: Hirsch, M.W., Marsden, J.E., Shub, M. (eds) From Topology to Computation: Proceedings of the Smalefest. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-2740-3_35

Download citation

  • DOI: https://doi.org/10.1007/978-1-4612-2740-3_35

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-1-4612-7648-7

  • Online ISBN: 978-1-4612-2740-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics