CHAPTER 2 FEIGENBAUM UNIVERSALITY IN 1-DIMENSIONAL NONLINEAR ALGEBRAIC MAPS

Size: px
Start display at page:

Download "CHAPTER 2 FEIGENBAUM UNIVERSALITY IN 1-DIMENSIONAL NONLINEAR ALGEBRAIC MAPS"

Transcription

1 CHAPTER 2 FEIGENBAUM UNIVERSALITY IN 1-DIMENSIONAL NONLINEAR ALGEBRAIC MAPS The chief aim of this chapter is to discuss the dynamical behaviour of some 1-dimensional discrete maps. In this chapter, we have taken the help of appropriate numerical methods to find out the fixed and periodic points of different periods 2 0, 2 1, 2 2, 2 3 and to find the bifurcation points by using our knowledge of numerical analysis ( Newton-Raphson method, Bisection method etc.) and using C-programming and computer software Mathematica. This chapter is divided into two sections. In section I, we have assumed a 1-dimensional nonlinear algebraic map. Here we discuss a detailed analysis of period- doubling bifurcations of the model, we study some associated universalities, particularly the route from order to chaos, as developed by Mitchell J. Feigenbaum, an American Physicist. M. Feigenbaum discussed the universal behaviors of 1-dimensional unimodel map of the form = ( ) We consider a 1-dimensional nonlinear algebraic mathematical model ()= ( 1 ) where [0,1] and (1,3] is an adjustable positive parameter. Chaos and order This chapter is based on our published papers Period- Doubling Scenario In a One Dimensional Non Linear Map Int. J. Math. Sci. & Engg. Appls. No. VI,Vol 6, pp: , And Some Aspects Of Dynamical Behavior In a One Dimensional Nonlinear Chaotic Map Int. J. of Statistica and Mathematica, Issue 3, Vol 4, pp: 61-64,

2 have long been viewed as antagonistic in the science. One of the great surprises revealed through the studies of the cubic iterator = ( 1 ), =0,1,2,3,4 is the discovery that there is a very well defined period-doubling route to chaos. Also we quantify chaos of this map by analysing Lyapunov exponent. In section II, we have considered another 1-dimensional nonlinear rational model of the form ()= ( ) with µ as control parameter and a,b are taken as constants. May and Oster[103] stated about the model, which was taken from biological literature[98,103,104,141,142]. Stone and Hart(1999)[141] showed effect of immigration by adding a constant c on the model. Here we first provide the Feigenbaum tree of bifurcation points along with one of the periodic points, which leads to chaos. Secondly, we determine the accumulation point and draw the bifurcation graph of the model and verify that chaos occur beyond accumulation point. Thirdly the graphs of the time series analysis are confirmed in order to support our periodic orbits of period 2 0, 2 1,2 2,2 3..and lastly the graph of Lyapunov exponent confirms about the existence of the chaotic region[10,24,25,36,42,71] Introduction: Robert May in 1976, in his famous papers [103, 104] showed how simple mathematical models exhibit very complicated dynamics. He talked about different dynamical features of logistic map, since then it has become a role model for showing of the existence of chaos and related properties in 1-dimensional systems. In 1975 the elementary particle theorist, Mitchell J. Feigenbaum exposed, in 1-dimensional iterations with the logistic map = ( 1 ), as one of the key members of its class which follows a universal route to chaos by means of period doubling bifurcation [52, 53]. Period-doubling bifurcations, as a universal route to chaos, are one of the most exciting discoveries of the last few years in the field of nonlinear dynamical systems. This exciting discovery is that if a family f presents period doubling bifurcations then 22

3 there is an infinite sequence { } of bifurcation values such that lim "#$ % " "#& % "#$ =', where ' is a universal number which is known as Feigenbaum constant. In order to examine the dynamical behaviour of any system, it is necessary to determine its fixed points or periodic points of every order and to discuss their stability as the values of the controlling parameters are varied. It becomes a very tedious job and sometimes not possible to calculate analytically the fixed or periodic point of higher order due to the presence of some higher degree terms or non-algebraic terms in the equation of the dynamical systems. In such cases, we numerical techniques to determine them. require to take up some SECTION I In this section we consider the 1-dimensional nonlinear algebraic map as ()= ( 1 ) where is a control parameter The Range of the Control Parameter: Let ()= ( 1 ) ( ()= (1 )+ ( 2 ) 3 = 3 (1+ ) ( ()=0 =±, () (( ()= 6 (1+ ) Clearly (( ()<0 at x=+, () and (( ()>0 at x=, () So () is minimum at x=, () and this minimum value is µ, µ µ 23

