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 Omega of these sets escape Omega in a finite time au and the problem is to find initial conditions with increasingly large . We search points with in a {it search domain} in Omega. Our first method considers a search domain with size that decreases exponentially in au, with an exponent proportional to the largest Lyapunov exponent lambda1. 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 au 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 (12 positive Lyapunov exponents). This suggests the possibility of characterizing also non-attracting sets in spatio-temporal systems.









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)