DOCSLIB.ORG

Appendix a One-Dimensional Maps

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Appendix a One-Dimensional Maps Appendix A One-Dimensional Maps A.I Introduction The objective of this Appendix is to provide an introduction to the theory of chaos. One-dimensional maps are used as a vehicle to convey the concepts required for study­ ing chaos, firstly because fewer concepts are involved compared to higher dimensional maps and differential equations and secondly because of the fact that one-dimensional maps and their evolutions may easily be visualized, which helps to grasp ideas in­ volved more rapidly. For generalization of these result s to, and additional result s on higher dimensional mappings and differential equations, the reader is referred to the bibliography. Some important theorems are stated in Appendix B without proof. Consider an arbitrary one dimensional, N-th order discrete dynamical system whose time evolution is described by the homogeneous recurrence relation X n+l = f( X n, Xn- l, .•. , X n - N + l ), where f is some function N f: R -t R, and X n is the dynamical system's evolution on the n-th discrete time inst ant , i.e. n = 0,1,2, .... In general f may be nonlinear and is usually at least piecewise differentiable. The function f which describ es some dynamical system is termed a mapping or simply a map. Example A.I Consider the logistic map described by Xn+l = f(x n ), (A.l) where f : I -t R, f(x) := Tx(l - x ), (A.2) 343 344 APPENDIX A. ONE-DIMENSIONAL MAPS 0.9 0.8 0.7 0.6 .-... ~ '-" 0.5 '+-.., 0.4 0.3 0.2 0.1 o x Figure A.I: The logistic map for r = 4 . with 1:= {x I 0 ~ x ~ I} , and r E R+ a so-called bifurcation param eter of the system. From (A.2) we observe that f is of degree 2 in x and hence nonlinear in x. The map given by (A.2) is illustrated in Figure A.I. It is obvious that the logistic map is one-dimensional and of order one. • In th is chapter we consider only one-dimensional, first order map s, that is, maps of the form (A.3) where generally f : R --t R. A.2 Orbits and Their Properties Definition A.2 Consider the map f : X --t X,X c R defined by n E N o (AA ) The set of points A .2. ORBITS AND THEIR PROPERTIES 345 obtained from (A.4) is defined as the forward orbit of the point xo. If f is a homeo­ morphism, we may also define the backward orbit of Xo as the set of points and the full orbit of Xo as the set O(xo) := O-(xo) U O+(xo) = {Xn In E Z} , obtained from (A.4) . • At this point it is worthwhile to mention that another popular notation for represent­ ing the n-th iterate of the point Xo under the map f is by application of the inductive definition f(nl(xo) := f(J(n-ll(xo)), n E N, where f1l(xo) = f(xo). In the case of a causal dynamical system described by (A.4), the forward orbit of the system is its response to the initial condition xo. In general an orbit of a dynamical system is the time evolution of the system coinciding with some predetermined value Xo on iteration instance n = O. Since we classify a dynamical system based on its response to initial conditions (and inputs) it is therefore important to understand all orbits of a map . A particular type of orbit called a periodic orbit plays an important role in the study of dynamical systems. Definition A.3 The point x· is periodic of prime period-n if but f(ml(x') i= x· for I ~ m < n. The set of all iterates of a periodic point form a periodic orbit [50] . We denote the set of all points of prime period-n of the map f by Pern(J). • Definition AA A fixed point (or equilibrium point) x· of the map f is a point of period-l, that is, f(x') = z", The set of all fixed points of the map f will be denoted by Fix(J), i.e. Fix(J) := Perl(J). • 346 APPENDIX A. ONE-DIMENSIONAL MAPS 0.9 0.8 0.7 0.6 "'"""~ '-' 0.5 "+-., 0.4 0.3 0.2 0.1 0 0 0.4 0.6 0.8 x Figure A.2: Fixed points of the logistic map for r = 4. To find the set of fixed points of a map f graphically we may overlay the curve Xn+l = X n onto Xn+l = f(xn ) and look for all points of intersection. Example A.5 Calculate the fixed points of the logistic map, f : I -+ I, f(x) = rx(l - x), From Figure A.2 we see that the logistic map has two fixed points as indicated by the dots. The set of fixed points of f can be shown to be Fix(J) = {O, (r - l)/r}.• Example A.6 Find the fixed points of the map f : I -+ I defined by (refer to Section 6.3) f(x) = 1 - (ax +f3)(mod 1), a,{3 E R+ . (A.5) The graph of f is shown in Figure A.3. The fixed points are indicated by the dots in Figure A.3. To find the fixed points, consider x· = f(x') ~ x· = 1 - (ax' +{3)(mod 1) ~ x• = 1 - (ax' + {3) + n, for some n E Z (see (A.6)) n+1-{3 ~ x· , for some n E Z = l+a A.2. ORBITS AND THEIR PROPERTIES 347 0.9 0.8 0.7 0.6 ,-..., .......,l-: 0.5 "-, 0.4 0.3 0.2 0.1 00 0.2 0.4 0.6 0.8 X Figure A.3: The graph of f with the fixed points indicated by dots. where we have used x = y(mod z) ¢:::::> x - y = kz, for some k E Z. (A.6) Thus the set of fixed points of f is Fix(f) = {x E I Ix= n~ ~ : jJ, nEZ} = { n;~: jJ I nEZ, ff3-ll ::;n ::; Lf3+ aJ}, (A.7) where fYl (respectively LyJ) denotes the least (respectively greatest) integer greater (respectively less) than or equal to the real number y . • Example A.7 Consider the logistic map. Then 5- VS 5+VS} { 8 ' 8 is a period-2 orbit of the logistic map. • Example A.8 The map f : I -+ I given by 2x , if x E [0 ,1/2) f(x) = (A.8) { . 2(1-x), if x E [1/2,1] 348 APPENDIX A. ONE-DIMENSIONAL MAPS is called the tent map. It can easily be verified that is a period-S orbit of the tent map. • In principle the set of points of period-n, Pern(J) of the map j : X ~ X, X C R can be determined analytically by solving the expression for x*. However, because j is usually nonlinear this is sometimes only possible for small values of n (say n = 1,2), while for greater values of n this is generally not pos­ sible. In the latter case the periodic points can only be determined either numerically or graphically. To determine the set Pern(J) graphically, we proceed as follows . First the set of all positive integer divisors for n, say V = {I, nl, n2, ... , np } is found. Then the graphs of the corresponding iterates of j are plotted, that is, the graphs of the set of functions p {j, j(nll .r»,... ,j(n ) }, overlayed onto one another. Next we overlay the graph of y = x onto the aforemen­ tioned graphs. All points of intersection of the above set of iterates of j and the the diagonal (i.e. the graph of y = x) are then removed and then the graph of f n ) is over­ laid onto the resulting graph . The intersections between j(n) and the disconnected segments of the diagonal are all periodic points of period-no Mathematically this can be written as Pern(J) ={x E X Ix == j(n)(x)} '-U {x E X Ix = j(k)(x)}. kEV Example A.9 Find the points of period-3 for the logistic map with r = 3.839. The graphs of j and j(3) are shown in Figure AA. It can be verified that [217] Per3(J) = {al,a2,a3,bl,b2,b3} where al = 0.149888, bl = 0.169040, a2 0.489172, b2 0.539247, a3 = 0.959299, b3 0.953837, up to six decimals. A.2. ORBITS AND THEIR PROPERTIES 349 0.8 ~ ';::::::" 0.6 0 'i-, --'l-( '-' 0.4 'i-, 0.2 o -- . '~------------------------- ----- - 0', "/ o 0.2 0.4 0.6 0.8 x Figure A.4: The graphs of f (dashed line) and f(3) (solid line). Note that the cardinality of Per3(J) is 6. Since by definition a period-3 orbit contains exactly 3 points, this implies that f possesses two independent period-3 orbits . It may easily be verified numerically that the two period-3 orbits are {at, az, a3,at, . .} and {bt, bz , bs , bt, .. .}. • Example A.I0 For the map given by (A.5), determine Perz(J). The two cases a -1= 1 and a = 1 will be considered separately. The case a -1= 1: We have f(Z)(x') = 1 - {af(x') + ,8}(mod 1) = 1- {a[l - (ax' + ,8)(mod 1)] +,8} (mod 1) = 1 - {a +,8 - (azx' + a,8)(mod a)} (mod 1) (A.9) 1 - {a + ,8- aZx' - a,8 - na} + m, for some n, m E Z = aZx' + (a -1)(,8 -1) + an + m, for some n,m E Z, (A.10) where (A.6) was used together with the identity k(y(mod z)) == ky(mod kz).
Load more

Recommended publications
  • Construction and Chaos Properties Analysis of a Quadratic Polynomial Surjective Map
    INTERNATIONAL JOURNAL OF CIRCUITS, SYSTEMS AND SIGNAL PROCESSING Volume 11, 2017 Construction and Chaos Properties Analysis of a Quadratic Polynomial Surjective Map Jun Tang, Jianghong Shi, Zhenmiao Deng randomly distributed sequences [16]–[18]. Abstract—In this paper, a kind of quadratic polynomial surjective In this paper, we deduce the relationships between the map (QPSM) is constructed, and the topological conjugation of the coefficients of a quadratic polynomial surjective map (QPSM) QPSM and tent map is proven. With the probability density function and prove the topological conjugacy of the QPSM and tent map. (PDF) of the QPSM being deduced, an anti-trigonometric transform We give the PDF of the QPSM, which is then used to design a function is proposed to homogenize the QPSM. The information entropy, Kolmogorov entropy (KE), and discrete entropy (DE) of the transform function to homogenize the QPSM sequence. Finally, QPSM are calculated for both the original and homogenized maps we estimate entropies of the QPSM such as the information, with respect to different parameters. Simulation results show that the Kolmogorov, and discrete entropies for both the original and information entropy of the homogenized sequence is close to the homogenized map. theoretical limit and the discrete entropy remains unchanged, which This paper is organized as follows. Section II presents a suggest that the homogenization method is effective. Thus, the method for determining the QPSM coefficients, and the homogenized map not only inherits the diverse properties of the original QPSM but also possesses better uniformity. These features topological conjugation of the QPSM and tent map is proven. make it more suitable to secure communication and noise radar.
    [Show full text]
  • Dynamics Forced by Homoclinic Orbits
    DYNAMICS FORCED BY HOMOCLINIC ORBITS VALENT´IN MENDOZA Abstract. The complexity of a dynamical system exhibiting a homoclinic orbit is given by the orbits that it forces. In this work we present a method, based in pruning theory, to determine the dynamical core of a homoclinic orbit of a Smale diffeomorphism on the 2-disk. Due to Cantwell and Conlon, this set is uniquely determined in the isotopy class of the orbit, up a topological conjugacy, so it contains the dynamics forced by the homoclinic orbit. Moreover we apply the method for finding the orbits forced by certain infinite families of homoclinic horseshoe orbits and propose its generalization to an arbitrary Smale map. 1. Introduction Since the Poincar´e'sdiscovery of homoclinic orbits, it is known that dynamical systems with one of these orbits have a very complex behaviour. Such a feature was explained by Smale in terms of his celebrated horseshoe map [40]; more precisely, if a surface diffeomorphism f has a homoclinic point then, there exists an invariant set Λ where a power of f is conjugated to the shift σ defined on the compact space Σ2 = f0; 1gZ of symbol sequences. To understand how complex is a diffeomorphism having a periodic or homoclinic orbit, we need the notion of forcing. First we will define it for periodic orbits. 1.1. Braid types of periodic orbits. Let P and Q be two periodic orbits of homeomorphisms f and g of the closed disk D2, respectively. We say that (P; f) and (Q; g) are equivalent if there is an orientation-preserving homeomorphism h : D2 ! D2 with h(P ) = Q such that f is isotopic to h−1 ◦ g ◦ h relative to P .
    [Show full text]
  • Approximating Stable and Unstable Manifolds in Experiments
    PHYSICAL REVIEW E 67, 037201 ͑2003͒ Approximating stable and unstable manifolds in experiments Ioana Triandaf,1 Erik M. Bollt,2 and Ira B. Schwartz1 1Code 6792, Plasma Physics Division, Naval Research Laboratory, Washington, DC 20375 2Department of Mathematics and Computer Science, Clarkson University, P.O. Box 5815, Potsdam, New York 13699 ͑Received 5 August 2002; revised manuscript received 23 December 2002; published 12 March 2003͒ We introduce a procedure to reveal invariant stable and unstable manifolds, given only experimental data. We assume a model is not available and show how coordinate delay embedding coupled with invariant phase space regions can be used to construct stable and unstable manifolds of an embedded saddle. We show that the method is able to capture the fine structure of the manifold, is independent of dimension, and is efficient relative to previous techniques. DOI: 10.1103/PhysRevE.67.037201 PACS number͑s͒: 05.45.Ac, 42.60.Mi Many nonlinear phenomena can be explained by under- We consider a basin saddle of Eq. ͑1͒ which lies on the standing the behavior of the unstable dynamical objects basin boundary between a chaotic attractor and a period-four present in the dynamics. Dynamical mechanisms underlying periodic attractor. The chosen parameters are in a region in chaos may be described by examining the stable and unstable which the chaotic attractor disappears and only a periodic invariant manifolds corresponding to unstable objects, such attractor persists along with chaotic transients due to inter- as saddles ͓1͔. Applications of the manifold topology have secting stable and unstable manifolds of the basin saddle.
    [Show full text]
  • Fractal Growth on the Surface of a Planet and in Orbit Around It
    Wilfrid Laurier University Scholars Commons @ Laurier Physics and Computer Science Faculty Publications Physics and Computer Science 10-2014 Fractal Growth on the Surface of a Planet and in Orbit around It Ioannis Haranas Wilfrid Laurier University, [email protected] Ioannis Gkigkitzis East Carolina University, [email protected] Athanasios Alexiou Ionian University Follow this and additional works at: https://scholars.wlu.ca/phys_faculty Part of the Mathematics Commons, and the Physics Commons Recommended Citation Haranas, I., Gkigkitzis, I., Alexiou, A. Fractal Growth on the Surface of a Planet and in Orbit around it. Microgravity Sci. Technol. (2014) 26:313–325. DOI: 10.1007/s12217-014-9397-6 This Article is brought to you for free and open access by the Physics and Computer Science at Scholars Commons @ Laurier. It has been accepted for inclusion in Physics and Computer Science Faculty Publications by an authorized administrator of Scholars Commons @ Laurier. For more information, please contact [email protected]. 1 Fractal Growth on the Surface of a Planet and in Orbit around it 1Ioannis Haranas, 2Ioannis Gkigkitzis, 3Athanasios Alexiou 1Dept. of Physics and Astronomy, York University, 4700 Keele Street, Toronto, Ontario, M3J 1P3, Canada 2Departments of Mathematics and Biomedical Physics, East Carolina University, 124 Austin Building, East Fifth Street, Greenville, NC 27858-4353, USA 3Department of Informatics, Ionian University, Plateia Tsirigoti 7, Corfu, 49100, Greece Abstract: Fractals are defined as geometric shapes that exhibit symmetry of scale. This simply implies that fractal is a shape that it would still look the same even if somebody could zoom in on one of its parts an infinite number of times.
    [Show full text]
  • Robust Transitivity of Singular Hyperbolic Attractors
    Robust transitivity of singular hyperbolic attractors Sylvain Crovisier∗ Dawei Yangy January 22, 2020 Abstract Singular hyperbolicity is a weakened form of hyperbolicity that has been introduced for vector fields in order to allow non-isolated singularities inside the non-wandering set. A typical example of a singular hyperbolic set is the Lorenz attractor. However, in contrast to uniform hyperbolicity, singular hyperbolicity does not immediately imply robust topological properties, such as the transitivity. In this paper, we prove that open and densely inside the space of C1 vector fields of a compact manifold, any singular hyperbolic attractors is robustly transitive. 1 Introduction Lorenz [L] in 1963 studied some polynomial ordinary differential equations in R3. He found some strange attractor with the help of computers. By trying to understand the chaotic dynamics in Lorenz' systems, [ABS, G, GW] constructed some geometric abstract models which are called geometrical Lorenz attractors: these are robustly transitive non- hyperbolic chaotic attractors with singularities in three-dimensional manifolds. In order to study attractors containing singularities for general vector fields, Morales- Pacifico-Pujals [MPP] first gave the notion of singular hyperbolicity in dimension 3. This notion can be adapted to the higher dimensional case, see [BdL, CdLYZ, MM, ZGW]. In the absence of singularity, the singular hyperbolicity coincides with the usual notion of uniform hyperbolicity; in that case it has many nice dynamical consequences: spectral decomposition, stability, probabilistic description,... But there also exist open classes of vector fields exhibiting singular hyperbolic attractors with singularity: the geometrical Lorenz attractors are such examples. In order to have a description of the dynamics of arXiv:2001.07293v1 [math.DS] 21 Jan 2020 general flows, we thus need to develop a systematic study of the singular hyperbolicity in the presence of singularity.
    [Show full text]
  • Topological Entropy of Quadratic Polynomials and Sections of the Mandelbrot Set
    Topological entropy of quadratic polynomials and sections of the Mandelbrot set Giulio Tiozzo Harvard University Warwick, April 2012 2. External rays 3. Main theorem 4. Ideas of proof (maybe) 5. Complex version Summary 1. Topological entropy 3. Main theorem 4. Ideas of proof (maybe) 5. Complex version Summary 1. Topological entropy 2. External rays 4. Ideas of proof (maybe) 5. Complex version Summary 1. Topological entropy 2. External rays 3. Main theorem 5. Complex version Summary 1. Topological entropy 2. External rays 3. Main theorem 4. Ideas of proof (maybe) Summary 1. Topological entropy 2. External rays 3. Main theorem 4. Ideas of proof (maybe) 5. Complex version Topological entropy of real maps Let f : I ! I, continuous. logf#laps of f ng htop(f ; R) := lim n!1 n Topological entropy of real maps Let f : I ! I, continuous. logf#laps of f ng htop(f ; R) := lim n!1 n Topological entropy of real maps Let f : I ! I, continuous. logf#laps of f ng htop(f ; R) := lim n!1 n Topological entropy of real maps Let f : I ! I, continuous. logf#laps of f ng htop(f ; R) := lim n!1 n Topological entropy of real maps Let f : I ! I, continuous. logf#laps of f ng htop(f ; R) := lim n!1 n Topological entropy of real maps Let f : I ! I, continuous. logf#laps of f ng htop(f ; R) := lim n!1 n Topological entropy of real maps Let f : I ! I, continuous. logf#laps of f ng htop(f ; R) := lim n!1 n Topological entropy of real maps Let f : I ! I, continuous.
    [Show full text]
  • Hartman-Grobman and Stable Manifold Theorem
    THE HARTMAN-GROBMAN AND STABLE MANIFOLD THEOREM SLOBODAN N. SIMIC´ This is a summary of some basic results in dynamical systems we discussed in class. Recall that there are two kinds of dynamical systems: discrete and continuous. A discrete dynamical system is map f : M → M of some space M.A continuous dynamical system (or flow) is a collection of maps φt : M → M, with t ∈ R, satisfying φ0(x) = x and φs+t(x) = φs(φt(x)), for all x ∈ M and s, t ∈ R. We call M the phase space. It is usually either a subset of a Euclidean space, a metric space or a smooth manifold (think of surfaces in 3-space). Similarly, f or φt are usually nice maps, e.g., continuous or differentiable. We will focus on smooth (i.e., differentiable any number of times) discrete dynamical systems. Let f : M → M be one such system. Definition 1. The positive or forward orbit of p ∈ M is the set 2 O+(p) = {p, f(p), f (p),...}. If f is invertible, we define the (full) orbit of p by k O(p) = {f (p): k ∈ Z}. We can interpret a point p ∈ M as the state of some physical system at time t = 0 and f k(p) as its state at time t = k. The phase space M is the set of all possible states of the system. The goal of the theory of dynamical systems is to understand the long-term behavior of “most” orbits. That is, what happens to f k(p), as k → ∞, for most initial conditions p ∈ M? The first step towards this goal is to understand orbits which have the simplest possible behavior, namely fixed and periodic ones.
    [Show full text]
  • Computing Complex Horseshoes by Means of Piecewise Maps
    November 26, 2018 3:54 ws-ijbc International Journal of Bifurcation and Chaos c World Scientific Publishing Company Computing complex horseshoes by means of piecewise maps Alvaro´ G. L´opez, Alvar´ Daza, Jes´us M. Seoane Nonlinear Dynamics, Chaos and Complex Systems Group, Departamento de F´ısica, Universidad Rey Juan Carlos, Tulip´an s/n, 28933 M´ostoles, Madrid, Spain [email protected] Miguel A. F. Sanju´an Nonlinear Dynamics, Chaos and Complex Systems Group, Departamento de F´ısica, Universidad Rey Juan Carlos, Tulip´an s/n, 28933 M´ostoles, Madrid, Spain Department of Applied Informatics, Kaunas University of Technology, Studentu 50-415, Kaunas LT-51368, Lithuania Received (to be inserted by publisher) A systematic procedure to numerically compute a horseshoe map is presented. This new method uses piecewise functions and expresses the required operations by means of elementary transfor- mations, such as translations, scalings, projections and rotations. By repeatedly combining such transformations, arbitrarily complex folding structures can be created. We show the potential of these horseshoe piecewise maps to illustrate several central concepts of nonlinear dynamical systems, as for example the Wada property. Keywords: Chaos, Nonlinear Dynamics, Computational Modelling, Horseshoe map 1. Introduction The Smale horseshoe map is one of the hallmarks of chaos. It was devised in the 1960’s by Stephen Smale arXiv:1806.06748v2 [nlin.CD] 23 Nov 2018 [Smale, 1967] to reproduce the dynamics of a chaotic flow in the neighborhood of a given periodic orbit. It describes in the simplest way the dynamics of homoclinic tangles, which were encountered by Henri Poincar´e[Poincar´e, 1890] and were intensively studied by George Birkhoff [Birkhoff, 1927], and later on by Mary Catwright and John Littlewood, among others [Catwright & Littlewood, 1945, 1947; Levinson, 1949].
    [Show full text]
  • An Image Cryptography Using Henon Map and Arnold Cat Map
    International Research Journal of Engineering and Technology (IRJET) e-ISSN: 2395-0056 Volume: 05 Issue: 04 | Apr-2018 www.irjet.net p-ISSN: 2395-0072 An Image Cryptography using Henon Map and Arnold Cat Map. Pranjali Sankhe1, Shruti Pimple2, Surabhi Singh3, Anita Lahane4 1,2,3 UG Student VIII SEM, B.E., Computer Engg., RGIT, Mumbai, India 4Assistant Professor, Department of Computer Engg., RGIT, Mumbai, India ---------------------------------------------------------------------***--------------------------------------------------------------------- Abstract - In this digital world i.e. the transmission of non- 2. METHODOLOGY physical data that has been encoded digitally for the purpose of storage Security is a continuous process via which data can 2.1 HENON MAP be secured from several active and passive attacks. Encryption technique protects the confidentiality of a message or 1. The Henon map is a discrete time dynamic system information which is in the form of multimedia (text, image, introduces by michel henon. and video).In this paper, a new symmetric image encryption 2. The map depends on two parameters, a and b, which algorithm is proposed based on Henon’s chaotic system with for the classical Henon map have values of a = 1.4 and byte sequences applied with a novel approach of pixel shuffling b = 0.3. For the classical values the Henon map is of an image which results in an effective and efficient chaotic. For other values of a and b the map may be encryption of images. The Arnold Cat Map is a discrete system chaotic, intermittent, or converge to a periodic orbit. that stretches and folds its trajectories in phase space. Cryptography is the process of encryption and decryption of 3.
    [Show full text]
  • WHAT IS a CHAOTIC ATTRACTOR? 1. Introduction J. Yorke Coined the Word 'Chaos' As Applied to Deterministic Systems. R. Devane
    WHAT IS A CHAOTIC ATTRACTOR? CLARK ROBINSON Abstract. Devaney gave a mathematical definition of the term chaos, which had earlier been introduced by Yorke. We discuss issues involved in choosing the properties that characterize chaos. We also discuss how this term can be combined with the definition of an attractor. 1. Introduction J. Yorke coined the word `chaos' as applied to deterministic systems. R. Devaney gave the first mathematical definition for a map to be chaotic on the whole space where a map is defined. Since that time, there have been several different definitions of chaos which emphasize different aspects of the map. Some of these are more computable and others are more mathematical. See [9] a comparison of many of these definitions. There is probably no one best or correct definition of chaos. In this paper, we discuss what we feel is one of better mathematical definition. (It may not be as computable as some of the other definitions, e.g., the one by Alligood, Sauer, and Yorke.) Our definition is very similar to the one given by Martelli in [8] and [9]. We also combine the concepts of chaos and attractors and discuss chaotic attractors. 2. Basic definitions We start by giving the basic definitions needed to define a chaotic attractor. We give the definitions for a diffeomorphism (or map), but those for a system of differential equations are similar. The orbit of a point x∗ by F is the set O(x∗; F) = f Fi(x∗) : i 2 Z g. An invariant set for a diffeomorphism F is an set A in the domain such that F(A) = A.
    [Show full text]
  • Using Standard Syste
    PHYSICAL REVIEW E VOLUME 55, NUMBER 6 JUNE 1997 Cumulative Author Index All authors of papers published in this volume are listed alphabetically. Full titles are included in each ®rst author's entry. For Rapid Communi- cations an R precedes the page number. The letters (C) and (BR) following the page number indicate that a paper is a Comment or a Brief Report, respectively. References with (E) are to Errata. Abarbanel, Henry D. I. — ͑see Huerta, Ramon͒ E 55, R2108 and Jin-Qing Fang — Synchronization of chaos and hyperchaos ͑see Liu, Clif͒ E 55, 6483 using linear and nonlinear feedback functions. E 55, 5285 Abdullaev, F. Kh. and J. G. Caputo — Propagation of an envelope Aliaga, J. — ͑see Gruver, J. L.͒ E 55, 6370 soliton in a medium with spatially varying dispersion. E 55, 6061 Alig, I. — ͑see Mayer, W.͒ E 55, 3102 Abel, T., E. Brener, and H. Mu¨ller-Krumbhaar — Three-dimensional Allahyarov, E. A., L. I. Podloubny, P. P. J. M. Schram, and S. A. growth morphologies in diffusion-controlled channel growth. Trigger — Damping of longitudinal waves in colloidal crystals E 55, 7789͑BR͒ of finite size. E 55, 592 Abramson, Guillermo — Ecological model of extinctions. E 55, 785 Allain, C. — ͑see Senis, D.͒ E 55, 7797͑BR͒ Acharyya, M., J. K. Bhattacharjee, and B. K. Chakrabarti Allegrini, M. — ͑see Bezuglov, N. N.͒ E 55, 3333 — Dynamic response of an Ising system to a pulsed field. E 55, 2392 Allen, Christopher K. and Martin Reiser — Bunched beam envelope Ackerson, Bruce J. — ͑see Paulin, S. E.͒ E 55, 5812 equations including image effects from a cylindrical pipe.
    [Show full text]
  • PERIODIC ORBITS of PIECEWISE MONOTONE MAPS a Dissertation
    PERIODIC ORBITS OF PIECEWISE MONOTONE MAPS A Dissertation Submitted to the Faculty of Purdue University by David Cosper In Partial Fulfillment of the Requirements for the Degree of Doctor of Philosophy May 2018 Purdue University Indianapolis, Indiana ii ACKNOWLEDGMENTS I would like to thank my advisor Micha l Misiurewicz for sticking with me all these years. iii TABLE OF CONTENTS Page LIST OF FIGURES ::::::::::::::::::::::::::::::: iv ABSTRACT ::::::::::::::::::::::::::::::::::: v 1 INTRODUCTION :::::::::::::::::::::::::::::: 1 2 PRELIMINARIES :::::::::::::::::::::::::::::: 4 2.1 Kneading Theory :::::::::::::::::::::::::::: 4 2.2 Sharkovsky's Theorem ::::::::::::::::::::::::: 12 2.3 Periodic Orbits of Interval Maps :::::::::::::::::::: 16 3 PERIODIC ORBITS OF PIECEWISE MONOTONE MAPS ::::::: 20 3.1 Horizontal/Vertical Families and Order Type ::::::::::::: 23 3.2 Extremal Points ::::::::::::::::::::::::::::: 35 3.3 Characterizing P :::::::::::::::::::::::::::: 46 4 MATCHING :::::::::::::::::::::::::::::::::: 55 4.1 Matching :::::::::::::::::::::::::::::::: 58 4.2 Topological entropy ::::::::::::::::::::::::::: 62 4.3 Transitivity ::::::::::::::::::::::::::::::: 64 4.4 Beyond transitivity ::::::::::::::::::::::::::: 67 LIST OF REFERENCES :::::::::::::::::::::::::::: 71 VITA ::::::::::::::::::::::::::::::::::::::: 73 iv LIST OF FIGURES Figure Page 1.1 An example of a two-sided truncated tent map. ::::::::::::: 2 2.1 This truncated tent map cannot have the min-max periodic orbit (RLR)1, and hence does not have a period 3 periodic point. ::::::::::: 15 2.2 The period 6 orbit with itinerary [R ∗ (RLR)]1. Notice that the first return map on the blue interval is f 2 and that the three points form a periodic orbit under f 2. :::::::::::::::::::::::::: 19 3.1 This truncated tent map cannot have the orbit (RLR)1. However, it does have the orbit (RLL)1. :::::::::::::::::::::::::: 21 3.2 This truncated tent map cannot have the orbit (RL)1.
    [Show full text]