Logistics Map

Namit Anand June 27, 2012

Abstract Logistic map is an used as an example to explain how simple nonlinear functions can help in demonstrating chaos. Logistic map is a second order recurrence relation.

The nonlinear function

The relation goes as: xn+1 = xn (1 xn ) where is a non zero constant. Observing the nonlinear function one can see that if we take large positive values of xn the series rapidly diverges to - Also if you use large negative values for xn still rapidly diverges to . So to observe the behavior of the function we restrict xn between 0 and 1. Also we restrict between 0 and 4 and divide the interval into several subintervals to observe dierent behaviour.

C++ Program Simulation

So we have xn+1 = xn (1 xn ) xn (0, 1) (0, 4) The following C++ program produces a random number between 0 and 4 for and a random number between 0 and 1 for xn .

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36

/ x ( n+1)=a x ( n ) [1 x ( n ) ] 0<a<4 0<x<1 / #include<i o s t r e a m > #include<math . h> #include<s t d l i b . h> #include<time . h> #include<f s t r e a m > using namespace s t d ; int main ( ) { s r a n d ( time (NULL) ) ; ofstream fout ( alpha . txt ) ; f l o a t a , x0 , x1 ; int n =1 + rand ( ) %400; a=( f l o a t ) n / 1 0 0 ; int k=1+rand ( ) %100; x0=( f l o a t ) k / 1 0 0 ; cout<< a l p h a=<<a ; cout<< \ nx0=<<x0<<e n d l ; f o u t << a l p h a=<<a<<e n d l ; f o u t << 0 << \ t <<x0<<\n ; f o r ( int i =1; i <=100; i ++) { x1=a x0(1x0 ) ; f o u t <<i << \ t <<x1<<\n ; x0=x1 ; } fout . close () ; return 0 ; }

Observations

The above program divides the results into subintervals: 1. (0, 1) then the series rapidly diverges to zero. 2. (1, 2) then the series rapidly converges to a value equal to 1 for any value of xn (0, 1) 3. (2, 3) then the series converges to the same point i.e. 1 but with a slower rate which is still linear. 2

4. (3, 3.45) the series oscillates between two points which depend on . 5. (3.45, 3.54) the series oscillates between four points which also depend on And so it goes on like this to 8,16,32 points. With near 3.57 is the onset of chaos where even small changes in intial values give rise to exponential dierences in nal values.

Mathematical Ananlysis

Since from analytic calculations we know of the xed points in the various subintervals for , one can try to analyse the behaviour of the series in such regions. Fixed points are such that xn+1 = xn We have to check the stability of the xed point x (say). To check the stability of the xed point we displace it by a small amount 0 (say) and see if the series has a tendency to bring the point back to x .

4.1

[0, 1]

We have, 1) xn = x + 0 2) xn+1 = x + 1 and xn+1 = xn (1 xn ) = [xn x2 ] n = [x + 0 (x + 0 )2 ] 2 = [x + 0 (x2 + 0 + 2x0 )] 2 Since 0 is very small implies 0 << 1 and can be neglected. 2 = [x + 0 0 2x0 ] 2 i.e, x + 1 = [x + 0 0 2x0 ] Put x = 0 we get 1 = (0 ) And since (0, 1) Therefore, 1 < 0 i.e. series converges and hence the xed point namely x = 0 is stable.

4.2

(1, 2]

x + 1 = [x(1 x) + 0 (1 2x)] We have x = 1 3

1 i.e, 1 + 1 = [ 1 + 0 2 ] 1 1 i.e, + 1 = + 0 (2 ) i.e, 1 = 0 (2 ) Since (1, 2],therefore 2 [0, 1) Therefore, 1 < 0 i.e. series converges to x = 1 and is a stable xed point.

4.3

(2, 3)

Since (2, 3),therefore |2 | (0, 1) Therefore, |1 | < |0 | i.e. series converges to x = 1 and is a stable xed point. Although the rate of convergence is slower than previous case.

4.4

(2, 3)

Since (3, 4),therefore |2 | (1, 2) Therefore, |1 | > |0 | i.e. series diverges and their is no stable xed point. Finally after is greater than 3.57 , the prime characteristic of chaos can be observed i.e. exponential dierences in results for minute changes in initial conditions.