A comparative study of computation of Lyapunov spectra with different algorithms (Q1972886)

From MaRDI portal
Revision as of 11:17, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A comparative study of computation of Lyapunov spectra with different algorithms
scientific article

    Statements

    A comparative study of computation of Lyapunov spectra with different algorithms (English)
    0 references
    0 references
    0 references
    0 references
    2 November 2000
    0 references
    The authors are interested in the computation of Lyapunov exponents for a general system of ordinary differential equations \[ {dZ\over dt} =F(Z,t). \] They consider three numerical procedures. One is standard (it is based on a reorthogonalization algorithm); the second one is a differential version of the previous one; the third one has been recently proposed and it is based on a matrix decomposition. The performances of the three methods are compared and discussed for some low-dimensional typical examples: van der Pol oscillator, Lorenz system, anisotropic Kepler problem, coupled oscillators.
    0 references
    Lyapunov exponents
    0 references
    orthogonalization
    0 references
    matrix decomposition
    0 references
    van der Pol oscillator
    0 references
    Lorenz system
    0 references
    anisotropic Kepler problem
    0 references
    coupled oscillators
    0 references

    Identifiers