Finding periodic points from short time series
- 1 July 1997
- journal article
- research article
- Published by American Physical Society (APS) in Physical Review E
- Vol. 56 (1) , 346-350
- https://doi.org/10.1103/physreve.56.346
Abstract
We present an algorithm for finding low-order periodic points of chaotic maps from possibly very short time series. No information about the map other than the time series is used. The method finds all the periodic points of a piecewise linear approximation of the map. We present examples showing the effectiveness of the method for the Henon and Ikeda maps and a chaotic electronic circuit, including a “cycle expansion” calculation of the Hausdorff dimension for the Henon map.Keywords
This publication has 15 references indexed in Scilit:
- Detecting Unstable Periodic Orbits in Chaotic Experimental DataPhysical Review Letters, 1996
- Alternative method to find orbits in chaotic systemsPhysical Review E, 1995
- An Efficient Method for Locating and Computing Periodic Orbits of Nonlinear MappingsJournal of Computational Physics, 1995
- DYNAMICAL SYSTEMS AND TESSELATIONS: DETECTING DETERMINISM IN DATAInternational Journal of Bifurcation and Chaos, 1991
- Unstable periodic orbits and the symbolic dynamics of the complex Hénon mapPhysical Review A, 1990
- Recycling of strange sets: I. Cycle expansionsNonlinearity, 1990
- Exploring chaotic motion through periodic orbitsPhysical Review Letters, 1987
- Computing the n-dimensional Delaunay tessellation with application to Voronoi polytopesThe Computer Journal, 1981
- Computing Dirichlet Tessellations in the PlaneThe Computer Journal, 1978
- Locally equiangular triangulationsThe Computer Journal, 1978