Math 312 Lecture Notes One Dimensional Maps

Similar documents
10.6 ALTERNATING SERIES

Infinite Sequences and Series

A sequence of numbers is a function whose domain is the positive integers. We can see that the sequence

Sequences. A Sequence is a list of numbers written in order.

Math 128A: Homework 1 Solutions

Chapter 10: Power Series

Sequences. Notation. Convergence of a Sequence

CHAPTER 10 INFINITE SEQUENCES AND SERIES

Solutions to quizzes Math Spring 2007

CHAPTER 1 SEQUENCES AND INFINITE SERIES

THE SOLUTION OF NONLINEAR EQUATIONS f( x ) = 0.

Math 113, Calculus II Winter 2007 Final Exam Solutions

6.3 Testing Series With Positive Terms

Zeros of Polynomials

Sequences A sequence of numbers is a function whose domain is the positive integers. We can see that the sequence

Polynomial Functions and Their Graphs

62. Power series Definition 16. (Power series) Given a sequence {c n }, the series. c n x n = c 0 + c 1 x + c 2 x 2 + c 3 x 3 +

(A sequence also can be thought of as the list of function values attained for a function f :ℵ X, where f (n) = x n for n 1.) x 1 x N +k x N +4 x 3

sin(n) + 2 cos(2n) n 3/2 3 sin(n) 2cos(2n) n 3/2 a n =

TR/46 OCTOBER THE ZEROS OF PARTIAL SUMS OF A MACLAURIN EXPANSION A. TALBOT

Notes on iteration and Newton s method. Iteration

MATH 10550, EXAM 3 SOLUTIONS

SECTION 1.5 : SUMMATION NOTATION + WORK WITH SEQUENCES

(a) (b) All real numbers. (c) All real numbers. (d) None. to show the. (a) 3. (b) [ 7, 1) (c) ( 7, 1) (d) At x = 7. (a) (b)

Solutions to Tutorial 5 (Week 6)

Differentiable Convex Functions

Solutions to Final Exam Review Problems

Ma 530 Infinite Series I

Math 2412 Review 3(answers) kt

Alternating Series. 1 n 0 2 n n THEOREM 9.14 Alternating Series Test Let a n > 0. The alternating series. 1 n a n.

y = f x x 1. If f x = e 2x tan -1 x, then f 1 = e 2 2 e 2 p C e 2 D e 2 p+1 4

MTH 142 Exam 3 Spr 2011 Practice Problem Solutions 1

AP Calculus BC Review Applications of Derivatives (Chapter 4) and f,

Math 113 Exam 3 Practice

Curve Sketching Handout #5 Topic Interpretation Rational Functions

ENGI Series Page 6-01

Problem Cosider the curve give parametrically as x = si t ad y = + cos t for» t» ß: (a) Describe the path this traverses: Where does it start (whe t =

Solutions to Homework 7

Unit 4: Polynomial and Rational Functions

Exponential Functions and Taylor Series

Midterm Exam #2. Please staple this cover and honor pledge atop your solutions.

Sequences and Series of Functions

Chapter 6 Infinite Series

Notes 12 Asymptotic Series

LECTURES 5 AND 6: CONVERGENCE TESTS

3.2 Properties of Division 3.3 Zeros of Polynomials 3.4 Complex and Rational Zeros of Polynomials


Section 11.8: Power Series

September 2012 C1 Note. C1 Notes (Edexcel) Copyright - For AS, A2 notes and IGCSE / GCSE worksheets 1

Z ß cos x + si x R du We start with the substitutio u = si(x), so du = cos(x). The itegral becomes but +u we should chage the limits to go with the ew

We will conclude the chapter with the study a few methods and techniques which are useful

f(x) dx as we do. 2x dx x also diverges. Solution: We compute 2x dx lim

MA131 - Analysis 1. Workbook 9 Series III

Properties and Tests of Zeros of Polynomial Functions

INFINITE SEQUENCES AND SERIES

Seunghee Ye Ma 8: Week 5 Oct 28

5 Sequences and Series

Exponential and Trigonometric Functions Lesson #1

Math 113 Exam 3 Practice

Chapter 2 The Solution of Numerical Algebraic and Transcendental Equations

MIDTERM 3 CALCULUS 2. Monday, December 3, :15 PM to 6:45 PM. Name PRACTICE EXAM SOLUTIONS

Review Problems 1. ICME and MS&E Refresher Course September 19, 2011 B = C = AB = A = A 2 = A 3... C 2 = C 3 = =

1 Approximating Integrals using Taylor Polynomials

NUMERICAL METHODS FOR SOLVING EQUATIONS

1.3 Convergence Theorems of Fourier Series. k k k k. N N k 1. With this in mind, we state (without proof) the convergence of Fourier series.

ELEG 4603/5173L Digital Signal Processing Ch. 1 Discrete-Time Signals and Systems

ECE-S352 Introduction to Digital Signal Processing Lecture 3A Direct Solution of Difference Equations

x x x Using a second Taylor polynomial with remainder, find the best constant C so that for x 0,

1 Lecture 2: Sequence, Series and power series (8/14/2012)

Section 11.6 Absolute and Conditional Convergence, Root and Ratio Tests

Lecture 19: Convergence

MAT1026 Calculus II Basic Convergence Tests for Series

ENGI 9420 Lecture Notes 3 - Numerical Methods Page 3.01

MATH 372: Difference Equations

MATH301 Real Analysis (2008 Fall) Tutorial Note #7. k=1 f k (x) converges pointwise to S(x) on E if and

Carleton College, Winter 2017 Math 121, Practice Final Prof. Jones. Note: the exam will have a section of true-false questions, like the one below.

PRELIM PROBLEM SOLUTIONS

Definition An infinite sequence of numbers is an ordered set of real numbers.

Series III. Chapter Alternating Series

7.) Consider the region bounded by y = x 2, y = x - 1, x = -1 and x = 1. Find the volume of the solid produced by revolving the region around x = 3.

