Searching chaotic saddles in high dimensions
From MaRDI portal
Publication:4601401
Abstract: We propose new methods to numerically approximate non-attracting sets governing transiently-chaotic systems. Trajectories starting in a vicinity of these sets escape in a finite time and the problem is to find initial conditions with increasingly large . We search points with in a {it search domain} in . Our first method considers a search domain with size that decreases exponentially in , with an exponent proportional to the largest Lyapunov exponent . Our second method considers anisotropic search domains in the {it tangent} unstable manifold, where each direction scale as the inverse of the corresponding {it expanding} singular value of the Jacobian matrix of the iterated map. We show that both methods outperform the state-of-the-art {it Stagger-and-Step} method (Sweet, Nusse, and York, Phys. Rev. Lett. {�f 86}, 2261, 2001) but that only the anisotropic method achieves an efficiency independent of for the case of high-dimensional systems with multiple positive Lyapunov exponents. We perform simulations in a chain of coupled H'enon maps in up to 24 dimensions ( positive Lyapunov exponents). This suggests the possibility of characterizing also non-attracting sets in spatio-temporal systems.
Recommendations
- A procedure for finding numerical trajectories on chaotic saddles
- Analysis of a procedure for finding numerical trajectories close to chaotic saddle hyperbolic sets
- scientific article; zbMATH DE number 1288094
- THE PATH TOWARDS A LONGER LIFE: ON INVARIANT SETS AND THE ESCAPE TIME LANDSCAPE
- Measuring transient chaos in nonlinear one- and two-dimensional maps
Cites work
Cited in
(2)
This page was built for publication: Searching chaotic saddles in high dimensions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4601401)