4 Since population cannot be negative so we discard x=, () Also () is maximum at x=+, () and this maximum value is µ, µ µ Now if we consider =3 then we see that () is maximum at x=, and this maximum value of () is equal to 1. Hence the range may be taken as [ 0,1 ]. We consider the range of the parameter as (1, 3]. Hence the parameter must lie between 1 and upto 3 to have valid population Stability Analysis and Bifurcation Points: The equilibrium points or fixed points for the map are the solution of the equation ()=. So the fixed points for our concerned map is the solution of Solving this we get ( 1 ) = = 9% 9%%, =0, = 9% 9%%. Only last two points are of our interest. Now to examine the stability of these points, we used the stability criterion for a 1-dimensional map which says that the fixed point of the map () will be stable as long as ( () < <1 and unstable if ( () < >1. Bifurcation occurs when ( () < =1 which means that the qualitative behaviour of the fixed point changes from stable to unstable one. For our concerned map ( ()= 3 (1+ ). Now the derivative at =0 is ( () <= =>1, so =0 is an unstable fixed point. ( () < $?@ =3 2. The absolute value remains less than 1 for 1<<2 so?$?@ = 9% 9%% is a stable point for 1<<2 and when >2 this fixed point becomes unstable. Therefore is =2 is the first bifurcation point of our model. 24

5 f x x f x, x Fig 2.02a: The function (,) plotted as a function of for various values of the parameter. The diagonal line is a plot of ()=. The following command of Mathematica gives the fixed points at the intersection of ()= and our model. [ % ]=( 1 ) /. 2.0; CDEF [G,[]},G,0,1},HIJKLMID G"x", "f(x)"}] 25

6 f x x 2 x x Fig 2.02b: Graphs of()= (1 ) and ()= at the parameter =2. Their intersection points give the fixed points of. Now we see at =2, both the fixed points are unstable. So for further discussion on the long term behaviour of the map, we have to shift our interest to the higher order iterations of the map i.e. corresponding periodic points and their nature of stability. Next we consider the iterated map f 2 (x). The fixed points of f 2 are given by the solution of the equation ()= ( P ) Q ( P ) S +( P ) T (+ + + P ) + =0 This is 9th degree equation, so gives nine (9) roots. Out of these roots only five roots are non-negative real roots. From these, three roots(x=0, x=1, U= 9V%W ) are unstable, 9%V%W and other two roots are =, % 9& %P and =, 9& %P.Also we see X Y () X =9 2 Y <Z 9& %P 26

7 and X Y () X =9 2 Y <Z % 9& %P From the of above results it is clear that the nature of stability of the fixed points =, % 9& %P and =, 9& %P of the second iterator map () which are also the periodic points of period 2 of the map () are same. They are stable within the range 2<< Now as soon as cross the value , the above two periodic points become unstable. Thus the second bifurcation point for our map is = f x x.. Fig 2.02c: Graphs of () and ()= at the parameter = Their intersection gives five fixed points of. 27

8 f x x Fig 2.02d: Graphs of () and ()= at the parameter = Their intersection gives five fixed points of, where x varies from -1 to 1 Now we try to find out third bifurcation point. For this we solve the equation P ()=, which is an 81 th degree equation in x. To solve this equation analytically is cumbersome one. So we use Newton-Raphson method and bisection method respectively. We build up suitable numerical method and C-programming and obtain following bifurcation points of different period, one of the periodic point and Feigenbaum delta(experimental value). We see that the periodic point is = and the corresponding bifurcation point is =

9 f x x Fig 2.02e: Graphs of intersection gives the fixed points of P P () and ()= at the parameter = Their 2.03 Numerical Algorithm to Find Periodic Points, Derivatives of Different Iterates of Our Map and the Bifurcation Points: To find a fixed point or a periodic point of our model, we apply Newton-Recurrence formula: = ^( ") [ `^( ")], where n=1, 2, 3, 4 The Newton formula [118] actually gives the zero (es) of a map, and to apply this numerical tools, one needs a number of recurrence formulae which are given below: Let the initial value of x be x 0. Then ( = )= = (1 = ) = = (Say) ( = )=( )= (1 ) = (Say) Proceeding in this manner, the following recurrence formula can be established: 29

10 = % (1 % ) %, n=1, 2, 3, 4. (ii)again the derivative of f k can be obtained as follows a Y Y a < b = 3 = (1 )+ Again by chain rule of differentiation we get c de& d c < b =c de d c e( b ) cde d c < b =( 3 (1 )+)( 3 = (1 )+) where x 1 =f(x 0 ). Proceeding in this way we can obtain c def c =( 3 d g% (1 )+).. ( 3 = (1 )+) < b We remind that the value of µ will be the bifurcation value for the map g when its derivative def d at a periodic point is equal to 1. Now a table of the bifurcation points, and one of the fixed points (periodic points) at the corresponding bifurcation point and experimental Feigenbaum delta value is given below[71]. Table: 2.03a (Numerical calculation of bifurcation point) Bifurcation Point One of the periodic points Feigenbaum delta (experimental value) = = ' = = δ 1 = P = δ 2 = T = δ 3 = h = δ 4 = S = δ 5 =

11 i = δ 6 = Q = δ 7 = = = δ 8 = = δ 9 = = δ 10 = We can see from Table 2.03a that Feigenbaum delta converges to The following bifurcation diagram indicates the universal route to chaos for our model. x Figure 2.03b: Bifurcation diagram of ()= (1 ) 31

12 2.04 Schwarzian Derivative: The Schwarzian derivative of a function f(x) which is defined in the interval (a,b) having higher order derivatives is given by jk(())= e () e () () le m e () This derivative was first formulated by H.A. Schwarzian and has been used in the theory of differential equation. It has important application in study of bifurcation of periodic orbits, the Schwarzian derivative is used to study the limiting behavior of dynamical systems [73]. If f has a negative Schwarzian derivative on [0, 1], then it turns out that there must be a number c in (0,1) such that ( (n)=0,that is, f has a critical point. We say that f is S-Unimodal if it s Schwarzian derivative is negative [ 64, 78, 132]. A surprise hidden in the above formula is that the Schwarzian is actually not a function.informally speaking Schwarzian derivative is curvature[118]. A sufficient condition for a function from interval to interval to behave chaotically is that its Schwarzian derivative is negative [65]. Here after calculating (), (), ((( () we see jk(())= 36 ( 1+ ) 6 ( 1+) ( 3 (1+)) <0 Eo LDD 2.05 Accumulation Point [71]: As our model follows a period-doubling bifurcation and so we let {µ n } be the sequence of the bifurcation points. Using Feigenbaum δ, if we know the first(µ 1 )and second (µ 2 )bifurcation points then we can expect third bifurcation point (µ 3 ) as &% $ q + (i) (Of course occurrence of first two period-doubling does not give assurance that a third will occur, but if it does occur, then it can be predicted by above equation) Similarly P r% & q So (i) and (ii) implies +. (ii) 32

13 P ( )s 1 ' + 1 ' t+ Continuing this procedure to obtain µ 5, µ 6 and so on,we get more terms in the sum involving powers of ( )and clearly this sum is familiar with G.P. series. We can sum the series to obtain the following result [71]. ( "#$% " ) + q%, q However, this expression is exact when the bifurcation ratio ' = "#$% " "#& % "#$ is equal for all value of n. In fact {δ n } converges as, that is consider the sequence x, y,. = "#$% " q% uvw value of bifurcation points. Obviously, =. uvw ' ='. So, we +, where are the experimental Using the experimental bifurcation points the sequence of accumulation pointsx, yis calculated for some values of n, as given below µ, 1 = µ, 2 = µ, 3 = µ, 4 = µ, 5 = µ, 6 = µ, 7 = µ, 8 = µ, 9 = µ, 10 = µ, 11 = µ, 12= µ,13 = The above sequence converges to the value which is the required accumulation point. [36, 42] 33

14 2.06 Calculation of Lyapunov Exponent: A quantitative measure of the sensitive dependence to initial conditions is given by the Lyapunov exponents, which measures the exponential separation of nearby orbits. In simple terms, a positive Lyapunov exponent can be considered to be an indicator of chaos, whereas negative exponents are associated with regular behavior (periodic orbits)[29]. There is some standard procedure for obtaining the Lyapunov exponent and the procedure is as follows.we begin by considering an attractor point x 0 and calculate the Lyapunov exponent, which is the average of the sum of logarithm of the derivative of the function at the iteration points. With the help of a computer program we have followed the procedure to get the Lyapunov exponent. The formula may be summarized as follows[10,36,42]: Lyapunov exponent (µ) =lim z (log f/ (x 0 ) + log f / (x 1 ) + log f / (x 2 ) + log f / (x 3 ) + + log f / (x n ) ). We see several points (the 1 st at =2.0, 2 nd at = , 3 rd at = ) where Lyapunov exponent hits the horizontal line and then becomes negative. These are the period doubling bifurcation points. Lyapunov exponent at these points are zero (which is almost clear from figure). Interestingly the first chaotic region appears after the value Moreover, in the chaotic region, we see some portions of the graph below the horizontal line.they signify that within the chaotic region also, at certain values of the parameter, there are regular behaviours and after that again chaotic region starts. These are called the periodic windows in the chaotic region. 34

15 Lyapunov Exponent mu Fig 2.06a: Graph of Lyapunov exponent for parameter from 1.75 to 3.0 SECTION II In this section we have discussed a 1- dimensional nonlinear rational map of the form ()= ( ) where a, b are constants and µ is a control parameter Analytical Study to Determine First Two Bifurcation Points: Here the model to be discussed is ()= ( ). Solving ()=E, we get = $ ({%) $. At this point we have ()<0, so maximum value for f(x) is ({%)$? } for µ>0. We may take the range as[0, ({%)$? $ ecological models although the main interest is mathematical. } ][42] so as to keep it meaningful to The solution of ()= gives the fixed points of f(x). A fixed point x is said to be a (i) stable fixed point or attractor if ~ ()~<1 (ii) unstable fixed point or repeller if ~ ()~>1. Solving ()=, we get the fixed points as =0 and 35

16 $ = (%) Also at x = (%) $. Now at x=0,~ ()~=, so x=0 becomes an unstable point for >1., we get ()= (%{){ Now, ( ()= 1 implies (%{){ = 1 or = { {% and ()= µ & ƒ µ ( ) (( $#(ƒ ) ) ) Solving ()=, we get µ & ƒ µ ( ) (( $#(ƒ ) ) )=1 (*) Also de& d = 1 M (L) { (L) { } } axµ 1 Ms 1+(ax) }t axµ s 1+(ax) }t 1 => = 1 ( ) } (1+(L) { ) axµ ( 1+ s 1+(ax) }t ) Let l µ ( ) m} =p and let (L) { =F ( )=> & (ˆ)( ) =1 => =(1+F)(1+Š) ( )=> & ( {ˆ%ˆ%)( { % %) (ˆ) & ( ) & = 1 =>( MF F 1)( MŠ Š 1)+ =0 =>( MF F 1) M( 1 ) (1+F) (1+F) + =0 =>( MF F 1)(M M MF )+ (1+F)=0 which is quadratic in t, solving for t we have and F= 2 +M(M 2)( 1)+9M P 2(M 2)M +(2+(M 2)M) P 2M(M 1) F= 2 +M(M 2)( 1) 9M P 2(M 2)M +(2+(M 2)M) P 2M(M 1) 36

17 Thus for the particular value of, where the second bifurcation occurs the periodic points are of the form = 1 L {G 2 +M(M 2)( 1)+9M P 2(M 2)M +(2+(M 2)M) P 2M(M 1) } { Also when M =>F 1 Again from (*) we have µ & ( ) (( ƒ µ $#(ƒ ) ) )=1 => µ& ( Œ )( ( ($# ) ) =1 => µ & µ & ( (@&?$)µ µ & =1 =>1+( 1) %{ =1 => 1 = 1, this is an identity i.e. true for all for higher values of b. Analytical study of the map after this stage is cumbersome. So we consider a particular value of the parameters to study dynamical behaviour of the map. Let us assume a=,b =7, then at x = (%) $, ()= %hs Now for 1< µ <1.4, the absolute value of () remains less than 1 and the point is stable. As soon as µ>1.4 the point becomes unstable. Hence µ=1.4 is the 1 st bifurcation point of this model.. f x Fig2.07a: Inersection of the model and f(x)=x. x 37

18 We next consider the periodic points of period-two and higher.the period-2 points are found by solving the equation ()=,where ()= & x( ) ygs Ž $#(Ž `) t }. Now to solve this equation analytically is cumbersome one. So we use Newton-Raphson method and bisection method respectively. We build up suitable numerical method and obtain following bifurcation points of different period,one of the periodic point and Feigenbaum delta(experimental value). f x 4 f x x x Fig2.07b: Graphs of () and ()= Fig2.07c: Graphs of P () and ()= x st bifurcation point at Fig 2.07d: The period doubling bifurcation at =1.4 38

19 For numerical procedure first of all I(a,x i *,n) representing the nth derivative of the function f at each of the periodic points is calculated numerically and v< I(a,x,n) is calculated. Now the interval [a 0,a 1 ] is choosen in such a way that ( v< I(a =,x,n) + v< 1)( I(a,y,n)+1)<0, where x i * are the periodic points at the parameter a 0 and y i * are the periodic points at the parameter a 1 for i=1,2,3,n. Then ( v<i(a,z,n)+ 1) is calculated where z i, i=1,2, n are the periodic points at the parameter a= ( b $ ) and the bisection method process is repeated till the bifurcation point up to certain accuracy is achieved. above process. The following are some of the bifurcation points obtained with the help of the Table2.07e:( Calculation of bifucation point ) Bifurcation Point One of the periodic points = = Feigenbaum (experimental value) ' = delta = δ 1 = P = δ 2 = T = δ 3 = h = δ 4 = S = δ 5 = i = δ 6 = Q = δ 7 = = = δ 8 = = δ 9 = = δ 10 = = δ 11 = P = δ 12 =

20 From the above table we can establish the Feigenbaum ' up to Now the following bifurcation diagram indicates the universal route to chaos for our model [42]. attractar mu Fig2.07f:Bifurcation graph of the model.the abcissa represents the control parameter and ordinate represents the iterated points Accumulation Point: Using the experimental bifurcation points the sequence of accumulation pointsx, y is calculated with the help of the following formula[42].. = ' 1 + Table2.08a: Accumulation points for different values of n µ, 1 = µ, 2 = µ, 3 = µ, 4 = µ, 5 = µ, 6 = µ, 7 =

21 µ, 8 = µ, 9 = µ, 10 = µ, 11 = µ, 12 = µ, 13 = The above sequence converges to the value which is the required accumulation point[36] Time Series Analysis[42, 130]: The key theoretical tool used for quantifying chaotic behavior is the notion of a time-series of data for the system. By observing data over a period of time, one can easily understand what changes have taken place in the past. Such an analysis is extremely helpful in predicting the future dynamical behaviour[42,130]. We open our journey with a couple of very simple time series experiments. On the horizontal axis, the number of iterations ( time) is marked, while on the vertical axis the amplitudes (ranging from 1 to 3 ) are given for each iteration. Figure 2.09a shows the computed time series of x- values starting at x = 1.4 with the parameter value at µ = 1.35 (which is slightly smaller than ). The points are connected by line segments. Time series graph is non-sensitive, stable behaviour and leads to the same final state of a single fixed point. 3.0 Value of parameter 1.35, Showing Period 1 behavior 2.5 Iteratedvalues Number of iterations Fig 2.09a: Time series graph for period 1 41

22 Now, let us look at the second time series in fig 2.09b, which is based on the same formula and the same initial value of x with the parameter value µ = 1.5(which is slightly greater than ) We notice periodicity and oscillate between two fixed points with the same amplitude, and the cycle repeats. 3.0 Value of parameter 1.5,Showing Period 2 behavior 2.5 Iterated values Number of iterations Fig 2.09b: Time series graph for the period 2 The third time series in fig 2.09c, which is based on the same formula and the same initial value of x with the parameter value µ = We notice periodicity and oscillate between four fixed points with the same amplitude, and the cycle repeats. 3.0 Value of parameter 1.617, Showing Period 4 behavior 2.5 Iterated values Number of iterations Fig 2.09c: Time Series graph for the period 4. 42

23 The fourth time series in fig 2.09d, which is based on the same formula and the same initial value of x with the parameter value µ = We notice periodicity and oscillate between eight fixed points with the same amplitude, and the cycle repeats. 3.0 Value of parameter 1.64, Showing Period 8 behavior 2.5 Iterated values Number of iterations Fig 2.09d: Time series graph for the period 8 behaviour. But, if we start with the same initial value of x and the parameter value µ = 1.67, the picture shows an irregular pattern which is difficult to predict meaning thereby the appearance of the chaotic region, Fig 2.09e. Thus, the time series analysis also helps us for full description of bifurcations and chaos for the concerned model. 2.2 Value of parameter 1.67, Showing Period Chaotic behavior 2.0 Iteratedvalues Number of iterations Fig 2.09e: Time series graph for the Chaotic behaviour 43

24 2.10 Lyapunov Exponent: In order to verify how much accurate is the accumulation point, the Lyapunov exponent is calculated. Lyapunov exponent at the parameter greater than the accumulation point is found to be positive whereas Lyapunov exponent less than the accumulation point is negative and at the accumulation point it should be equal to zero. We begin by considering an attractor point x 0 and calculate the Lyapunov exponent, which is the average of the sum of logarithm of the derivative of the function at the iteration points. Now we draw the graph of Lyapunov exponent as follows Lyapunov exponent mu 1.5 Fig 2.10a: Lyapunov exponent of the map.negative values indicate periodic.almost zero values indicate bifurcation points and positive values indicate chaos. From graph of Lyapunov exponent,we see that some portion lie in the negative side of the parameter axis indicating regular behavior (periodic orbits) and the portion lie on the positive side of the parameter axis confirm us about the existence of chaos for our model [29]. 44

25 2.11 Results and discussion: In section I, we have seen that simple iterative unimodel mathematical model exhibit period-doubling route to chaos. Also we have seen that our model successfully converges to Feigenbaum universal constant (delta). From the bifurcation graph we can see that the chaotic region occurs beyond accumulation point as desired. We see from the graph how Lyapunov exponent changes its sign from negative to positive as the control parameter vary. This negative value indicates about regular behaviour of the periodic points and positive value gives the signal of chaos. In section II, All the features of section I, are also seen in this section. Moreover periodic orbits of period 2 0, 2 1, 2 2, are confirmed by drawing the graphs of the time series analysis. 45

Handling of Chaos in Two Dimensional Discrete Maps

Handling of Chaos in Two Dimensional Discrete Maps Handling of Chaos in Two Dimensional Discrete Maps Anil Kumar Jain Assistant Professor, Department of Mathematics Barama College, Barama, Assam, Pincode-781346, India (Email: jainanil965@gmail.com) Abstract:

More information

The Sine Map. Jory Griffin. May 1, 2013

The Sine Map. Jory Griffin. May 1, 2013 The Sine Map Jory Griffin May, 23 Introduction Unimodal maps on the unit interval are among the most studied dynamical systems. Perhaps the two most frequently mentioned are the logistic map and the tent

More information

LYAPUNOV EXPONENT AND DIMENSIONS OF THE ATTRACTOR FOR TWO DIMENSIONAL NEURAL MODEL

LYAPUNOV EXPONENT AND DIMENSIONS OF THE ATTRACTOR FOR TWO DIMENSIONAL NEURAL MODEL Volume 1, No. 7, July 2013 Journal of Global Research in Mathematical Archives RESEARCH PAPER Available online at http://www.jgrma.info LYAPUNOV EXPONENT AND DIMENSIONS OF THE ATTRACTOR FOR TWO DIMENSIONAL

More information

Bifurcations in the Quadratic Map

Bifurcations in the Quadratic Map Chapter 14 Bifurcations in the Quadratic Map We will approach the study of the universal period doubling route to chaos by first investigating the details of the quadratic map. This investigation suggests

More information

... it may happen that small differences in the initial conditions produce very great ones in the final phenomena. Henri Poincaré

... it may happen that small differences in the initial conditions produce very great ones in the final phenomena. Henri Poincaré Chapter 2 Dynamical Systems... it may happen that small differences in the initial conditions produce very great ones in the final phenomena. Henri Poincaré One of the exciting new fields to arise out

More information

Discrete Time Coupled Logistic Equations with Symmetric Dispersal

Discrete Time Coupled Logistic Equations with Symmetric Dispersal Discrete Time Coupled Logistic Equations with Symmetric Dispersal Tasia Raymer Department of Mathematics araymer@math.ucdavis.edu Abstract: A simple two patch logistic model with symmetric dispersal between

More information

Chaotic motion. Phys 750 Lecture 9

Chaotic motion. Phys 750 Lecture 9 Chaotic motion Phys 750 Lecture 9 Finite-difference equations Finite difference equation approximates a differential equation as an iterative map (x n+1,v n+1 )=M[(x n,v n )] Evolution from time t =0to

More information

COSMOS: Making Robots and Making Robots Intelligent Lecture 3: Introduction to discrete-time dynamics

COSMOS: Making Robots and Making Robots Intelligent Lecture 3: Introduction to discrete-time dynamics COSMOS: Making Robots and Making Robots Intelligent Lecture 3: Introduction to discrete-time dynamics Jorge Cortés and William B. Dunbar June 3, 25 Abstract In this and the coming lecture, we will introduce

More information

One dimensional Maps

One dimensional Maps Chapter 4 One dimensional Maps The ordinary differential equation studied in chapters 1-3 provide a close link to actual physical systems it is easy to believe these equations provide at least an approximate

More information

Chaos in the Dynamics of the Family of Mappings f c (x) = x 2 x + c

Chaos in the Dynamics of the Family of Mappings f c (x) = x 2 x + c IOSR Journal of Mathematics (IOSR-JM) e-issn: 78-578, p-issn: 319-765X. Volume 10, Issue 4 Ver. IV (Jul-Aug. 014), PP 108-116 Chaos in the Dynamics of the Family of Mappings f c (x) = x x + c Mr. Kulkarni

More information

MATH 415, WEEKS 14 & 15: 1 Recurrence Relations / Difference Equations

MATH 415, WEEKS 14 & 15: 1 Recurrence Relations / Difference Equations MATH 415, WEEKS 14 & 15: Recurrence Relations / Difference Equations 1 Recurrence Relations / Difference Equations In many applications, the systems are updated in discrete jumps rather than continuous

More information

Co-existence of Regular and Chaotic Motions in the Gaussian Map

Co-existence of Regular and Chaotic Motions in the Gaussian Map EJTP 3, No. 13 (2006) 29 40 Electronic Journal of Theoretical Physics Co-existence of Regular and Chaotic Motions in the Gaussian Map Vinod Patidar Department of Physics, Banasthali Vidyapith Deemed University,

More information

Chapter 4. Transition towards chaos. 4.1 One-dimensional maps

Chapter 4. Transition towards chaos. 4.1 One-dimensional maps Chapter 4 Transition towards chaos In this chapter we will study how successive bifurcations can lead to chaos when a parameter is tuned. It is not an extensive review : there exists a lot of different

More information

ONE DIMENSIONAL CHAOTIC DYNAMICAL SYSTEMS

ONE DIMENSIONAL CHAOTIC DYNAMICAL SYSTEMS Journal of Pure and Applied Mathematics: Advances and Applications Volume 0 Number 0 Pages 69-0 ONE DIMENSIONAL CHAOTIC DYNAMICAL SYSTEMS HENA RANI BISWAS Department of Mathematics University of Barisal

More information

Chaos Theory. Namit Anand Y Integrated M.Sc.( ) Under the guidance of. Prof. S.C. Phatak. Center for Excellence in Basic Sciences

Chaos Theory. Namit Anand Y Integrated M.Sc.( ) Under the guidance of. Prof. S.C. Phatak. Center for Excellence in Basic Sciences Chaos Theory Namit Anand Y1111033 Integrated M.Sc.(2011-2016) Under the guidance of Prof. S.C. Phatak Center for Excellence in Basic Sciences University of Mumbai 1 Contents 1 Abstract 3 1.1 Basic Definitions

More information

Unit Ten Summary Introduction to Dynamical Systems and Chaos

Unit Ten Summary Introduction to Dynamical Systems and Chaos Unit Ten Summary Introduction to Dynamical Systems Dynamical Systems A dynamical system is a system that evolves in time according to a well-defined, unchanging rule. The study of dynamical systems is

More information

v n+1 = v T + (v 0 - v T )exp(-[n +1]/ N )

v n+1 = v T + (v 0 - v T )exp(-[n +1]/ N ) Notes on Dynamical Systems (continued) 2. Maps The surprisingly complicated behavior of the physical pendulum, and many other physical systems as well, can be more readily understood by examining their

More information

Chapitre 4. Transition to chaos. 4.1 One-dimensional maps

Chapitre 4. Transition to chaos. 4.1 One-dimensional maps Chapitre 4 Transition to chaos In this chapter we will study how successive bifurcations can lead to chaos when a parameter is tuned. It is not an extensive review : there exists a lot of different manners

More information

Chaotic motion. Phys 420/580 Lecture 10

Chaotic motion. Phys 420/580 Lecture 10 Chaotic motion Phys 420/580 Lecture 10 Finite-difference equations Finite difference equation approximates a differential equation as an iterative map (x n+1,v n+1 )=M[(x n,v n )] Evolution from time t

More information

Dynamical Systems and Chaos Part I: Theoretical Techniques. Lecture 4: Discrete systems + Chaos. Ilya Potapov Mathematics Department, TUT Room TD325

Dynamical Systems and Chaos Part I: Theoretical Techniques. Lecture 4: Discrete systems + Chaos. Ilya Potapov Mathematics Department, TUT Room TD325 Dynamical Systems and Chaos Part I: Theoretical Techniques Lecture 4: Discrete systems + Chaos Ilya Potapov Mathematics Department, TUT Room TD325 Discrete maps x n+1 = f(x n ) Discrete time steps. x 0

More information

Example Chaotic Maps (that you can analyze)

Example Chaotic Maps (that you can analyze) Example Chaotic Maps (that you can analyze) Reading for this lecture: NDAC, Sections.5-.7. Lecture 7: Natural Computation & Self-Organization, Physics 256A (Winter 24); Jim Crutchfield Monday, January

More information

Math 473: Practice Problems for Test 1, Fall 2011, SOLUTIONS

Math 473: Practice Problems for Test 1, Fall 2011, SOLUTIONS Math 473: Practice Problems for Test 1, Fall 011, SOLUTIONS Show your work: 1. (a) Compute the Taylor polynomials P n (x) for f(x) = sin x and x 0 = 0. Solution: Compute f(x) = sin x, f (x) = cos x, f

More information

Study Island Algebra 2 Standards at Risk

Study Island Algebra 2 Standards at Risk Study Island Algebra 2 Standards at Risk Scatter Plots 1. The number of people who visited a state park each year is recorded. The scatter plot below shows the park's annual visitors over a nine-year period

More information

One Dimensional Dynamical Systems

One Dimensional Dynamical Systems 16 CHAPTER 2 One Dimensional Dynamical Systems We begin by analyzing some dynamical systems with one-dimensional phase spaces, and in particular their bifurcations. All equations in this Chapter are scalar

More information

2 Problem Set 2 Graphical Analysis

2 Problem Set 2 Graphical Analysis 2 PROBLEM SET 2 GRAPHICAL ANALYSIS 2 Problem Set 2 Graphical Analysis 1. Use graphical analysis to describe all orbits of the functions below. Also draw their phase portraits. (a) F(x) = 2x There is only

More information

Deterministic Chaos Lab

Deterministic Chaos Lab Deterministic Chaos Lab John Widloski, Robert Hovden, Philip Mathew School of Physics, Georgia Institute of Technology, Atlanta, GA 30332 I. DETERMINISTIC CHAOS LAB This laboratory consists of three major

More information

Solutions to homework assignment #7 Math 119B UC Davis, Spring for 1 r 4. Furthermore, the derivative of the logistic map is. L r(x) = r(1 2x).

Solutions to homework assignment #7 Math 119B UC Davis, Spring for 1 r 4. Furthermore, the derivative of the logistic map is. L r(x) = r(1 2x). Solutions to homework assignment #7 Math 9B UC Davis, Spring 0. A fixed point x of an interval map T is called superstable if T (x ) = 0. Find the value of 0 < r 4 for which the logistic map L r has a

More information

Scenarios for the transition to chaos

Scenarios for the transition to chaos Scenarios for the transition to chaos Alessandro Torcini alessandro.torcini@cnr.it Istituto dei Sistemi Complessi - CNR - Firenze Istituto Nazionale di Fisica Nucleare - Sezione di Firenze Centro interdipartimentale

More information

Lecture2 The implicit function theorem. Bifurcations.

Lecture2 The implicit function theorem. Bifurcations. Lecture2 The implicit function theorem. Bifurcations. 1 Review:Newton s method. The existence theorem - the assumptions. Basins of attraction. 2 The implicit function theorem. 3 Bifurcations of iterations.

More information

TOWARDS AUTOMATED CHAOS VERIFICATION

TOWARDS AUTOMATED CHAOS VERIFICATION TOWARDS AUTOMATED CHAOS VERIFICATION SARAH DAY CDSNS, Georgia Institute of Technology, Atlanta, GA 30332 OLIVER JUNGE Institute for Mathematics, University of Paderborn, 33100 Paderborn, Germany KONSTANTIN

More information

Newton-Raphson Type Methods

Newton-Raphson Type Methods Int. J. Open Problems Compt. Math., Vol. 5, No. 2, June 2012 ISSN 1998-6262; Copyright c ICSRS Publication, 2012 www.i-csrs.org Newton-Raphson Type Methods Mircea I. Cîrnu Department of Mathematics, Faculty

More information

Chaos and Liapunov exponents

Chaos and Liapunov exponents PHYS347 INTRODUCTION TO NONLINEAR PHYSICS - 2/22 Chaos and Liapunov exponents Definition of chaos In the lectures we followed Strogatz and defined chaos as aperiodic long-term behaviour in a deterministic

More information

More Details Fixed point of mapping is point that maps into itself, i.e., x n+1 = x n.

More Details Fixed point of mapping is point that maps into itself, i.e., x n+1 = x n. More Details Fixed point of mapping is point that maps into itself, i.e., x n+1 = x n. If there are points which, after many iterations of map then fixed point called an attractor. fixed point, If λ

More information

Oscillatory Motion. Simple pendulum: linear Hooke s Law restoring force for small angular deviations. small angle approximation. Oscillatory solution

Oscillatory Motion. Simple pendulum: linear Hooke s Law restoring force for small angular deviations. small angle approximation. Oscillatory solution Oscillatory Motion Simple pendulum: linear Hooke s Law restoring force for small angular deviations d 2 θ dt 2 = g l θ small angle approximation θ l Oscillatory solution θ(t) =θ 0 sin(ωt + φ) F with characteristic

More information

Chaos in Dynamical Systems. LIACS Natural Computing Group Leiden University

Chaos in Dynamical Systems. LIACS Natural Computing Group Leiden University Chaos in Dynamical Systems Overview Introduction: Modeling Nature! Example: Logistic Growth Fixed Points Bifurcation Diagrams Application Examples 2 INTRODUCTION 3 Linear and Non-linear dynamic systems

More information

16 Period doubling route to chaos

16 Period doubling route to chaos 16 Period doubling route to chaos We now study the routes or scenarios towards chaos. We ask: How does the transition from periodic to strange attractor occur? The question is analogous to the study of

More information

Oscillatory Motion. Simple pendulum: linear Hooke s Law restoring force for small angular deviations. Oscillatory solution

Oscillatory Motion. Simple pendulum: linear Hooke s Law restoring force for small angular deviations. Oscillatory solution Oscillatory Motion Simple pendulum: linear Hooke s Law restoring force for small angular deviations d 2 θ dt 2 = g l θ θ l Oscillatory solution θ(t) =θ 0 sin(ωt + φ) F with characteristic angular frequency

More information

INTRODUCTION TO CHAOS THEORY T.R.RAMAMOHAN C-MMACS BANGALORE

INTRODUCTION TO CHAOS THEORY T.R.RAMAMOHAN C-MMACS BANGALORE INTRODUCTION TO CHAOS THEORY BY T.R.RAMAMOHAN C-MMACS BANGALORE -560037 SOME INTERESTING QUOTATIONS * PERHAPS THE NEXT GREAT ERA OF UNDERSTANDING WILL BE DETERMINING THE QUALITATIVE CONTENT OF EQUATIONS;

More information

B5.6 Nonlinear Systems

B5.6 Nonlinear Systems B5.6 Nonlinear Systems 5. Global Bifurcations, Homoclinic chaos, Melnikov s method Alain Goriely 2018 Mathematical Institute, University of Oxford Table of contents 1. Motivation 1.1 The problem 1.2 A

More information

Constructing a chaotic system with any number of equilibria

Constructing a chaotic system with any number of equilibria Nonlinear Dyn (2013) 71:429 436 DOI 10.1007/s11071-012-0669-7 ORIGINAL PAPER Constructing a chaotic system with any number of equilibria Xiong Wang Guanrong Chen Received: 9 June 2012 / Accepted: 29 October

More information

Chapter 3. Gumowski-Mira Map. 3.1 Introduction

Chapter 3. Gumowski-Mira Map. 3.1 Introduction Chapter 3 Gumowski-Mira Map 3.1 Introduction Non linear recurrence relations model many real world systems and help in analysing their possible asymptotic behaviour as the parameters are varied [17]. Here

More information

Introduction to Dynamical Systems Basic Concepts of Dynamics

Introduction to Dynamical Systems Basic Concepts of Dynamics Introduction to Dynamical Systems Basic Concepts of Dynamics A dynamical system: Has a notion of state, which contains all the information upon which the dynamical system acts. A simple set of deterministic

More information

2 Discrete growth models, logistic map (Murray, Chapter 2)

2 Discrete growth models, logistic map (Murray, Chapter 2) 2 Discrete growth models, logistic map (Murray, Chapter 2) As argued in Lecture 1 the population of non-overlapping generations can be modelled as a discrete dynamical system. This is an example of an

More information

Fundamentals of Dynamical Systems / Discrete-Time Models. Dr. Dylan McNamara people.uncw.edu/ mcnamarad

Fundamentals of Dynamical Systems / Discrete-Time Models. Dr. Dylan McNamara people.uncw.edu/ mcnamarad Fundamentals of Dynamical Systems / Discrete-Time Models Dr. Dylan McNamara people.uncw.edu/ mcnamarad Dynamical systems theory Considers how systems autonomously change along time Ranges from Newtonian

More information

Finding numerically Newhouse sinks near a homoclinic tangency and investigation of their chaotic transients. Takayuki Yamaguchi

Finding numerically Newhouse sinks near a homoclinic tangency and investigation of their chaotic transients. Takayuki Yamaguchi Hokkaido Mathematical Journal Vol. 44 (2015) p. 277 312 Finding numerically Newhouse sinks near a homoclinic tangency and investigation of their chaotic transients Takayuki Yamaguchi (Received March 13,

More information

Behaviour of simple population models under ecological processes

Behaviour of simple population models under ecological processes J. Biosci., Vol. 19, Number 2, June 1994, pp 247 254. Printed in India. Behaviour of simple population models under ecological processes SOMDATTA SINHA* and S PARTHASARATHY Centre for Cellular and Molecular

More information

The logistic difference equation and the route to chaotic behaviour

The logistic difference equation and the route to chaotic behaviour The logistic difference equation and the route to chaotic behaviour Level 1 module in Modelling course in population and evolutionary biology (701-1418-00) Module author: Sebastian Bonhoeffer Course director:

More information

Test 2 Review Math 1111 College Algebra

Test 2 Review Math 1111 College Algebra Test 2 Review Math 1111 College Algebra 1. Begin by graphing the standard quadratic function f(x) = x 2. Then use transformations of this graph to graph the given function. g(x) = x 2 + 2 *a. b. c. d.

More information

Chaos. Dr. Dylan McNamara people.uncw.edu/mcnamarad

Chaos. Dr. Dylan McNamara people.uncw.edu/mcnamarad Chaos Dr. Dylan McNamara people.uncw.edu/mcnamarad Discovery of chaos Discovered in early 1960 s by Edward N. Lorenz (in a 3-D continuous-time model) Popularized in 1976 by Sir Robert M. May as an example

More information

f[x_, μ_] := 4. μ... Nest[f[#,...] &,...,...] Plot[{x, f[...]}, {x, 0, 1}, AspectRatio Equal]

f[x_, μ_] := 4. μ... Nest[f[#,...] &,...,...] Plot[{x, f[...]}, {x, 0, 1}, AspectRatio Equal] 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 In this exercise, we use renormalization-group and scaling methods to study the onset of chaos. There are several routes by which a dynamical system can start exhibiting chaotic

More information

Some Dynamical Behaviors In Lorenz Model

Some Dynamical Behaviors In Lorenz Model International Journal Of Computational Engineering Research (ijceronline.com) Vol. Issue. 7 Some Dynamical Behaviors In Lorenz Model Dr. Nabajyoti Das Assistant Professor, Department of Mathematics, Jawaharlal

More information

SIMPLE CHAOTIC FLOWS WITH ONE STABLE EQUILIBRIUM

SIMPLE CHAOTIC FLOWS WITH ONE STABLE EQUILIBRIUM International Journal of Bifurcation and Chaos, Vol. 23, No. 11 (2013) 1350188 (7 pages) c World Scientific Publishing Company DOI: 10.1142/S0218127413501885 SIMPLE CHAOTIC FLOWS WITH ONE STABLE EQUILIBRIUM

More information

1. Algebra and Functions

1. Algebra and Functions 1. Algebra and Functions 1.1.1 Equations and Inequalities 1.1.2 The Quadratic Formula 1.1.3 Exponentials and Logarithms 1.2 Introduction to Functions 1.3 Domain and Range 1.4.1 Graphing Functions 1.4.2

More information

1.2. Direction Fields: Graphical Representation of the ODE and its Solution Let us consider a first order differential equation of the form dy

1.2. Direction Fields: Graphical Representation of the ODE and its Solution Let us consider a first order differential equation of the form dy .. Direction Fields: Graphical Representation of the ODE and its Solution Let us consider a first order differential equation of the form dy = f(x, y). In this section we aim to understand the solution

More information

2 Discrete Dynamical Systems (DDS)

2 Discrete Dynamical Systems (DDS) 2 Discrete Dynamical Systems (DDS) 2.1 Basics A Discrete Dynamical System (DDS) models the change (or dynamics) of single or multiple populations or quantities in which the change occurs deterministically

More information

The phenomenon: complex motion, unusual geometry

The phenomenon: complex motion, unusual geometry Part I The phenomenon: complex motion, unusual geometry Chapter 1 Chaotic motion 1.1 What is chaos? Certain long-lasting, sustained motion repeats itself exactly, periodically. Examples from everyday life

More information

Experimental and Simulated Chaotic RLD Circuit Analysis with the Use of Lorenz Maps

Experimental and Simulated Chaotic RLD Circuit Analysis with the Use of Lorenz Maps Experimental and Simulated Chaotic RLD Circuit Analysis with the Use of Lorenz Maps N.A. Gerodimos, P.A. Daltzis, M.P. Hanias, H.E. Nistazakis, and G.S. Tombras Abstract In this work, the method Ed. Lorenz

More information

THREE DIMENSIONAL SYSTEMS. Lecture 6: The Lorenz Equations

THREE DIMENSIONAL SYSTEMS. Lecture 6: The Lorenz Equations THREE DIMENSIONAL SYSTEMS Lecture 6: The Lorenz Equations 6. The Lorenz (1963) Equations The Lorenz equations were originally derived by Saltzman (1962) as a minimalist model of thermal convection in a

More information

4.1 Exponential Functions

4.1 Exponential Functions Graduate T.A. Department of Mathematics Dynamical Systems and Chaos San Diego State University April 9, 211 Definitions The functions that involve some combinations of basic arithmetic operations, powers,

More information

QUADRATIC REGULAR REVERSAL MAPS

QUADRATIC REGULAR REVERSAL MAPS QUADRATIC REGULAR REVERSAL MAPS FRANCISCO J. SOLIS AND LUCAS JÓDAR Received 3 November 23 We study families of quadratic maps in an attempt to understand the role of dependence on parameters of unimodal

More information

converges to a root, it may not always be the root you have in mind.

converges to a root, it may not always be the root you have in mind. Math 1206 Calculus Sec. 4.9: Newton s Method I. Introduction For linear and quadratic equations there are simple formulas for solving for the roots. For third- and fourth-degree equations there are also

More information

vii Contents 7.5 Mathematica Commands in Text Format 7.6 Exercises

vii Contents 7.5 Mathematica Commands in Text Format 7.6 Exercises Preface 0. A Tutorial Introduction to Mathematica 0.1 A Quick Tour of Mathematica 0.2 Tutorial 1: The Basics (One Hour) 0.3 Tutorial 2: Plots and Differential Equations (One Hour) 0.4 Mathematica Programs

More information

Week 1: need to know. November 14, / 20

Week 1: need to know. November 14, / 20 Week 1: need to know How to find domains and ranges, operations on functions (addition, subtraction, multiplication, division, composition), behaviors of functions (even/odd/ increasing/decreasing), library

More information

Is the Field of Numbers a Real Physical Field? On the Frequent Distribution and Masses of the Elementary Particles

Is the Field of Numbers a Real Physical Field? On the Frequent Distribution and Masses of the Elementary Particles Is the Field of Numbers a Real Physical Field? On the Frequent Distribution and Masses of the Elementary Particles Anatoly V. Belyakov E-mail: belyakov.lih@gmail.com Frequent distributions of the databases

More information

The Big, Big Picture (Bifurcations II)

The Big, Big Picture (Bifurcations II) The Big, Big Picture (Bifurcations II) Reading for this lecture: NDAC, Chapter 8 and Sec. 10.0-10.4. 1 Beyond fixed points: Bifurcation: Qualitative change in behavior as a control parameter is (slowly)

More information

Math 12: Discrete Dynamical Systems Homework

Math 12: Discrete Dynamical Systems Homework Math 12: Discrete Dynamical Systems Homework Department of Mathematics, Harvey Mudd College Several of these problems will require computational software to help build our insight about discrete dynamical

More information

Math 345 Intro to Math Biology Lecture 7: Models of System of Nonlinear Difference Equations

Math 345 Intro to Math Biology Lecture 7: Models of System of Nonlinear Difference Equations Math 345 Intro to Math Biology Lecture 7: Models of System of Nonlinear Difference Equations Junping Shi College of William and Mary, USA Equilibrium Model: x n+1 = f (x n ), here f is a nonlinear function

More information

A Search for the Simplest Chaotic Partial Differential Equation

A Search for the Simplest Chaotic Partial Differential Equation A Search for the Simplest Chaotic Partial Differential Equation C. Brummitt University of Wisconsin-Madison, Department of Physics cbrummitt@wisc.edu J. C. Sprott University of Wisconsin-Madison, Department

More information

Lesson 4: Non-fading Memory Nonlinearities

Lesson 4: Non-fading Memory Nonlinearities Lesson 4: Non-fading Memory Nonlinearities Nonlinear Signal Processing SS 2017 Christian Knoll Signal Processing and Speech Communication Laboratory Graz University of Technology June 22, 2017 NLSP SS

More information

1.1 Basic Algebra. 1.2 Equations and Inequalities. 1.3 Systems of Equations

1.1 Basic Algebra. 1.2 Equations and Inequalities. 1.3 Systems of Equations 1. Algebra 1.1 Basic Algebra 1.2 Equations and Inequalities 1.3 Systems of Equations 1.1 Basic Algebra 1.1.1 Algebraic Operations 1.1.2 Factoring and Expanding Polynomials 1.1.3 Introduction to Exponentials

More information

Liapunov Exponent. September 19, 2011

Liapunov Exponent. September 19, 2011 Liapunov Exponent September 19, 2011 1 Introduction At times, it is difficult to see whether a system is chaotic or not. We can use the Liapunov Exponent to check if an orbit is stable, which will give

More information

10-2: Exponential Function Introduction

10-2: Exponential Function Introduction Math 95 10-2: Exponential Function Introduction Quadratic functions, like y = x B, are made of a sum of powers of the independent variable. In a quadratic function, the variables are in the base of the

More information

Lesson 6b Rational Exponents & Radical Functions

Lesson 6b Rational Exponents & Radical Functions Lesson 6b Rational Exponents & Radical Functions In this lesson, we will continue our review of Properties of Exponents and will learn some new properties including those dealing with Rational and Radical

More information

Handout 2: Invariant Sets and Stability

Handout 2: Invariant Sets and Stability Engineering Tripos Part IIB Nonlinear Systems and Control Module 4F2 1 Invariant Sets Handout 2: Invariant Sets and Stability Consider again the autonomous dynamical system ẋ = f(x), x() = x (1) with state

More information

Is the Hénon map chaotic

Is the Hénon map chaotic Is the Hénon map chaotic Zbigniew Galias Department of Electrical Engineering AGH University of Science and Technology, Poland, galias@agh.edu.pl International Workshop on Complex Networks and Applications

More information

2 One-dimensional models in discrete time

2 One-dimensional models in discrete time 2 One-dimensional models in discrete time So far, we have assumed that demographic events happen continuously over time and can thus be written as rates. For many biological species with overlapping generations

More information

Chapter 23. Predicting Chaos The Shift Map and Symbolic Dynamics

Chapter 23. Predicting Chaos The Shift Map and Symbolic Dynamics Chapter 23 Predicting Chaos We have discussed methods for diagnosing chaos, but what about predicting the existence of chaos in a dynamical system. This is a much harder problem, and it seems that the

More information

Infinity Unit 2: Chaos! Dynamical Systems

Infinity Unit 2: Chaos! Dynamical Systems Infinity Unit 2: Chaos! Dynamical Systems Iterating Linear Functions These questions are about iterating f(x) = mx + b. Seed: x 1. Orbit: x 1, x 2, x 3, For each question, give examples and a symbolic

More information

6.2 Their Derivatives

6.2 Their Derivatives Exponential Functions and 6.2 Their Derivatives Copyright Cengage Learning. All rights reserved. Exponential Functions and Their Derivatives The function f(x) = 2 x is called an exponential function because

More information

A Two-dimensional Discrete Mapping with C Multifold Chaotic Attractors

A Two-dimensional Discrete Mapping with C Multifold Chaotic Attractors EJTP 5, No. 17 (2008) 111 124 Electronic Journal of Theoretical Physics A Two-dimensional Discrete Mapping with C Multifold Chaotic Attractors Zeraoulia Elhadj a, J. C. Sprott b a Department of Mathematics,

More information

Chapter #4 EEE8086-EEE8115. Robust and Adaptive Control Systems

Chapter #4 EEE8086-EEE8115. Robust and Adaptive Control Systems Chapter #4 Robust and Adaptive Control Systems Nonlinear Dynamics.... Linear Combination.... Equilibrium points... 3 3. Linearisation... 5 4. Limit cycles... 3 5. Bifurcations... 4 6. Stability... 6 7.

More information

2D-Volterra-Lotka Modeling For 2 Species

2D-Volterra-Lotka Modeling For 2 Species Majalat Al-Ulum Al-Insaniya wat - Tatbiqiya 2D-Volterra-Lotka Modeling For 2 Species Alhashmi Darah 1 University of Almergeb Department of Mathematics Faculty of Science Zliten Libya. Abstract The purpose

More information

Relations and Functions (for Math 026 review)

Relations and Functions (for Math 026 review) Section 3.1 Relations and Functions (for Math 026 review) Objective 1: Understanding the s of Relations and Functions Relation A relation is a correspondence between two sets A and B such that each element

More information

A MINIMAL 2-D QUADRATIC MAP WITH QUASI-PERIODIC ROUTE TO CHAOS

A MINIMAL 2-D QUADRATIC MAP WITH QUASI-PERIODIC ROUTE TO CHAOS International Journal of Bifurcation and Chaos, Vol. 18, No. 5 (2008) 1567 1577 c World Scientific Publishing Company A MINIMAL 2-D QUADRATIC MAP WITH QUASI-PERIODIC ROUTE TO CHAOS ZERAOULIA ELHADJ Department

More information

5.3 Other Algebraic Functions

5.3 Other Algebraic Functions 5.3 Other Algebraic Functions 397 5.3 Other Algebraic Functions This section serves as a watershed for functions which are combinations of polynomial, and more generally, rational functions, with the operations

More information

Dynamical Systems with Applications using Mathematica

Dynamical Systems with Applications using Mathematica Stephen Lynch Dynamical Systems with Applications using Mathematica Birkhäuser Boston Basel Berlin Contents Preface xi 0 A Tutorial Introduction to Mathematica 1 0.1 A Quick Tour of Mathematica 2 0.2 Tutorial

More information

Prentice Hall Mathematics, Geometry 2009 Correlated to: Maine Learning Results 2007 Mathematics Grades 9-Diploma

Prentice Hall Mathematics, Geometry 2009 Correlated to: Maine Learning Results 2007 Mathematics Grades 9-Diploma A. NUMBER: Students use numbers in everyday and mathematical contexts to quantify or describe phenomena, develop concepts of operations with different types of numbers, use the structure and properties

More information

Simplest Chaotic Flows with Involutional Symmetries

Simplest Chaotic Flows with Involutional Symmetries International Journal of Bifurcation and Chaos, Vol. 24, No. 1 (2014) 1450009 (9 pages) c World Scientific Publishing Company DOI: 10.1142/S0218127414500096 Simplest Chaotic Flows with Involutional Symmetries

More information

Dynamical Systems with Applications

Dynamical Systems with Applications Stephen Lynch Dynamical Systems with Applications using MATLAB Birkhauser Boston Basel Berlin Preface xi 0 A Tutorial Introduction to MATLAB and the Symbolic Math Toolbox 1 0.1 Tutorial One: The Basics

More information

Ordinal Analysis of Time Series

Ordinal Analysis of Time Series Ordinal Analysis of Time Series K. Keller, M. Sinn Mathematical Institute, Wallstraße 0, 2552 Lübeck Abstract In order to develop fast and robust methods for extracting qualitative information from non-linear

More information

Personal notes on renormalization

Personal notes on renormalization Personal notes on renormalization Pau Rabassa Sans April 17, 2009 1 Dynamics of the logistic map This will be a fast (and selective) review of the dynamics of the logistic map. Let us consider the logistic

More information

Recent new examples of hidden attractors

Recent new examples of hidden attractors Eur. Phys. J. Special Topics 224, 1469 1476 (2015) EDP Sciences, Springer-Verlag 2015 DOI: 10.1140/epjst/e2015-02472-1 THE EUROPEAN PHYSICAL JOURNAL SPECIAL TOPICS Review Recent new examples of hidden

More information

Why are Discrete Maps Sufficient?

Why are Discrete Maps Sufficient? Why are Discrete Maps Sufficient? Why do dynamical systems specialists study maps of the form x n+ 1 = f ( xn), (time is discrete) when much of the world around us evolves continuously, and is thus well

More information

Solutions to homework Assignment #6 Math 119B UC Davis, Spring 2012

Solutions to homework Assignment #6 Math 119B UC Davis, Spring 2012 Problems 1. For each of the following maps acting on the interval [0, 1], sketch their graphs, find their fixed points and determine for each fixed point whether it is asymptotically stable (a.k.a. attracting),

More information

K. Pyragas* Semiconductor Physics Institute, LT-2600 Vilnius, Lithuania Received 19 March 1998

K. Pyragas* Semiconductor Physics Institute, LT-2600 Vilnius, Lithuania Received 19 March 1998 PHYSICAL REVIEW E VOLUME 58, NUMBER 3 SEPTEMBER 998 Synchronization of coupled time-delay systems: Analytical estimations K. Pyragas* Semiconductor Physics Institute, LT-26 Vilnius, Lithuania Received

More information

Invariant manifolds of the Bonhoeffer-van der Pol oscillator

Invariant manifolds of the Bonhoeffer-van der Pol oscillator Invariant manifolds of the Bonhoeffer-van der Pol oscillator R. Benítez 1, V. J. Bolós 2 1 Dpto. Matemáticas, Centro Universitario de Plasencia, Universidad de Extremadura. Avda. Virgen del Puerto 2. 10600,

More information

Solutions for B8b (Nonlinear Systems) Fake Past Exam (TT 10)

Solutions for B8b (Nonlinear Systems) Fake Past Exam (TT 10) Solutions for B8b (Nonlinear Systems) Fake Past Exam (TT 10) Mason A. Porter 15/05/2010 1 Question 1 i. (6 points) Define a saddle-node bifurcation and show that the first order system dx dt = r x e x

More information

Infinite series, improper integrals, and Taylor series

Infinite series, improper integrals, and Taylor series Chapter 2 Infinite series, improper integrals, and Taylor series 2. Introduction to series In studying calculus, we have explored a variety of functions. Among the most basic are polynomials, i.e. functions

More information

3.5 Quadratic Approximation and Convexity/Concavity

3.5 Quadratic Approximation and Convexity/Concavity 3.5 Quadratic Approximation and Convexity/Concavity 55 3.5 Quadratic Approximation and Convexity/Concavity Overview: Second derivatives are useful for understanding how the linear approximation varies

More information