Topics. Homework Problems. MATH 301 Introduction to Analysis Chapter Four Sequences. 1. Definition of convergence of sequences.

Kinetics of Complex Reactions

Series: Infinite Sums

Chapter Vectors

Part I: Covers Sequence through Series Comparison Tests

CALCULATION OF FIBONACCI VECTORS

Solutions to Tutorial 3 (Week 4)

Algebra of Least Squares

For example suppose we divide the interval [0,2] into 5 equal subintervals of length

Math 257: Finite difference methods

is also known as the general term of the sequence

Math 113 Exam 4 Practice

10.1 Sequences. n term. We will deal a. a n or a n n. ( 1) n ( 1) n 1 2 ( 1) a =, 0 0,,,,, ln n. n an 2. n term.

d) If the sequence of partial sums converges to a limit L, we say that the series converges and its

Exponential Functions and Taylor Series

Enumerative & Asymptotic Combinatorics

(c) Write, but do not evaluate, an integral expression for the volume of the solid generated when R is

Recursive Algorithms. Recurrences. Recursive Algorithms Analysis

The Simplex algorithm: Introductory example. The Simplex algorithm: Introductory example (2)

The picture in figure 1.1 helps us to see that the area represents the distance traveled. Figure 1: Area represents distance travelled

Transcription:

Math 312 Lecture Notes Oe Dimesioal Maps Warre Weckesser Departmet of Mathematics Colgate Uiversity 21-23 February 25 A Example We begi with the simplest model of populatio growth. Suppose, for example, a populatio icreases by 15 percet each year. Let p be the populatio at the ed of year, ad assume that p is give. The a icrease of 15 percet each year gives p +1 = 1.15p. (1) If p = 1, the p 1 = 1.15(1) = 115, p 2 = 1.15(115) = 132.3, p 3 = 1.15(132.3) = 152.1, ad so o. Table 1 shows the first ie iteratios of this process. The data is plotted i Figure 1. We derive a formula for p by otig that p p 1. 5 21.1 1 115. 6 231.3 2 132.3 7 266. 3 152.1 8 35.9 4 174.9 9 351.8 Table 1: Iteratio of the map (1), with p = 1. p 1 = 1.15p p 2 = 1.15p 1 = (1.15) 2 p p 3 = 1.15p 2 = (1.15) 3 p. (2) p = (1.15) p Thus we have the familiar expoetial growth of the populatio. More geerally, the same argumet shows that the solutio to p +1 = ap, (3) 1

