Docsity
Docsity

Prepare for your exams
Prepare for your exams

Study with the several resources on Docsity


Earn points to download
Earn points to download

Earn points by helping other students or get them with a premium plan


Guidelines and tips
Guidelines and tips

Discrete Dynamic Systems - Assignment - Fall 2007 | MATH 457, Assignments of Mathematics

Material Type: Assignment; Class: Discrete Dynam Systems; Subject: Mathematics; University: University of Oregon; Term: Spring 2007;

Typology: Assignments

Pre 2010

Uploaded on 09/17/2009

koofers-user-fsa
koofers-user-fsa šŸ‡ŗšŸ‡ø

10 documents

1 / 1

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
Math 457, first prep assignment
April 2, 2007
In order to gain some experience with dynamical systems before plunging into the theory, each person
in class will look at iterating the following functions, first on their own and then in groups at the
beginning of class. If your last name begins with A-E, work on function(s) listed in 1 below; F-J on
2; K-O on 3; P-T on 4; U-Z on 5. Some of these will be facilitated by using the ā€œIteration Appletā€,
but don’t worry if you have to do one which requires work ā€œby handā€. The expectations and grading
(which will be fairly generous for preparation work) will be uniform.
1. Use the ā€œIteration Appletā€ to look at the functions x2+c(so for example, f(x) = x2āˆ’1.8)
and cx(1 āˆ’x) for at least five different values of cand at least three different seed values x(0).
Make the values of cvary over the whole range which the applet allows. Try to characterize the
eventual behavior in each case - e.g. ā€œapproaching a fixed point of x=Ā·Ā·Ā·.ā€
2. Use the ā€œIteration Appletā€ to look at the functions ccos(x) (so for example, f(x) = 1 Ā·cos(x) =
cos(x) itself) and csin(x) for at least five different values of cand at least three different seed
values x(0). Make the values of cvary over the whole range which the applet allows. Try to
characterize the eventual behavior in each case - e.g. ā€œapproaching a fixed point of x=Ā·Ā·Ā·.ā€
3. Consider the function covered at the end of Monday’s class: f(x)=2xif x < 1
2or 2xāˆ’1 if
x≄1
2. This function is called ā€œ2xmod 1 in the ā€œIteration Applet.ā€ Try at least 12 different
values of x(0). Also try at least five different see values ā€œby handā€, including numbers like Ļ€āˆ’3
and √2āˆ’1. Finally, even though 0 is a fixed point, is it ever the case that numbers close to 0
are ā€œattractedā€ by it?
4. Consider the function of positive integers defined by f(n) = n
2if nis even or 3n+ 1 if nis
odd. Determine the behavior of iterating this function for at least twenty different seed values,
iterating each at least a dozen times (if not more). Try to include at least one seed value over
100, and one over 1000. Also try a few negative numbers (like āˆ’5).
5. Iterate the functions 1
1+xand x
2+1
x, with at least three different seed values and a dozen
iterations. What patters do you notice? Next make up at least two of your own examples of
functions of the form ax+b
cx+dand iterate them. Calculate the fixed points and try to make some
kind of general statement about iterating these functions.
1

Partial preview of the text

Download Discrete Dynamic Systems - Assignment - Fall 2007 | MATH 457 and more Assignments Mathematics in PDF only on Docsity!

Math 457, first prep assignment

April 2, 2007

In order to gain some experience with dynamical systems before plunging into the theory, each person in class will look at iterating the following functions, first on their own and then in groups at the beginning of class. If your last name begins with A-E, work on function(s) listed in 1 below; F-J on 2; K-O on 3; P-T on 4; U-Z on 5. Some of these will be facilitated by using the ā€œIteration Appletā€, but don’t worry if you have to do one which requires work ā€œby handā€. The expectations and grading (which will be fairly generous for preparation work) will be uniform.

  1. Use the ā€œIteration Appletā€ to look at the functions x^2 + c (so for example, f (x) = x^2 āˆ’ 1 .8) and cx(1 āˆ’ x) for at least five different values of c and at least three different seed values x(0). Make the values of c vary over the whole range which the applet allows. Try to characterize the eventual behavior in each case - e.g. ā€œapproaching a fixed point of x = Ā· Ā· Ā·.ā€
  2. Use the ā€œIteration Appletā€ to look at the functions c cos(x) (so for example, f (x) = 1 Ā· cos(x) = cos(x) itself) and c sin(x) for at least five different values of c and at least three different seed values x(0). Make the values of c vary over the whole range which the applet allows. Try to characterize the eventual behavior in each case - e.g. ā€œapproaching a fixed point of x = Ā· Ā· Ā·.ā€
  3. Consider the function covered at the end of Monday’s class: f (x) = 2x if x < 12 or 2x āˆ’ 1 if x ≄ 12. This function is called ā€œ2x mod 1 in the ā€œIteration Applet.ā€ Try at least 12 different values of x(0). Also try at least five different see values ā€œby handā€, including numbers like Ļ€ āˆ’ 3 and

2 āˆ’ 1. Finally, even though 0 is a fixed point, is it ever the case that numbers close to 0 are ā€œattractedā€ by it?

  1. Consider the function of positive integers defined by f (n) = n 2 if n is even or 3n + 1 if n is odd. Determine the behavior of iterating this function for at least twenty different seed values, iterating each at least a dozen times (if not more). Try to include at least one seed value over 100, and one over 1000. Also try a few negative numbers (like āˆ’5).
  2. Iterate the functions (^) 1+^1 x and x 2 + (^) x^1 , with at least three different seed values and a dozen iterations. What patters do you notice? Next make up at least two of your own examples of functions of the form axcx++db and iterate them. Calculate the fixed points and try to make some kind of general statement about iterating these functions.