Scribd
Upload
28 views

With A Between 3 and 1+ 6 3.449, From Almost All Initial Conditions X Will Approach Permanent Oscillations Between Two Values

The document outlines tasks involving generating and plotting the logistic map for varying parameters A and initial values x to observe bifurcations and chaos, finding real roots of polynomials using the bisection and Newton-Raphson methods, and investigating convergence for functions near bifurcation points in the logistic map. It provides code to generate the logistic map and tasks to analyze its behavior, find roots of polynomials, and examine convergence properties for initial values near a bifurcation point.

Uploaded by

Shubham Chandra
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
28 views

With A Between 3 and 1+ 6 3.449, From Almost All Initial Conditions X Will Approach Permanent Oscillations Between Two Values

The document outlines tasks involving generating and plotting the logistic map for varying parameters A and initial values x to observe bifurcations and chaos, finding real roots of polynomials using the bisection and Newton-Raphson methods, and investigating convergence for functions near bifurcation points in the logistic map. It provides code to generate the logistic map and tasks to analyze its behavior, find roots of polynomials, and examine convergence properties for initial values near a bifurcation point.

Uploaded by

Shubham Chandra
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 2

Tasks for 22/01/2018:

Computer arithmetic 3: Consider the logistic map: = (1 − ),

where, xn is the nth iteration of x for a starting value of 0 ≤ x ≤ 1.


Here A is a constant.

(a) Write a code to generate the logistic map. Start by varying the
value of A to observe the following:

With A between 0 and 1, the value of xn will eventually


go to zero, independent of the initial value of x.
With A between 1 and 2, the population will quickly approach the value ,
independent of the initial x value.
With A between 2 and 3, xn will also eventually approach the value , but
first will fluctuate around that value for some time.
With A between 3 and 1+ 6=3.449, from almost all initial conditions
xn will approach permanent oscillations between two values.

Plot xn vs. n for all this condition for a value of n>50.

(b) For an initial value x=0.2, vary the value of A from 0.88 to 3.9925 in an
interval of 0.0125 in each step. For each value of A, note the values of xn for
n=150, then make a plot of xn vs. A and see the bifurcation and chaos. Now
change the initial value of x. Do you see any change in the plot?

(c) For A = 3.0, choose two points x and x' where, x' = x + 0.01 and iterate. Plot
log(|xn − x'n| / 0.01) as a function of n. See if it is approaching a straight line for
very large n. Check for other values around 3, and you will see error eventually
dropping to 0 soon enough. This happens because at A=3, near the bifurcation
memory, the systems approaches equilibrium in a dramatically slow manner.

Root finding 1: How many real roots does the polynomial ()=2 −5
has? Find the roots using the method of bisection.
Root finding 2: Solve the equation ( ) = − 0.165 + 3.993 10 using

Newton-Raphson method.
1) With initial guess of x(0) = 0.05.

2) With initial guess of x(0)=0.11,


Why does the 2nd case do not offer any solution? You may start of
by plotting the function.

3) Can you approximately locate another initial guess which will


lead to no solution?

Root finding 3: Now find the roots for the polynomial of last
problem by method of bisection. See if choosing x(0)=0.11 as
one of the initial bounds work in this case. Compare the number
of iterations it takes to converge to a root.

You might also like