Error analysis of QR algorithms for computing Lyapunov exponents

E.J. McDonald, D.J. Higham

Research output: Contribution to journalArticle

7 Citations (Scopus)
42 Downloads (Pure)

Abstract

Lyapunov exponents give valuable information about long term dynamics. The discrete and continuous QR algorithms are widely used numerical techniques for computing approximate Lyapunov exponents, although they are not yet supported by a general error analysis. Here, a rigorous convergence theory is developed for both the discrete and continuous QR algorithm applied to a constant coefficient linear system with real distinct eigenvalues. For the discrete QR algorithm, the problem essentially reduces to one of linear algebra for which the timestepping and linear algebra errors uncouple and precise convergence rates are obtained. For the continuous QR algorithm, the stability, rather than the local accuracy, of the timestepping algorithm is relevant, and hence the overall convergence rate is independent of the stepsize. In this case it is vital to use a timestepping method that preserves orthogonality in the ODE system. We give numerical results to illustrate the analysis. Further numerical experiments and a heuristic argument suggest that the convergence properties carry through to the case of complex conjugate eigenvalue pairs.
Original languageEnglish
Pages (from-to)234-251
Number of pages17
JournalETNA - Electronic Transactions on Numerical Analysis
Volume12
Publication statusPublished - 2001

Keywords

  • dynamics
  • eigenvalues
  • orthogonal iteration
  • timestepping
  • computer science
  • applied mathematics

Cite this