A comparative study of computation of Lyapunov spectra with different algorithms (Q1972886): Difference between revisions
From MaRDI portal
Set profile property. |
Changed an Item |
||
Property / arXiv ID | |||
Property / arXiv ID: chao-dyn/9909029 / rank | |||
Normal rank |
Revision as of 23:24, 18 April 2024
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
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