4 35 3 25 p 2 15 1 5 1 2 3 4 5 6 7 8 9 Figure 1: Plot of the data for the simple populatio growth model (1). The data is i Table 1. give p, is p = a k p. (4) Let s compare the discrete time map to the cotiuous time model. Recall that a first order differetial equatio that leads to expoetial growth (or decay) is which has the solutio dp dt = rp, p() = p, (5) p(t) = p e rt = (e r ) t p. (6) I ve writte the solutio as (e r ) t p to make clear the aalogy betwee the cotiuous solutio ad the solutio to the discrete model i (4). The term e r is aalogous to a, ad t is aalogous to. Let s rewrite (1) as p +1 = (1 +.15)p = p +.15p (7) or p +1 p =.15p. (8) This form of the equatio expresses the discrete chage i p as a fuctio of p. (Such a equatio is ofte called a differece equatio.) Compare this to equatio (5), which gives the istataeous rate of chage of p as a fuctio of p. Oe-dimesioal Maps The geeral oe-dimesioal map has the form +1 = f( ), give x. (9) 2

.1 5.6771 1.252 6.6122 2.5278 7.6648 3.6978 8.624 4.594 9.657 Table 2: Iteratio of the logistic map (1), with r = 2.8 ad x =.1. 1.8.6.4.2 1 2 3 4 5 6 7 8 9 Figure 2: The first several iterates of the logistic map (1) with r = 2.8 ad x =.1. This is a plot of the data show i Table 2. We ll develop several tools for studyig such maps. Cobwebbig : The Graphical Iteratio Procedure There is a simple graphical procedure for geeratig the iteratios of a oe-dimesioal map. As a example, we cosider the logistic map +1 = r (1 ) (1) where r > is a costat. Table 2 shows the first few iterates i the sequece that results whe r = 2.8 ad x =.1. Figure 2 shows the plot of as a fuctio of. The graphical techique for fidig the iteratios of this map begis by plottig the graph of the f(x) = rx(1 x), as i Figure 3 (where r = 2.8). Give x, we draw a lie from the x = x o the x axis up the the graph of x to obtai x 1. To obtai x 2, we eed to go to x = x 1 o the x axis. This ca be doe by drawig a lie horizotally from (x, x 1 ) to the lie y = x. See the upper left plot of Figure 4. To fid x 2, we agai draw a lie vertically at x = x 1 to the graph, ad from the graph we draw a lie horizotally to y = x. See the upper right plot of Figure 4. We cotiue this process to geerate further iteratios, as i the lower left ad right plots of Figure 4. I these plots, I ve icluded vertical lies from the x axis up to the graph, but we do t really eed these lies. I practice, the procedure is: draw a lie vertically to the graph, the draw a lie horizotally to y = x, ad the repeat the process. A example is show i Figure 5. 3

1.9.8.7.6.5.4.3.2.1.1.2.3.4.5.6.7.8.9 1 Figure 3: A graph of the logistic map rx(1 x) for r = 2.8..8.8.7.7.6.6.5.5.4.4.3.3.2.2.1.1 x x 1.5 1 x x 1.5 x 2 1.8.8.7.7.6.6.5.5.4.4.3.3.2.2.1.1 x x 1.5 x 2 x 3 1 x x 1.5 x 2 x 4 x 3 1 Figure 4: A sequece of plots that illustrate cobwebbig. The iitial poit is x =.1. 4

1.9.8.7.6.5.4.3.2.1.2.4.6.8 1 Figure 5: Whe cobwebbig, we usually do t bother droppig lies dow to the horizotal axis. After the first vertical lie is draw from (x, x ) to the graph, we draw a lie horizotally to the lie y = x, ad the aother lie vertically to graph, ad repeat. This cobweb plot shows the same data listed i Table 2 ad plotted i Figure 2. Liear Maps A liear oe-dimesioal map is +1 = a (11) where a is a costat. (The populatio model (1) is a example.) The solutio is Let s look at how the behavior of the solutio depeds o a. = a x. (12) 1. If a > 1, the a >, ad a icreases without boud as icreases. So grows expoetially. 2. If a = 1, the a = 1 for all, so = x. 3. If < a < 1, the a >, ad a approaches zero as icreases; decays to zero mootoically. 4. If a =, the = for all >. 5. If 1 < a <, the a alterates sig, ad a approaches zero as icreases; decays to zero while alteratig sig. 6. If a = 1, the a = ( 1), which is 1 if is eve ad 1 if is odd. Thus alterates betwee x ad x. 7. If a < 1, the a alterates sig, ad a icreases without boud as icreases. So alterates sig while grows expoetially. Overall, the magitude of grows if a > 1, ad decays if a < 1. Figures 6 ad 7 show sample plots of ad cobweb diagrams for the various cases. 5

