Efficient algorithm for detecting unstable periodic orbits in chaotic systems
arXiv:chao-dyn/9906007 · doi:10.1103/PhysRevE.60.6172
Abstract
We present an efficient method for fast, complete, and accurate detection of unstable periodic orbits in chaotic systems. Our method consists of a new iterative scheme and an effective technique for selecting initial points. The iterative scheme is based on the semi-implicit Euler method, which has both fast and global convergence, and only a small number of initial points is sufficient to detect all unstable periodic orbits of a given period. The power of our method is illustrated by numerical examples of both two- and four-dimensional maps.
4 pages, 3 figures, 1 table, submitted to PRE as Rapid Communication
References in corpus (2)
Cited by in corpus (15)
- Variational method for finding periodic orbits in a general flow
- Finite-Time Braiding Exponents
- Theory and Applications of the Systematic Detection of Unstable Periodic Orbits in Dynamical Systems
- Periodic orbit analysis at the onset of the unstable dimension variability and at the blowout bifurcation
- Exploration of Order in Chaos with Replica Exchange Monte Carlo
- Route to hyperbolic hyperchaos in a nonautonomous time-delay system
- On the use of stabilising transformations for detecting unstable periodic orbits in the Kuramoto-Sivashinsky equation
- Adapting Predictive Feedback Chaos Control for Optimal Convergence Speed
- The Graph Structure of the Generalized Discrete Arnold's Cat Map
- Using braids to quantify interface growth and coherence in a rotor-oscillator flow
- Controlling Chaos Faster
- Efficient detection of periodic orbits in chaotic systems by stabilising transformations
- Simulated annealing algorithm for finding periodic orbits of multi-electron atomic systems
- Hyperbolic periodic orbits in nongradient systems and small-noise-induced metastable transitions
- Efficient method for detection of periodic orbits in chaotic maps and flows