DOCSLIB.ORG

Lecture 9: Attractor and Strange Attractor, Chaos, Analysis of Lorenz

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Lecture 9: Attractor and Strange Attractor, Chaos, Analysis of Lorenz Lecture notes #9 Nonlinear Dynamics YFX1520 Lecture 9: Attractor and strange attractor, chaos, analysis of Lorenz attractor, transient and intermit- tent chaos, Lyapunov exponents, Kolmogorov entropy, predictability horizon, examples of chaos, cobweb dia- gram and recurrence map or recurrence relation (1-D map) Contents 1 Lorenz attractor 2 2 Exponential divergence of neighbouring trajectories 3 2.1 Lyapunov exponents . .3 2.2 Kolmogorov entropy . .4 2.3 Predictability horizon . .4 3 Conceptual definition of chaos and strange attractor 6 3.1 Identifying attractors . .7 3.2 Examples of strange attractors . .8 3.3 Examples of chaotic systems . .9 4 Introduction to 1-D maps (short) 12 5 Dynamics of the Lorenz attractor in chaotic regime 13 Material teaching aid: Double pendulum, Möbius strip D. Kartofelev 1/16 K As of March 8, 2021 Lecture notes #9 Nonlinear Dynamics YFX1520 1 Lorenz attractor The Lorenz system was presented in the previous lecture. The following slides present an overview of selected properties of the system. The bifurcation analysis is shown for varied r while keeping the other parameters constant. Slides: 3–8 Lorenz attractor Properties of Lorenz attractor Lorenz attractor has the form There exists a symmetric pair of solutions. If (x, y) ( x, y) x˙ = d (y x), → − − − the system stays the same. If solution (x(t), y(t), z(t)) exists y˙ = rx y xz, (1) − − then solution ( x(t), y(t), z(t)) is also a solution. z˙ = xy bz, − − − Lorenz system is dissipative1: volumes in phase space contract where r, d, and b are the parameters. For r = 28, d = 10, and under the flow. As t , V 0 b = 8/3, the Lorenz system has the chaotic solution. Other → ∞ → ~x˙ = (d + 1 + b) < 0 = const., (2) parameter values may generate other types of solutions. ∇ · − V˙ = (d + 1 + b) V. (3) Lorenz equations also arise in simplified models for lasers, dynamos, − thermosyphons, brushless DC motors, electric circuits, chemical reactions and forward osmosis. 1See Mathematica .nb file uploaded to the course webpage. D. Kartofelev YFX1520 3 / 40 D. Kartofelev YFX1520 4 / 40 Bifurcation analysis of Lorenz attractor Bifurcation analysis of Lorenz attractor For r < 1 (d = 10, b = 8/3) there is only one stable fixed point located at the origin. This point corresponds to no convection. All orbits converge to the origin – a global attractor. As we decrease r from rHopf, the unstable limit cycles expand and A supercritical pitchfork bifurcation occurs at r = 1, and for pass precariously close to the saddle point at the origin. At r > 1 two additional fixed points appear at r = 13.926 the cycles touch the saddle point and become homoclinic orbits; hence we have a homoclinic bifurcation which (x∗, y∗, z∗) = C± = β(r 1), β(r 1), r 1 . (4) ± − ± − − is referred to as the first homoclinic explosion. Below r = 13.926 p p there are no limit cycles. These correspond to steady convection. Fixed points are stable only if The region 13.926 < r < 24.06 is referred to as transient chaos2 d + b + 3 + r < rHopf, rHopf = d = 24.74, (5) region. Here, the chaotic trajectories eventually settle at C or C . d b 1 − − − which can hold only for positive r and d > b + 1. At a critical value r = rHopf, both stable fixed points lose stability through a subcritical Hopf bifurcation. 2See Mathematica .nb file uploaded to the course webpage. D. Kartofelev YFX1520 5 / 40 D. Kartofelev YFX1520 6 / 40 Bifurcation analysis of Lorenz attractor Bifurcation analysis of Lorenz attractor For r > 24.06 and r > rHopf = 28 (immediate vicinity): no stable limit-cycles exist; trajectories do not escape to infinity (dissipation); do not approach an invariant torus (quasi-periodicity). Almost all initial conditions (I.C.s) will tend to an invariant set – the Lorenz attractor – a strange attractor and a fractal. Note: No quasi-periodic solutions for r > rHopf are possible because of the dissipative property of the flow. For r rHopf different types of chaotic dynamics exist e.g. noisy periodicity, transient and intermittent chaos. One can even find transient chaos settling to periodic orbits3. 3See Mathematica .nb file uploaded to the course webpage. D. Kartofelev YFX1520 7 / 40 D. Kartofelev YFX1520 8 / 40 Slide 7 shows the behaviour for small values of r while keeping other parameters constant where x∗ is the distance from the origin. The origin is globally stable node for r < 1. At r = 1 the origin loses stability by a supercritical pitchfork bifurcation, and a symmetric pair of attracting fixed points (stable spirals) is born, in the above schematic, only one of the pair is shown. At rHopf = 24:74 the fixed points lose stability by absorbing an unstable limit-cycle in a subcritical Hopf bifurcation. D. Kartofelev 2/16 K As of March 8, 2021 Lecture notes #9 Nonlinear Dynamics YFX1520 As we decrease r from rHopf, the unstable limit-cycles expand and pass precariously close to the sad- dle point at the origin. At r = 13:926 the cycles touch the saddle point and become homoclinic orbits; hence we have a homoclinic bifurcation of unstable limit-cycles. Below r = 13:926 there are no limit-cycles. Viewed in the other direction, we could say that a pair of unstable limit-cycles are created as r increases through r = 13:926. Numerics: nb#1 Dissipative chaotic flow (Lorenz attractor) visualisation via particle tracking. Calculation of divergence of 3-D and higher dimensional flows. Examples of transient, intermittent and periodic dynamics in Lorenz system for r rHopf (d = 10, b = 8=3) are shown in Sec. 3 where these phenomena are defined and in numerical files nb#3. 2 Exponential divergence of neighbouring trajectories 2.1 Lyapunov exponents From numerical integration of the Lorenz system we know that the motion/flow on the attractor exhibits sensitive dependence on initial conditions. This means that two trajectories starting very close to each other will rapidly diverge, and thereafter have totally different futures, see Fig. 1. xTtI j.gg in o Figure 1: Rapidly diverging trajectories where the initial separation ~δ0 = δ0 0. en181 j j ≈ It can be demonstrated that after then.EE.ietransient behaviour has elapsed and a trajectory has settled on the attracting set (Lorenz attractor) the norm (magnitude) of the separation vector F xTtI ~ λt f δ(t) δ0e ; (1) j j ∼ where in the case of Lorenz system λ 0:9. Hence,t neighbouring trajectoriesin diverge exponentially fast. ≈ j.gg Equivalently, if we plot ln ~δ vs. t, a logarithmic plot, we find a curve that is close to a straight line with a j j o positive slope of λ, see Fig. 2. sa en181 to n.EE.ie f F et t Figure 2: Norm of separation vector ~δ as a function of t. Slope λ is shown with the straight red line. j j The exponential divergence mustU stop when the separation is comparable to the diametersa of the attractor (attracting set, think Lorenz butterfly)to — the trajectories obviously can’t get any farther apart than that. This explains the levelling off or saturation of the curve ln ~δ(t) shown with the dashed line in Fig. 2. j j The exponent λ is often called the Lyapunov exponent, although this is a sloppy use of the term, for two reasons: • First, there are actually n different Lyapunov exponentset for each degree of freedom of an n-dimensional system (λx, λy, λz;:::). D. KartofelevU 3/16 K As of March 8, 2021 Lecture notes #9 Nonlinear Dynamics YFX1520 • Second, λ depends slightly on which trajectory we study. We should average over many trajectories (initial conditions) and over many different points on the same trajectory to get the true value of λ. Lyapunov exponent λ of a system is usually close to the biggest of the exponents related to the degrees of freedom (λx, λy, λz;:::). The biggest exponent governs the resulting slope shown in Figs. 2 and 3. Note: λ > 0 is a signature of chaos. Numerics: nb#2 Lyapunov exponent of 3-D chaotic systems (visual demonstration). Plotted below is the quantitatively accurate ln ~δ vs. t graphs shown in Fig. 2 for the Lorenz attractor j j with the same parameters as used in Sec. 1. 5 0 )| t ( 5 δ - | ln -10 -15 0 10 20 30 40 t Figure 3: Exponential divergence of trajectories in the Lorenz system shown with the blue graph. ln(δ eλt) λ = 0:9 Graph of 0 where the Lyapunov exponent is indicated with the red line. 2.2 Kolmogorov entropy Also known as the metric entropy, Kolmogorov-Sinai entropy, or KS entropy.xTtI The Kolmogorov entropy is zero for non-chaotic motion and positive for chaotic motion. For λi > 0 one can find the Kolmogorov entropy using the following formula: j.gg in K = λi; o (2) Xi where i spans the number of degrees of freedom of a given chaotic system. Kolmogorov entropy is a measure of the growth of uncertaintyen due181 to the expansion rate given by the positive Lyapunov exponents λi. n.EE.ie 2.3 Predictability horizon F The predictability horizon is also calledf Lyapunov time. When a system has a positive Lyapunov exponent λ, there is a time horizon beyond which prediction breaks downt , as shown schematically in Fig. 4. sa to Figure 4: Deviation of two trajectories with close-by initial conditions, where a is the allowed tolerance representing noticeable deviation from the true trajectory. After a time period t the discrepancy, shown in Fig.et 4, grows to ~δ(t) = δ(t) δ eλt: (3) j j ≈ 0 Let a be a measure of our tolerance, i.e.,U if prediction is within a of the true/nominal state, we consider it acceptable.
Load more