3 a = 1.15 3 a = 1.15 2 2 1 +1 1 2 4 6 8 1 2 3 3 a = 1. 3 a = 1. 2 2 1 +1 1 2 4 6 8 1 2 3 3 a =.75 3 a =.75 2 2 1 +1 1 2 4 6 8 1 2 3 3 a =. 3 a =. 2 2 1 +1 1 2 4 6 8 1 2 3 Figure 6: Examples of liear maps, a. I all cases, x = 1. 6

3 2 a =.75 3 2 a =.75 1 1 +1 1 1 2 2 3 2 4 6 8 3 3 2 1 1 2 3 3 2 a = 1. 3 2 a = 1. 1 1 +1 1 1 2 2 3 2 4 6 8 3 3 2 1 1 2 3 3 2 a = 1.15 3 2 a = 1.15 1 1 +1 1 1 2 2 3 2 4 6 8 3 3 2 1 1 2 3 Figure 7: Examples of liear maps, a <. I all cases, x = 1. 7

Fixed Poits, Stability, Liearizatio A fixed poit of the map (9) is a poit x where f(x ) = x. If x = x, the = x for all >, so the fixed poits of f are the costat solutios to (9). I the logistic map show i Figure 3, we see there are two poits where f(x) = x. These are the poits where the graph of f crosses the lie y = x. For the example show i Figure 3, the graph is f(x) = 2.8x(1 x), so to fid the fixed poits, we must solve 2.8x(1 x) = x = 2.8x 2 + 1.8x = = x = or x = 1.8 2.8 (13) So the two fixed poits are x = ad x = 1.8 2.8.643. Defiitio. The fixed poit x is a sik or attractor if there is a eighborhood N of x such that x for all x i N. We also say x is asymptotically stable. Defiitio. The fixed poit x is a source or repellor if there is a eighborhood N of x such that if x is i N, the evetually leaves N. Defiitio. The fixed poit x is ustable if for every eighborhood N of x, there are poits arbitrarily close to x whose iterates leave N. Note that a source is ustable, but a ustable fixed poit is ot ecessarily a source. See, for example, Figure 1. Behavior ear a fixed poit: the liearizatio. Let x be a fixed poit of (9). If x is close to x, we ca approximate f(x) with the taget lie at x : f(x) f(x ) + f (x )(x x ). (14) Let u = x (i.e. = x + u ). The, by replacig with x + u i (9), we obtai x + u +1 = f(x + u ) f(x ) + f (x )u. (15) Sice f(x ) = x, we ca cacel x o the left ad f(x ) o the right. We are left with the liearizatio of the map at x : u +1 = f (x )u (16) This is a liear map. We have already see how the solutio to the liear map depeds o a = f (x ); see Figures 6 ad 7. However, the liearizatio is just a approximatio to the actual map (9). The followig theorem tells us whe the liear approximatio is good eough to classify the stability of the fixed poit x of (9). Theorem 1. (i) If f (x ) < 1, the x is a sik. (ii) If f (x ) > 1, the x is a source. 8

.6.4.2 +1.2.4.6.6.4.2.2.4.6 Figure 8: A example that shows why we ca ot determie the stability of a fixed poit based o the liearizatio whe f (x ) = 1. The fixed poit is x =, ad f (x ) = 1. I this case, x is a source. Example. Cosider agai the logistic map (1) with r = 2.8. The graph is show i Figure 3, ad earlier we foud the fixed poits to be x 1 = ad x 2 = 1.8 2.8. We fid We use Theorem 1 to determie the stability of the fixed poits. f (x) = 2.8(1 2x). (17) At x 1, we have f () = 2.8 > 1, so by Theorem 1, x 1 is a source. At x 2, we have f (1.8/2.8) =.8, so by Theorem 1, x 2 is a sik. If f (x ) = 1, we ca ot make ay coclusios about the stability of the fixed poit. Examples demostratig why this is the case are show i Figures 8, 9 ad 1. 9

.5.4.3.2.1 +1.1.2.3.4.5 1.5.5 1 Figure 9: A example that shows why we ca ot determie the stability of a fixed poit based o the liearizatio whe f (x ) = 1. The fixed poit is x =, ad f (x ) = 1. I this case, x is a sik. 1.9.8.7.6 +1.5.4.3.2.1.5 1 Figure 1: Aother example that shows why we ca ot determie the stability of a fixed poit based o the liearizatio whe f (x ) = 1. I this case, x = 1/2 is a fixed poit, ad f (x ) = 1. The iteratios of poits close to but less tha x coverge to x, but iteratios of poits that are greater tha x diverge from x. I this case, x is ustable (but it is ot a source). 1