No Title

Applied Homework 3

Due date: March 22

1.

On Bees, Colliding trains and Geometric series [20 points]: Two trains each with a speed of 5 m/s, are speeding towards each other on the same track. When the distance between the trains is 100m, a bee starts flying from train A towards train B at a speed of 10m/s.

(a): What is the distance traveled by the bee, by the time it reaches the train B.
(b): How far has the train A traveled when the bee reaches train B?

When the bee reaches the train B, it stops and flies towards train A with a speed of 10m/s.
(c): What is the distance traveled by the bee, by the time it reaches the train A.
(d): How far has the train B traveled when the bee reaches train A?
The bee keeps flying back and forth between the trains A and B, until the trains collide.
(e): How many trips does the bee make before the trains collide?
(f): Calculate the total distance traveled by the bee.

2.

Golden Ratio [10 points]: Consider this procedure for generating a sequence of numbers. Given the nth number in the sequence, a_n, we generate the next number a_n+1 in the sequence, by adding 1 to a_n and then taking the reciprocal of the result. Choose any positive number to be the first term a₁ in the sequence.

(a): Write the recursion relation which gives this sequence.
(b): Using a calculator, convince yourself that this sequence converges to a value L, where $L\approx 0.618$ .
(c): Find the limit of this sequence by finding the fixed point of the recursion relation. Show that there are two fixed points to the above recursion relation, and one of the fixed points, $x=\frac{\sqrt{5}-1}{2}$ , is the limit of the above sequence.
(d): (Optional) Can you explain why the sequence never converges to the other fixed point?

3.

Logistic Equation and Chaos [30 points] : (Problem 68 in Section 8.1 of Thomas/Finney)
Use any computer algebra system or Excel or any programming languages to do this problem. Please submit the printouts of the plots along with a brief description of what the result means.
The population of certain species of bees are described by the logistic equation

$\begin{displaymath}X_{n+1} = r X_n ( 1 - X_n) \hspace{0.2in} 0<r<4,\hspace{0.2in} 0<X_n<1\end{displaymath}$

where X_n is the population of the bees after n seasons and r is a parameter which describes the effective growth rate of the population (i.e. the difference between birth rate and the death rate). In the above equation the population X_n is assumed to be given in millions; so X_n=0.3 denotes a population of 0.3 million. The maximum population that the environment can support is 1 million, so 0<X_n<1.

The aim of the project is to understand the long-term behavior of the population of the bees, for different values of the parameter r. We would find that if the effective growth rate r is small then the bee population eventually dies out and if r is large, then the long term behavior of the bee population becomes chaotic.

Throughout this exercise choose the initial population X₀ such that 0<X₀<1, say X₀=0.3.

(a): Choose r=3/4. Calculate and plot the population for the first hundred seasons. Does the population appear to converge? What do you guess is the limit of the population sequence? Does this final limit seem to depend on your choice of X₀?
(b): Choose several values of r in the interval 1<r<3 and repeat the procedures given in the previous part. Describe the behavior of the sequences you observe in your plots.
(c): Now examine the values of r near the endpoints of the interval 3<r<3.45. The transition value r=3 is called a bifurcation value and the new behavior of the sequence in the interval is called an attracting 2-cycle.
(d): Next explore the behavior for r values near the endpoints of each of the intervals 3.45<r<3.54 and 3.54<r< 3.55. Plot the first 200 terms of the sequences. Describe in your own words the behavior observed in your plots for each interval. Among how many values does the sequence appear to oscillate for each interval? The values r=3.45 and r=3.54 are also called bifurcation points since the behavior of the sequence changes as r crosses over those values.
(e): The situation gets even more interesting for 3.55<r<3.57. As r varies between this range we get more complicated attracting cycles. Choose r=3.5695 and plot 300 points. Describe the behavior.
(f): Let us see what happens when r>3.57. Choose r=3.65 and calculate and plot the first 300 terms of the sequence. Observe how the population wanders around in an unpredictable, chaotic fashion. You cannot guess the value of X_n+1 from the value of X_n.
(g): For r=3.65 choose two starting values of X₀ that are close together, say, X₀=0.3 and X₀=0.301. Calculate and plot the first 300 values of the sequences determined by each starting value. Compare the behavior observed in your plots (It is best to plot them in the same graph). How far out do you go before the corresponding terms of your two sequences appear to depart from each other? Repeat the exploration for r=3.75. Notice how different the plots look depending on your choice of initial population X₀. This sensitive dependence to initial condition is one of the most important characteristics of chaotic behavior.