Recommended publications
  • Triangular Numbers /, 3,6, 10, 15, ", Tn,'" »*"
    TRIANGULAR NUMBERS V.E. HOGGATT, JR., and IVIARJORIE BICKWELL San Jose State University, San Jose, California 9111112 1. INTRODUCTION To Fibonacci is attributed the arithmetic triangle of odd numbers, in which the nth row has n entries, the cen- ter element is n* for even /?, and the row sum is n3. (See Stanley Bezuszka [11].) FIBONACCI'S TRIANGLE SUMS / 1 =:1 3 3 5 8 = 2s 7 9 11 27 = 33 13 15 17 19 64 = 4$ 21 23 25 27 29 125 = 5s We wish to derive some results here concerning the triangular numbers /, 3,6, 10, 15, ", Tn,'" »*". If one o b - serves how they are defined geometrically, 1 3 6 10 • - one easily sees that (1.1) Tn - 1+2+3 + .- +n = n(n±M and (1.2) • Tn+1 = Tn+(n+1) . By noticing that two adjacent arrays form a square, such as 3 + 6 = 9 '.'.?. we are led to 2 (1.3) n = Tn + Tn„7 , which can be verified using (1.1). This also provides an identity for triangular numbers in terms of subscripts which are also triangular numbers, T =T + T (1-4) n Tn Tn-1 • Since every odd number is the difference of two consecutive squares, it is informative to rewrite Fibonacci's tri- angle of odd numbers: 221 222 TRIANGULAR NUMBERS [OCT. FIBONACCI'S TRIANGLE SUMS f^-O2) Tf-T* (2* -I2) (32-22) Ti-Tf (42-32) (52-42) (62-52) Ti-Tl•2 (72-62) (82-72) (9*-82) (Kp-92) Tl-Tl Upon comparing with the first array, it would appear that the difference of the squares of two consecutive tri- angular numbers is a perfect cube.
    [Show full text]
  • THE LORENZ SYSTEM Math118, O. Knill GLOBAL EXISTENCE
    THE LORENZ SYSTEM Math118, O. Knill GLOBAL EXISTENCE. Remember that nonlinear differential equations do not necessarily have global solutions like d=dtx(t) = x2(t). If solutions do not exist for all times, there is a finite τ such that x(t) for t τ. j j ! 1 ! ABSTRACT. In this lecture, we have a closer look at the Lorenz system. LEMMA. The Lorenz system has a solution x(t) for all times. THE LORENZ SYSTEM. The differential equations Since we have a trapping region, the Lorenz differential equation exist for all times t > 0. If we run time _ 2 2 2 ct x_ = σ(y x) backwards, we have V = 2σ(rx + y + bz 2brz) cV for some constant c. Therefore V (t) V (0)e . − − ≤ ≤ y_ = rx y xz − − THE ATTRACTING SET. The set K = t> Tt(E) is invariant under the differential equation. It has zero z_ = xy bz : T 0 − volume and is called the attracting set of the Lorenz equations. It contains the unstable manifold of O. are called the Lorenz system. There are three parameters. For σ = 10; r = 28; b = 8=3, Lorenz discovered in 1963 an interesting long time behavior and an EQUILIBRIUM POINTS. Besides the origin O = (0; 0; 0, we have two other aperiodic "attractor". The picture to the right shows a numerical integration equilibrium points. C = ( b(r 1); b(r 1); r 1). For r < 1, all p − p − − of an orbit for t [0; 40]. solutions are attracted to the origin. At r = 1, the two equilibrium points 2 appear with a period doubling bifurcation.
    [Show full text]
  • Physics 403, Spring 2011 Problem Set 2 Due Thursday, February 17
    Physics 403, Spring 2011 Problem Set 2 due Thursday, February 17 1. A Differential Equation for the Legendre Polynomials (15 pts): In this prob- lem, we will derive a second order linear differential equation satisfied by the Legendre polynomials (−1)n dn P (x) = [(1 − x2)n] : n 2nn! dxn (a) Show that Z 1 2 0 0 Pm(x)[(1 − x )Pn(x)] dx = 0 for m 6= n : (1) −1 Conclude that 2 0 0 [(1 − x )Pn(x)] = λnPn(x) 0 for λn a constant. [ Prime here and in the following questions denotes d=dx.] (b) Perform the integral (1) for m = n to find a relation for λn in terms of the leading n coefficient of the Legendre polynomial Pn(x) = knx + :::. What is kn? 2. A Generating Function for the Legendre Polynomials (20 pts): In this problem, we will derive a generating function for the Legendre polynomials. (a) Verify that the Legendre polynomials satisfy the recurrence relation 0 0 0 Pn − 2xPn−1 + Pn−2 − Pn−1 = 0 : (b) Consider the generating function 1 X n g(x; t) = t Pn(x) : n=0 Use the recurrence relation above to show that the generating function satisfies the first order differential equation d (1 − 2xt + t2) g(x; t) = tg(x; t) : dx Determine the constant of integration by using the fact that Pn(1) = 1. (c) Use the generating function to express the potential for a point particle q jr − r0j in terms of Legendre polynomials. 1 3. The Dirac delta function (15 pts): Dirac delta functions are useful mathematical tools in quantum mechanics.
    [Show full text]
  • Polynomial Sequences Generated by Linear Recurrences
    Innocent Ndikubwayo Polynomial Sequences Generated by Linear Recurrences: Location and Reality of Zeros Polynomial Sequences Generated by Linear Recurrences: Location and Reality of Zeros Linear Recurrences: Location by Sequences Generated Polynomial Innocent Ndikubwayo ISBN 978-91-7911-462-6 Department of Mathematics Doctoral Thesis in Mathematics at Stockholm University, Sweden 2021 Polynomial Sequences Generated by Linear Recurrences: Location and Reality of Zeros Innocent Ndikubwayo Academic dissertation for the Degree of Doctor of Philosophy in Mathematics at Stockholm University to be publicly defended on Friday 14 May 2021 at 15.00 in sal 14 (Gradängsalen), hus 5, Kräftriket, Roslagsvägen 101 and online via Zoom, public link is available at the department website. Abstract In this thesis, we study the problem of location of the zeros of individual polynomials in sequences of polynomials generated by linear recurrence relations. In paper I, we establish the necessary and sufficient conditions that guarantee hyperbolicity of all the polynomials generated by a three-term recurrence of length 2, whose coefficients are arbitrary real polynomials. These zeros are dense on the real intervals of an explicitly defined real semialgebraic curve. Paper II extends Paper I to three-term recurrences of length greater than 2. We prove that there always exist non- hyperbolic polynomial(s) in the generated sequence. We further show that with at most finitely many known exceptions, all the zeros of all the polynomials generated by the recurrence lie and are dense on an explicitly defined real semialgebraic curve which consists of real intervals and non-real segments. The boundary points of this curve form a subset of zero locus of the discriminant of the characteristic polynomial of the recurrence.
    [Show full text]
  • Linear Recurrence Relations: the Theory Behind Them
    Linear Recurrence Relations: The Theory Behind Them David Soukup October 29, 2019 Linear Recurrence Relations Contents 1 Foreword ii 2 The matrix diagonalization method 1 3 Generating functions 3 4 Analogies to ODEs 6 5 Exercises 8 6 References 10 i Linear Recurrence Relations 1 Foreword This guide is intended mostly for students in Math 61 who are looking for a more theoretical background to the solving of linear recurrence relations. A typical problem encountered is the following: suppose we have a sequence defined by an = 2an−1 + 3an−2 where a0 = 0; a1 = 8: Certainly this recurrence defines the sequence fang unambiguously (at least for positive integers n), and we can compute the first several terms without much problem: a0 = 0 a1 = 8 a2 = 2 · a1 + 3 · a0 = 2 · 8 + 3 · 0 = 16 a3 = 2 · a2 + 3 · a1 = 2 · 16 + 3 · 8 = 56 a4 = 2 · a3 + 3 · a2 = 2 · 56 + 3 · 16 = 160 . While this does allow us to compute the value of an for small n, this is unsatisfying for several reasons. For one, computing the value of a100 by this method would be time-consuming. If we solely use the recurrence, we would have to find the previous 99 values of the sequence first. Moreover, until we compute it we have no good idea of how large a100 will be. We can observe from the table above that an grows quite rapidly as n increases, but we do not know how to extrapolate this rate of growth to all n. Most importantly, we would like to know the order of growth of this function.
    [Show full text]
  • Tom W B Kibble Frank H Ber
    Classical Mechanics 5th Edition Classical Mechanics 5th Edition Tom W.B. Kibble Frank H. Berkshire Imperial College London Imperial College Press ICP Published by Imperial College Press 57 Shelton Street Covent Garden London WC2H 9HE Distributed by World Scientific Publishing Co. Pte. Ltd. 5 Toh Tuck Link, Singapore 596224 USA office: Suite 202, 1060 Main Street, River Edge, NJ 07661 UK office: 57 Shelton Street, Covent Garden, London WC2H 9HE Library of Congress Cataloging-in-Publication Data Kibble, T. W. B. Classical mechanics / Tom W. B. Kibble, Frank H. Berkshire, -- 5th ed. p. cm. Includes bibliographical references and index. ISBN 1860944248 -- ISBN 1860944353 (pbk). 1. Mechanics, Analytic. I. Berkshire, F. H. (Frank H.). II. Title QA805 .K5 2004 531'.01'515--dc 22 2004044010 British Library Cataloguing-in-Publication Data A catalogue record for this book is available from the British Library. Copyright © 2004 by Imperial College Press All rights reserved. This book, or parts thereof, may not be reproduced in any form or by any means, electronic or mechanical, including photocopying, recording or any information storage and retrieval system now known or to be invented, without written permission from the Publisher. For photocopying of material in this volume, please pay a copying fee through the Copyright Clearance Center, Inc., 222 Rosewood Drive, Danvers, MA 01923, USA. In this case permission to photocopy is not required from the publisher. Printed in Singapore. To Anne and Rosie vi Preface This book, based on courses given to physics and applied mathematics stu- dents at Imperial College, deals with the mechanics of particles and rigid bodies.
    [Show full text]
  • Analysis of Non-Linear Recurrence Relations for the Recurrence Coefficients of Generalized Charlier Polynomials
    Journal of Nonlinear Mathematical Physics Volume 10, Supplement 2 (2003), 231–237 SIDE V Analysis of Non-Linear Recurrence Relations for the Recurrence Coefficients of Generalized Charlier Polynomials Walter VAN ASSCHE † and Mama FOUPOUAGNIGNI ‡ † Katholieke Universiteit Leuven, Department of Mathematics, Celestijnenlaan 200 B, B-3001 Leuven, Belgium E-mail: [email protected] ‡ University of Yaounde, Advanced School of Education, Department of Mathematics, P.O. Box 47, Yaounde, Cameroon E-mail: [email protected] This paper is part of the Proceedings of SIDE V; Giens, June 21-26, 2002 Abstract The recurrence coefficients of generalized Charlier polynomials satisfy a system of non- linear recurrence relations. We simplify the recurrence relations, show that they are related to certain discrete Painlev´e equations, and analyze the asymptotic behaviour. 1 Introduction Orthogonal polynomials on the real line always satisfy a three-term recurrence relation. For monic polynomials Pn this is of the form Pn+1(x)=(x − βn)Pn(x) − γnPn−1(x), (1.1) with initial values P0 = 1 and P−1 = 0. For the orthonormal polynomials pn the recurrence relation is xpn(x)=an+1pn+1(x)+bnpn(x)+anpn−1(x), (1.2) 2 where an = γn and bn = βn. The recurrence coefficients are given by the integrals 2 an = xpn(x)pn−1(x) dµ(x),bn = xpn(x) dµ(x) and can also be expressed in terms of determinants containing the moments of the orthog- onality measure µ [11]. For classical orthogonal polynomials one knows these recurrence coefficients explicitly, but when one uses non-classical weights, then often one does not Copyright c 2003 by W Van Assche and M Foupouagnigni 232 W Van Assche and M Foupouagnigni know the recurrence coefficients explicitly.
    [Show full text]
  • Series Solutions of Ordinary Differential Equations
    Series Solutions of Homogeneous, Linear, 2nd Order ODE “Standard form” of a homogeneous, linear, 2nd order ODE: y′′ + p( z) y′ + q( z) y = 0 The first step is always to put the given equation into this “standard form.” Then the technique for obtaining two independent solutions depends on the existence and nature of any singularities of the ODE at the point z = z0 about which the series is to be expanded. By a change of variable, the ODE can always be written so that z0 = 0 and this is assumed below. Case I: z = 0 is an ordinary point: (1) Assume a power series solution about z = 0: ∞ n y() z= ∑ an z . Eq. (1) n=0 (2) Substitute Eq. (1) and its derivatives into the ODE and require that the coefficients of each power of z sum to zero to get a recurrence relation. The recurrence relation expresses a coefficient an in terms of the coefficients ar where r ≤ n − 1. (3) Sometimes the recurrence relation will have two solutions which can be used to construct series for two independent solutions to the ODE, y1(z) and y2(z). Other times, independent solutions can be obtained by choosing differing starting points for the series, e.g. a0 = 1, a1 =0 or a0 = 0, a1 = 1. A systematic approach is to assume Frobenius power series solutions ∞ σ n y() z= z∑ an z Eq. (2) n=0 with σ = 0 and σ = 1 instead of using only Eq. (1). (4) Try to relate the power series to the closed form of an elementary function (not always possible).
    [Show full text]
  • Symmetric Encryption Algorithms Using Chaotic and Non-Chaotic Generators: a Review
    Journal of Advanced Research (2016) 7, 193–208 Cairo University Journal of Advanced Research REVIEW Symmetric encryption algorithms using chaotic and non-chaotic generators: A review Ahmed G. Radwan a,b,*, Sherif H. AbdElHaleem a, Salwa K. Abd-El-Hafiz a a Engineering Mathematics Department, Faculty of Engineering, Cairo University, Giza 12613, Egypt b Nanoelectronics Integrated Systems Center (NISC), Nile University, Cairo, Egypt GRAPHICAL ABSTRACT ARTICLE INFO ABSTRACT Article history: This paper summarizes the symmetric image encryption results of 27 different algorithms, which Received 27 May 2015 include substitution-only, permutation-only or both phases. The cores of these algorithms are Received in revised form 24 July 2015 based on several discrete chaotic maps (Arnold’s cat map and a combination of three general- Accepted 27 July 2015 ized maps), one continuous chaotic system (Lorenz) and two non-chaotic generators (fractals Available online 1 August 2015 and chess-based algorithms). Each algorithm has been analyzed by the correlation coefficients * Corresponding author. Tel.: +20 1224647440; fax: +20 235723486. E-mail address: [email protected] (A.G. Radwan). Peer review under responsibility of Cairo University. Production and hosting by Elsevier http://dx.doi.org/10.1016/j.jare.2015.07.002 2090-1232 ª 2015 Production and hosting by Elsevier B.V. on behalf of Cairo University. 194 A.G. Radwan et al. between pixels (horizontal, vertical and diagonal), differential attack measures, Mean Square Keywords: Error (MSE), entropy, sensitivity analyses and the 15 standard tests of the National Institute Permutation matrix of Standards and Technology (NIST) SP-800-22 statistical suite. The analyzed algorithms Symmetric encryption include a set of new image encryption algorithms based on non-chaotic generators, either using Chess substitution only (using fractals) and permutation only (chess-based) or both.
    [Show full text]
  • Chapter 8 Nonlinear Systems
    Chapter 8 Nonlinear systems 8.1 Linearization, critical points, and equilibria Note: 1 lecture, §6.1–§6.2 in [EP], §9.2–§9.3 in [BD] Except for a few brief detours in chapter 1, we considered mostly linear equations. Linear equations suffice in many applications, but in reality most phenomena require nonlinear equations. Nonlinear equations, however, are notoriously more difficult to understand than linear ones, and many strange new phenomena appear when we allow our equations to be nonlinear. Not to worry, we did not waste all this time studying linear equations. Nonlinear equations can often be approximated by linear ones if we only need a solution “locally,” for example, only for a short period of time, or only for certain parameters. Understanding linear equations can also give us qualitative understanding about a more general nonlinear problem. The idea is similar to what you did in calculus in trying to approximate a function by a line with the right slope. In § 2.4 we looked at the pendulum of length L. The goal was to solve for the angle θ(t) as a function of the time t. The equation for the setup is the nonlinear equation L g θ�� + sinθ=0. θ L Instead of solving this equation, we solved the rather easier linear equation g θ�� + θ=0. L While the solution to the linear equation is not exactly what we were looking for, it is rather close to the original, as long as the angleθ is small and the time period involved is short. You might ask: Why don’t we just solve the nonlinear problem? Well, it might be very difficult, impractical, or impossible to solve analytically, depending on the equation in question.
    [Show full text]
  • Chaos: the Mathematics Behind the Butterfly Effect
    Chaos: The Mathematics Behind the Butterfly E↵ect James Manning Advisor: Jan Holly Colby College Mathematics Spring, 2017 1 1. Introduction A butterfly flaps its wings, and a hurricane hits somewhere many miles away. Can these two events possibly be related? This is an adage known to many but understood by few. That fact is based on the difficulty of the mathematics behind the adage. Now, it must be stated that, in fact, the flapping of a butterfly’s wings is not actually known to be the reason for any natural disasters, but the idea of it does get at the driving force of Chaos Theory. The common theme among the two is sensitive dependence on initial conditions. This is an idea that will be revisited later in the paper, because we must first cover the concepts necessary to frame chaos. This paper will explore one, two, and three dimensional systems, maps, bifurcations, limit cycles, attractors, and strange attractors before looking into the mechanics of chaos. Once chaos is introduced, we will look in depth at the Lorenz Equations. 2. One Dimensional Systems We begin our study by looking at nonlinear systems in one dimen- sion. One of the important features of these is the nonlinearity. Non- linearity in an equation evokes behavior that is not easily predicted due to the disproportionate nature of inputs and outputs. Also, the term “system”isoftenamisnomerbecauseitoftenevokestheideaof asystemofequations.Thiswillbethecaseaswemoveourfocuso↵ of one dimension, but for now we do not want to think of a system of equations. In this case, the type of system we want to consider is a first-order system of a single equation.
    [Show full text]
  • The Lorenz System
    The Lorenz system James Hateley Contents 1 Formulation 2 2 Fixed points 4 3 Attractors 4 4 Phase analysis 5 4.1 Local Stability at The Origin....................................5 4.2 Global Stability............................................6 4.2.1 0 < ρ < 1...........................................6 4.2.2 1 < ρ < ρh ..........................................6 4.3 Bifurcations..............................................6 4.3.1 Supercritical pitchfork bifurcation: ρ = 1.........................7 4.3.2 Subcritical Hopf-Bifurcation: ρ = ρh ............................8 4.4 Strange Attracting Sets.......................................8 4.4.1 Homoclinic Orbits......................................9 4.4.2 Poincar´eMap.........................................9 4.4.3 Dynamics at ρ∗ ........................................9 4.4.4 Asymptotic Behavior..................................... 10 4.4.5 A Few Remarks........................................ 10 5 Numerical Simulations and Figures 10 5.1 Globally stable , 0 < ρ < 1...................................... 10 5.2 Pitchfork Bifurcation, ρ = 1..................................... 12 5.3 Homoclinic orbit........................................... 12 5.4 Transient Chaos........................................... 12 5.5 Chaos................................................. 14 5.5.1 A plot for ρh ......................................... 14 5.6 Other Notable Orbits........................................ 16 5.6.1 Double Periodic Orbits................................... 16 5.6.2 Intermittent
    [Show full text]