Robust Chaos in Polynomial unimodal Maps
نویسنده
چکیده
Robust chaos occurs when a dynamical system has a neighborhood in parameter space such that there is one unique chaotic attractor, and no periodic attractors are present [Barreto et al., 1997; Banerjee et al., 19981. This behavior, expected to be relevant for any practical applications of chaos, was shown to exist in a general family of piecewise-smooth twodimensional maps, but conjectured to be impossible for smooth unimodal maps [Banerjee et al., 19981. In fact, the two best known examples of this last type of maps exhibit clearly the rationale for this conjecture: the bifurcation diagram of the (smooth) logistic map is densely populated by periodic windows [Collet & Eckmann, 19801; while on the other hand, a continuously chaotic bifurcation diagram is obtained for the tent map, which is nonsmooth. Recently, however, Andrecut and Ali [2001a] have found an example, and later a full family [2001b], of smooth unimodal maps with continuously chaotic bifurcation diagrams.' These maps have negative Schwarzian derivative, and therefore a unique attractor with the critical point in its basin of attraction. The maps are constructed in such a way that the critical point gets mapped into an unstable fixed point, and so it is not in the basin of attraction of a periodic attractor. This means, therefore, that no periodic attractors are present. The first example has the form [Andrecut & Ali, 2001al:
منابع مشابه
Chaotic Unimodal and Bimodal Maps
We describe up to conjugacy all unimodal and bimodal maps that are chaotic, by giving necessary and sufficient conditions for unimodal and bimodal maps of slopes ±s to be transitive.
متن کاملComputing the Topological Entropy of unimodal Maps
We derive an algorithm to determine recursively the lap number (minimal number of monotone pieces) of the iterates of unimodal maps of an interval with free end-points. The algorithm is obtained by the sign analysis of the itineraries of the critical point and of the boundary points of the interval map. We apply this algorithm to the estimation of the growth number and the topological entropy o...
متن کاملOn the inadequacy of unimodal maps for cryptographic applications
The security of chaos-based cryptosystems is closely related to the possibility of recovering control parameters and/or initial conditions from partial information on the associated chaotic orbits. In this paper we analyze this possibility for the case of unimodal maps. We show a meaningful set of contexts where the dynamics of unimodal maps can be reconstructed, which means a relevant reductio...
متن کاملNonextensivity at the edge of chaos of a new universality class of one-dimensional unimodal dissipative maps
We introduce a new universality class of one-dimensional unimodal dissipative maps. The new family, from now on referred to as the (z1, z2)-logarithmic map, corresponds to a generalization of the z-logistic map. The Feigenbaum-like constants of these maps are determined. It has been recently shown that the probability density of sums of iterates at the edge of chaos of the z-logistic map is num...
متن کاملQuadratic Regular Reversal Maps
We study families of quadratic maps in an attempt to understand the role of dependence on parameters of unimodal maps and its relationship with the computer-generated chaos observed in numerical simulations. Our specific goal is to give conditions on this dependence to avoid chaotic situations. We show several examples that describe in some generality the qualitative properties of quadratic maps.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- I. J. Bifurcation and Chaos
دوره 14 شماره
صفحات -
تاریخ انتشار 2004