Rigorous investigation of the Ikeda map by means of interval arithmetic
- 16 September 2002
- journal article
- Published by IOP Publishing in Nonlinearity
- Vol. 15 (6) , 1759-1779
Abstract
In this work we present various tools for studying dynamical systems implemented in interval arithmetic. The methods include an algorithm for finding all low-period cycles enclosed in a specified region, finding an upper bound of the invariant and nonwandering part of a given set, finding a lower bound of the basin of attraction of a stable periodic orbit, and proving the existence of symbolic dynamics of a given type embedded in the map. Using these techniques a detailed study of the behaviour of the Ikeda map for different parameter values is performed.Keywords
This publication has 12 references indexed in Scilit:
- Finding zeros by multilevel subdivision techniquesIMA Journal of Numerical Analysis, 2002
- Towards complete detection of unstable periodic orbits in chaotic systemsPhysics Letters A, 2001
- Abundance of homoclinic and heteroclinic orbits and rigorous bounds for the topological entropy for the Hénon mapNonlinearity, 2001
- Rigorous computation of topological entropy with respect to a finite partitionPhysica D: Nonlinear Phenomena, 2001
- Exploring invariant sets and invariant measuresChaos: An Interdisciplinary Journal of Nonlinear Science, 1997
- A subdivision algorithm for the computation of unstable manifolds and global attractorsNumerische Mathematik, 1997
- On the estimation of topological entropyJournal of Statistical Physics, 1993
- GLOBAL ANALYSIS BY CELL MAPPINGInternational Journal of Bifurcation and Chaos, 1992
- Algorithm 681: INTBIS, a portable interval Newton/bisection packageACM Transactions on Mathematical Software, 1990
- Global dynamical behavior of the optical field in a ring cavityJournal of the Optical Society of America B, 1985