Research paperConvergence rates for sequences of bifurcation parameters of nonautonomous dynamical systems generated by flat top tent maps
Introduction
The dynamics of discrete nonautonomous dynamical systems is an active field of research in many areas of applications. Periodic nonautonomous systems are a suitable theoretical framework for study systems in fluctuating environments. In particular, they have been used, for example, as models of populations with periodic forcing ([7] and previous papers of the author) or the DNA replication and repair (see [9]).
The interest in studying the dynamics of stunted tent maps goes back to the work of Metropolis et al. ([5]). These maps are good models to study related families of differentiable maps, since they have a simple translation to symbolic dynamics, covering all possible kneading data. Families of flat topped maps have been used to describe limiter control to chaos in electronic circuits and telecommunications (see [12]), in the study of biological populations (see [8]) and in cardiology, to control cardiac arrhythmia ([4]).
In this paper we study a 2-parameter family of 2-periodic nonautonomous systems generated by the alternate iteration of two stunted tent maps. The main results of the paper are contained in Theorems 5 and 6. In Theorem 5, using symbolic dynamics, we compute convergence rates for sequences of bifurcation parameters associated to renormalizable systems, in the spirit of some of those obtained by Feigenbaum ([2]), these rates are universal in the sense that they do not depend on the parameters where the sequence starts. Besides the expected Feigenbaum diagram properties, we have identified sequences of period doubling bifurcations, not associated to renormalizable systems and so not present in the autonomous context. These sequences can be seen as anharmonic period doubling sequences, (for results on this topic see [6] and references therein). The convergence rates of these last sequences are stated in Theorem 6.
The paper is organized as follows: In Section 2 we introduce nonautonomous 2-periodic stunted tent systems and their associated symbolic dynamics. In Section 3 we develop the tools needed in the following sections, namely *-product and renormalization, introduced in the nonautonomous setting in [3]. In Section 4 we compute the convergence rates of a sequence of parameters associated to renormalizable systems and prove its universality, in the sense that they do not depend on the parameters where the sequence starts, going back to the work proposed in [10] for a family of Lorenz maps. Finally, in Section 5 we study sequences of anharmonic period doubling bifurcations with identical convergence rates. The last section is devoted to the proofs of the main results of 3 *-Product and renormalization, 4 Convergence rates to 5.
Section snippets
Family of stunted tent maps
Consider the family of functions with parameter defined bywith .
The function fv is called stunted tent map and is obtained from the tent map T,taking fv constant in the interval , (see Fig. 1).
The interval is called plateau. The family of stunted tent maps is denoted by .
Let be a 2-periodic sequence. The 2-periodic nonautonomous dynamical system defined by (
*-Product and renormalization
In [1] the authors introduced an inner composition law, the *-product, applied to unimodal families. In the autonomous setting it is well known the relation between systems where the kneading data is *-factorizable and renormalizable systems. The relation between the renormalizability of periodic nonautonomous systems of two-piecewise monotone maps and reducibility of its kneading data with respect to the *-product was established in [3].
To improve reading fluency we move all the proofs in this
Convergence rates
Feigenbaum observed that, for the unimodal family as well as many other families of maps in the interval, the sequence of parameters (λn)n, corresponding to period doubling bifurcations, is convergent and satisfiesThis convergence rate is linear in the sense thatGenerally, a convergent sequence un that satisfieshas convergence rate of order l in the sense that
Anharmonic period doubling bifurcations
Traditionally, convergence rates of this type in dynamical systems occur in sequences of renormalizable maps such that, generally, each map is a renormalization of the consecutive one.
In the following we will study some period doubling sequences of 2-systems that do not fit in this pattern. Nevertheless we will prove that the corresponding one dimensional parameter sequences converge with convergence rate of order 2.
Consider X ∈ Σ, a right-sequence, and define the sequence of symbolic sequences
Proofs from Section 3
Proof We aim to prove that σ2n(X*Y) ≤ X*Y, for all n such that 2n < |X*Y|. Suppose that thus for all . There is 0 ≤ m < |X|/2 and 1 ≤ k ≤ |Y| such that . If we have and the result follows. Suppose now that 1 ≤ k < |Y|. Since X is maximal we have σ2m(X) < X. Hence, there is such thatandIf then and we are done. Else, if then Theorem 3
Acknowledgements
This work was partially supported by FCT-Portugal, throw project PEst-OE/MAT/UI0117/2014.
References (13)
- et al.
On finite limit sets for transformations on the unit interval
J Combin Theory
(1973) Multiple attractors and resonance in periodically forced population models
Physica D
(2000)- et al.
Iterations of endomorphisms on the real axis and representation of numbers
Annales de l’IHP, section A
(1978) Quantitative universality for a class of nonlinear transformations
J Stat Phisics
(1978)- et al.
Symbolic dynamics and renormalization of non autonomous k periodic dynamical systems
JDiffEqu Appl
(2013) - et al.
Bifurcations in flat-topped maps and the control of cardiac chaos
Int J Bifurc Chaos
(1994)
Cited by (2)
The deconstruction of a fractal
2022, Communications in Nonlinear Science and Numerical SimulationCitation Excerpt :The periodic orbits of these systems become the admissible orbits in the Poincaré section, while the structure of the fractal attractors will be closely related to the structures of omega-limit set of non-periodic turning point [12,13]. From a mathematical point of view, kneading sequences [14] are important by themselves [15] but are also a basic tool for the study of 2-parameter families of functions [16]. Practical applications range from cryptanalysis [17] to industrial process modelling [18].
Attractors in Pattern Iterations of Flat Top Tent Maps
2023, Mathematics