Continuous time algorithm for Lyapunov exponents. I

William E. Wiesel
Phys. Rev. E 47, 3686 – Published 1 May 1993
PDFExport Citation

Abstract

The Lyapunov exponent algorithm of Benettin et al. [C.R. Acad. Sci. Paris 286A, 431 (1978); Meccanica 15, 9 (1980)] and of Shimada and Nagashima [Prog. Theor. Phys. 61, 1605 (1979)] is converted to a continuous time algorithm. The Gram-Schmidt orthonormalization process is incorporated into the differential equations, making orthogonalization continuous. Differential equations for the k-dimensional fiducial volumes are also derived. It is further shown that this algorithm is a factorization of the fundamental matrix Φ in the form Φ(t)=E(t)W(t)E1(t0), where E(t) is orthonormal and W(t) is upper triangular. Numerical stability of the algorithm is considered, and it is shown that the standard Gram-Schmidt process can be used to stabilize the (possibly) unstable equations of motion for the orthonormal basis vectors. A numerical example is presented.

  • Received 12 August 1992

DOI:https://doi.org/10.1103/PhysRevE.47.3686

©1993 American Physical Society

Authors & Affiliations

William E. Wiesel

  • Air Force Institute of Technology, Wright-Patterson Air Force Base, Dayton, Ohio 45433

See Also

Continuous time algorithm for Lyapunov exponents. II

William E. Wiesel
Phys. Rev. E 47, 3692 (1993)

References (Subscription Required)

Click to Expand
Issue

Vol. 47, Iss. 5 — May 1993

Reuse & Permissions
Access Options
Author publication services for translation and copyediting assistance advertisement

Authorization Required


×
×

Images

×

Sign up to receive regular email alerts from Physical Review E

Log In

Cancel
×

Search


Article Lookup

Paste a citation or DOI

Enter a citation
×