MATH 372: Difference Equations
|
|
- Emmeline Walsh
- 5 years ago
- Views:
Transcription
1 MATH 372: Differece Equatios G. de Vries February 23, Itroductio I this chapter, we use discrete models to describe dyamical pheomea i biology. Discrete models are appropriate whe oe ca thik about the pheomeo i terms of discrete time steps, or whe oe wishes to describe experimetal measuremets that have bee collected at fixed time itervals. I geeral, we are cocered with a sequece of quatities, x 0, x 1, x 2, x 3, x 4,..., where x i deotes the quatity at the i-th measuremet or after i time steps. For example, x i may represet the size of a populatio of mosquito isects i year i; the proportio of idividuals i a populatio carryig a particular gee i the i-th geeratio; the umber of cells i a bacterial culture o day i; the cocetratio of oxyge i the lug after the i-th breath; the cocetratio i the blood of a drug after the i-th dose. You ca udoubtedly thik of may more such examples. Note that the time step may or may ot be costat. I the example of the bacterial culture, the time step is fixed to be a day, but i the example of the oxyge cocetratio i the lug, the time step is variable from breath to breath. Also, time steps ca be aywhere from millisecods to years, depedig o the biological problem at had. We ca ow ask ourselves, what does it mea to build a discrete model? I the cotext of our sequece of quatities x i, a discrete model is a rule describig how the quatities chage. I particular, a discrete model describes how x +1 depeds o x (ad perhaps x 1, x 2,... ). Restrictig ourselves to the case where x +1 depeds o x aloe, a model the is a sort of updatig fuctio [1], of the form x +1 = f(x ), (1) 1
2 x : iput or measuremet after time steps updatig fuctio x +1 : output or measuremet after +1 time steps Figure 1: This is the updatig fuctio as show i Figure 1. The equatio x +1 = f(x ) ofte is referred to as a map. Fidig the precise fuctio f that describes a set of experimetal data or that gives a certai desired type of behaviour is ot always straightforward. I fact, it is ofte said that modellig (fidig the right fuctio f) is more of a art tha a sciece. I ay case, it geerally is a iterative process. Oe starts with a particular fuctio f, ad the makes adjustmets. Isight ito how a fuctio f should be adjusted ca ofte be obtaied from kowledge of the behaviour of the curret model. The remaider of this chapter discusses techiques that ca aid i the aalysis of a discrete model. 2 Simple populatio models We begi by aalyzig oe of the simplest maps, with f(x ) = rx, givig the liear map x +1 = rx. (2) For cocreteess, let us thik of x as the size of a isect populatio after years, or durig the -th geeratio. Here, r > 0 is a model parameter represetig the et reproductio rate of the populatio. The model thus says that ext year s populatio is proportioal to this year s populatio. If we let x 0 be the populatio of isects at the start of the study, the x 1 = rx 0, x 2 = rx 1 = r(rx 0 ) = r 2 x 0,. x = r x 0. The resultig sequece x 0, x 1, x 2,... is called a orbit of the map (startig with differet iitial populatios x 0 gives differet orbits). 2
3 x x (a) (b) Figure 2: (a) Geometric growth for r > 1; (b) Geometric decay for 0 < r < 1. x +1 x +1 x +1 0 x 0 x 0 K/2 K (a) Liear map (b) Verhulst process (c) Ricker curve x Figure 3: (a) Liear map; (b) Verhulst process; (c) Ricker curve. It should be clear that the isect populatio grows without boud if r > 1 (for example, if r = 2, we obtai the sequece x 0, 2x 0, 4x 0, 8x 0,...), as show i Figure 2(a). Similarly, the isect populatio shriks ad evetually goes extict if 0 < r < 1 (for example, if r = 1 2, we obtai the orbit 1 x 0, 2 x 1 0, 4 x 1 0, 8 x 0,...), as show i Figure 2(b). Whe the value of r is precisely 1, the populatio either grows or shriks, but stays costat at its iitial value x 0. Of course, this simple model is ot very realistic for describig the logterm growth of ay populatio. There is ot a populatio whose growth will ot stagate evetually due to competitio for limited resources amog the idividuals. The problem with this simple model is that it is based o the assumptio that the reproductio rate always is the same, o matter whether the populatio is large or small. Figure 3(a) shows the graph of x +1 versus x for our curret model, (2). The graph is a straight lie with slope r. To take ito accout the effects of overcrowdig, we require a graph with a local maximum. A possibility is show i Figure 3(b), correspodig to the followig equatio: ( x +1 = rx 1 x ), (3) K with r > 0 ad K > 0. The graph of this equatio is a cocave-dow parabola, with roots at 3
4 x = 0 ad x = K, ad the maximum at x = K/2, as show i Figure 3(b). This model of populatio growth is referred to as the Verhulst process, or the discrete logistic equatio (we will ecouter the cotiuous versio of the logistic equatio i Chapter XXX). It should be clear that if the populatio durig ay year exceeds K/2, the populatio a year later is less tha K/2. That is, the populatio is self-regulatig. Oe complicatio with this model is that if the populatio durig ay year exceeds K, the populatio a year later is egative. To esure that the populatio always remais oegative, aother adjustmet ca be made to the model. Figure 3(c) shows the Ricker curve [2], give by [ ( x +1 = x exp r 1 x K )], (4) with r > 0 ad K > 0. We ca thik of the factor exp(r) as a costat reproductio factor, ad of the factor exp ( rx /K) as a mortality factor. The larger the populatio x, the more severe the mortality factor. As before, this populatio is self-regulatig. Both the Verhulst process ad the Ricker model are examples of oliear models. I cotrast to the liear map from the begiig of this sectio, the dyamical behaviour of these models is much more iterestig, ad ofte uituitive. There are may tools that allow us to predict the dyamical behaviour of these models, ad most of the rest of this chapter is devoted to developig ad explorig such tools i the cotext of the Verhulst process. The Ricker model will be ecoutered agai i the Maple sectio of this book, i Chapter XXX. 3 Cobwebbig, Fixed Poits, ad Stability Aalysis For all the models we have looked at so far, if we kow the values of the model parameters, plus a iitial coditio x 0, the we ca sequetially fid the etire orbit, that is, the iterates x 1, x 2, x 3,..., oe after the other. With the fast computers of today, it is easy to geerate may orbits ad deduce the dyamics of the model. However, it is easy to miss some subtle behaviour. We ofte ca gai valuable isight ito the model dyamics from sophisticated, but easy to lear, mathematical techiques. We will examie a few of such techiques i this sectio. Oe of the questios we would like to address is the logterm dyamics of the model. I the case of the liear map 2, we ca easily predict the -th iterate, amely x = r x 0, ad deduce that there is expoetial growth whe r > 1 ad expoetial decay if 0 < r < 1. I geeral, it is ot possible to write dow a formula for x if the model is oliear. However, we ca obtai a aswer to our questio from cobwebbig. Cobwebbig is a graphical solutio method, a method for visualizig the orbits ad their logterm behaviour without explicitly calculatig each ad every iterate alog the way. We demostrate the cobwebbig techique i Figure 4. Figure 4 shows the graphs of a fuctio x +1 = f(x ) ad the straight lie x +1 = x. We choose our first iterate, x 0, o the horizotal axis. The ext iterate is x 1 = f(x 0 ), which we ca just read off the parabola. Visually, this is show by a vertical lie from x 0 o the horizotal axis to the poit (x 0, x 1 ) o the parabola. The ext iterate, x 2, ca be obtaied i a similar way from x 1. We first eed to locate x 1 o the horizotal axis. We already have x 1 o the vertical axis, ad the easiest way to get it oto the horizotal 4
5 x +1 y = rx (1 x /K) = f(x) x 2 y = x x 0 x 3 x 3 x 0 x 1 x 2 x Figure 4: Cobwebbig for the logistic equatio, (3). This figure should be chaged slightly - choose r betwee 1 ad 3 so that the otrivial fixed poit is stable, ad the cobwebbig procedure gives a ice staircase as i the ext figure. axis is to reflect it through the diagoal lie x +1 = x. Visually, this is show by a horizotal lie from x 1 o the vertical axis to the poit (x 1, x 1 ) o the diagoal lie, ad the a vertical lie from the poit (x 1, x 1 ) o the diagoal lie to x 1 o the horizotal axis. I summary, oe starts by travellig from x 0 vertically to the parabola, the horizotally to the diagoal lie, vertically to the parabola, ad so o, as idicated by the solid portio of the vertical ad horizotal lies o the cobwebbig diagram i Figure 4. I this particular case, the orbit coverges to the itersectio of the parabola ad the diagoal lie. Ay itersectio of the parabola ad the diagoal lie represets a special poit. Let x be such a poit. The f(x ) = x. We call ay such poit a fixed poit or a equilibrium poit of the model. If ay iterate is x, the all subsequet iterates also are x. A questio of iterest is what happes whe a iterate is close to, but ot exactly at, a fixed poit. Do subsequet fixed poits move closer to the fixed poit or further away? I the former case, the fixed poit is said to be stable, whereas i the latter case, the fixed poit is said to be ustable. Examples of both stable ad ustable fixed poits are show i Figure 5. The three fixed poits show are x 1, x 2, ad x 3. Choosig a iitial coditio x 0 just to the left of x 2, we see that the orbit moves away from x 2, ad towards x 1. Similarly, choosig a iitial coditio x 0 just to the right of x 2, we see tha the orbit agai moves away from x 2, but ow towards x 3. We say that x 1 ad x 3 are stable fixed poits, ad x 2 is a ustable fixed poit of the model x +1 = f(x ). From Figure 5, it appears that the slope of f at the fixed poit has somethig to do with the stability of that fixed poit. I particular, the slope of f at the stable fixed poits x 1 ad x 3 is less tha 1 (the slope of the straight diagoal lie), whereas the slope of f at the ustable fixed poit x 2 is greater tha 1. We ca formalize these ideas via a liear stability aalysis, as follows: We choose the -th iterate to be close to a fixed poit x of (1), x = x + y, (5) 5
6 x +1 x +1 = x x +1 = f (x ) x* x 0 x* x 1 0 x* 2 3 x Figure 5: Illustratio of stable ad ustable fixed poits of the differece equatio x +1 = f(x ). The fixed poits x 1 ad x 3 are stable, ad the fixed poit x 2 is ustable. with y small, so that x ca be thought of as a perturbatio of x. The questio of iterest ow is what happes to y, the deviatio of x from x, as the map is iterated. If the deviatio grows, the the fixed poit x is ustable, ad if the deviatio shriks, the it is stable. We ca fid the map for the deviatio by substitutig (5) ito (1) to obtai x + y +1 = f(x + y ). (6) We expad the right had side usig a Taylor series about x to obtai x + y +1 = f(x ) + f (x )y + O(y 2 ). (7) Sice x is a fixed poit, we ca replace f(x ) o the right had side by x. If, i additio, we ca safely eglect all the terms i the Taylor series that have bee collected i the term O(y 2 ), the we are left with a map for the deviatio, y +1 = f (x )y. (8) We recogize that f (x ) is some costat, λ say. The map for the deviatio thus is the liear map y +1 = λy. (9) We ve already looked at the liear map i the cotext of populatio growth, (2). There, we restricted the growth parameter to be > 0. Here, f(x ) ca take o ay value, depedig o the map f, ad so there are o restrictios o λ. The behaviour of the deviatio y, ad the subsequet coclusio regardig the stability of the fixed poit x, ca be summarized as follows: λ > 1: geometric growth, fixed poit x is ustable; 0 < λ < 1: geometric decay, fixed poit x is stable; 1 < λ < 0: geometric decay with sig switch, fixed poit x is stable; λ < 1: geometric growth with sig switch, fixed poit x is ustable. 6
7 x x (a) (b) x x (c) (d) Figure 6: Behaviour of the geeral liear map, (9), for the cases (a) λ > 1; (b) 0 < λ < 1; (c) 1 < λ < 0; (d) λ < 1. The four cases are illustrated i Figure 6. Note that o coclusio ca be reached whe λ = ±1. These two cases require advaced treatmet, ivolvig a careful examiatio of the eglected terms collectig i the term O(y 2 ) i (7), which is beyod the scope of this book. For treatmet of these cases, the reader is referred to a textbook o discrete equatios, for example CITE SOMETHING HERE. More geerally, we ca summarize the results of the aalysis as follows: x is stable whe λ = f (x ) < 1, x is ustable whe λ = f (x ) > 1, there is o coclusio about the stability of x whe λ = f (x ) = 1. That is, the liear stability of a fixed poit x is determied by the slope of the map at the fixed poit, λ = f(x ). The parameter λ is geerally referred to as the eigevalue of the map at x. 4 Aalysis of the Discrete Logistic Map We ow retur to the logistic map, (3), ad apply the tools discussed i the previous sectio to this map. We begi with applyig the trasformatio x = x K to elimiate the parameter K, ad 7
8 _ x ustable 2/3 _ x = (r 1)/r stable stable ustable case 1 case 2 case 3 r Figure 7: Partial bifurcatio diagram for the rescaled logistic map, (10). Show are the fixed poits ad their stability as a fuctio of the model parameter r. Solid lies idicate stability of the fixed poit, ad dashed lies idicate istability. obtai x +1 = f(x ) = rx (1 x ) (10) after droppig the overbars. Note that if we have x > 1, the x +1 < 0. To avoid such situatios, we impose the restrictio 0 r 4, so that x [0, 1]. The fixed poits of the map ca be foud exactly by settig f(x ) = x ad solvig for x. There are two fixed poits. The trivial fixed poit, x = 0, always exists, while the otrivial fixed poit, x = r 1 r, exists oly whe r > 1. To determie the stability of the fixed poits, we eed f (x), which is f (x) = r(1 2x). (11) At the trivial fixed poit, x = 0, the derivative is f (0) = r. That is, the trivial fixed poit is stable for 0 r < 1, ad ustable for 1 < r 4. At the otrivial fixed poit, x = r 1 r, we have f ( r 1 r ) = 2 r. That is, the otrivial fixed poit is stable for 1 < r < 3, ad ustable for 3 < r 4. The existece ad stability of the fixed poits is summarized i the bifurcatio diagram of the fixed poits versus the parameter r, show i Figure 7. Readig the diagram from left to right, ote that the trivial fixed poit becomes ustable as soo as the otrivial fixed poits come oto the scee at r = 1. The otrivial fixed poit is stable iitially, but loses its stability at r = 3. The two poits r = 1 ad r = 3 are kow as bifurcatio poits. A bifurcatio poit is a parameter value at which there is a qualitative chage i the dyamics of the map. The bifurcatio at r = 1 is called a trascritical bifurcatio. There are may other types of bifurcatios. A detailed discussio of bifurcatio theory is beyod the scope of this course, as is a detailed discussio of the dyamics of the logistic model for the case 3 < r <= 4. The iterested reader is referred to [3]. 8
9 Refereces [1] F. Adler, Modelig the Dyamics of Life: Calculus ad Probability for Life Scietists, Brooks/Cole, Pacific Grove, CA, [2] W. E. Ricker, Stock ad recruitmet, J. Fisheries Res. Board of Caada, 11 (1954), pp [3] S. Strogatz, Noliear Dyamics ad Chaos: with Applicatios to Physics, Biology, Chemistry, ad Egieerig, Addiso-Wesley Publishig Compay, Readig, MA,
Math 312 Lecture Notes One Dimensional Maps
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,
More information6.3 Testing Series With Positive Terms
6.3. TESTING SERIES WITH POSITIVE TERMS 307 6.3 Testig Series With Positive Terms 6.3. Review of what is kow up to ow I theory, testig a series a i for covergece amouts to fidig the i= sequece of partial
More informationInfinite Sequences and Series
Chapter 6 Ifiite Sequeces ad Series 6.1 Ifiite Sequeces 6.1.1 Elemetary Cocepts Simply speakig, a sequece is a ordered list of umbers writte: {a 1, a 2, a 3,...a, a +1,...} where the elemets a i represet
More informationNotes on iteration and Newton s method. Iteration
Notes o iteratio ad Newto s method Iteratio Iteratio meas doig somethig over ad over. I our cotet, a iteratio is a sequece of umbers, vectors, fuctios, etc. geerated by a iteratio rule of the type 1 f
More informationRecursive Algorithms. Recurrences. Recursive Algorithms Analysis
Recursive Algorithms Recurreces Computer Sciece & Egieerig 35: Discrete Mathematics Christopher M Bourke cbourke@cseuledu A recursive algorithm is oe i which objects are defied i terms of other objects
More informationChapter 4. Fourier Series
Chapter 4. Fourier Series At this poit we are ready to ow cosider the caoical equatios. Cosider, for eample the heat equatio u t = u, < (4.) subject to u(, ) = si, u(, t) = u(, t) =. (4.) Here,
More informationNUMERICAL METHODS FOR SOLVING EQUATIONS
Mathematics Revisio Guides Numerical Methods for Solvig Equatios Page 1 of 11 M.K. HOME TUITION Mathematics Revisio Guides Level: GCSE Higher Tier NUMERICAL METHODS FOR SOLVING EQUATIONS Versio:. Date:
More informationCHAPTER 10 INFINITE SEQUENCES AND SERIES
CHAPTER 10 INFINITE SEQUENCES AND SERIES 10.1 Sequeces 10.2 Ifiite Series 10.3 The Itegral Tests 10.4 Compariso Tests 10.5 The Ratio ad Root Tests 10.6 Alteratig Series: Absolute ad Coditioal Covergece
More informationA sequence of numbers is a function whose domain is the positive integers. We can see that the sequence
Sequeces A sequece of umbers is a fuctio whose domai is the positive itegers. We ca see that the sequece,, 2, 2, 3, 3,... is a fuctio from the positive itegers whe we write the first sequece elemet as
More informationSECTION 1.5 : SUMMATION NOTATION + WORK WITH SEQUENCES
SECTION 1.5 : SUMMATION NOTATION + WORK WITH SEQUENCES Read Sectio 1.5 (pages 5 9) Overview I Sectio 1.5 we lear to work with summatio otatio ad formulas. We will also itroduce a brief overview of sequeces,
More informationChapter 6 Sampling Distributions
Chapter 6 Samplig Distributios 1 I most experimets, we have more tha oe measuremet for ay give variable, each measuremet beig associated with oe radomly selected a member of a populatio. Hece we eed to
More informationSequences A sequence of numbers is a function whose domain is the positive integers. We can see that the sequence
Sequeces A sequece of umbers is a fuctio whose domai is the positive itegers. We ca see that the sequece 1, 1, 2, 2, 3, 3,... is a fuctio from the positive itegers whe we write the first sequece elemet
More informationMath 113 Exam 3 Practice
Math Exam Practice Exam will cover.-.9. This sheet has three sectios. The first sectio will remid you about techiques ad formulas that you should kow. The secod gives a umber of practice questios for you
More informationEssential Question How can you recognize an arithmetic sequence from its graph?
. Aalyzig Arithmetic Sequeces ad Series COMMON CORE Learig Stadards HSF-IF.A.3 HSF-BF.A. HSF-LE.A. Essetial Questio How ca you recogize a arithmetic sequece from its graph? I a arithmetic sequece, the
More informationChapter 10: Power Series
Chapter : Power Series 57 Chapter Overview: Power Series The reaso series are part of a Calculus course is that there are fuctios which caot be itegrated. All power series, though, ca be itegrated because
More informationSection 1.1. Calculus: Areas And Tangents. Difference Equations to Differential Equations
Differece Equatios to Differetial Equatios Sectio. Calculus: Areas Ad Tagets The study of calculus begis with questios about chage. What happes to the velocity of a swigig pedulum as its positio chages?
More informationOptimally Sparse SVMs
A. Proof of Lemma 3. We here prove a lower boud o the umber of support vectors to achieve geeralizatio bouds of the form which we cosider. Importatly, this result holds ot oly for liear classifiers, but
More informationx a x a Lecture 2 Series (See Chapter 1 in Boas)
Lecture Series (See Chapter i Boas) A basic ad very powerful (if pedestria, recall we are lazy AD smart) way to solve ay differetial (or itegral) equatio is via a series expasio of the correspodig solutio
More informationPolynomial Functions and Their Graphs
Polyomial Fuctios ad Their Graphs I this sectio we begi the study of fuctios defied by polyomial expressios. Polyomial ad ratioal fuctios are the most commo fuctios used to model data, ad are used extesively
More informationChapter 22. Comparing Two Proportions. Copyright 2010 Pearson Education, Inc.
Chapter 22 Comparig Two Proportios Copyright 2010 Pearso Educatio, Ic. Comparig Two Proportios Comparisos betwee two percetages are much more commo tha questios about isolated percetages. Ad they are more
More information1 Inferential Methods for Correlation and Regression Analysis
1 Iferetial Methods for Correlatio ad Regressio Aalysis I the chapter o Correlatio ad Regressio Aalysis tools for describig bivariate cotiuous data were itroduced. The sample Pearso Correlatio Coefficiet
More information4.3 Growth Rates of Solutions to Recurrences
4.3. GROWTH RATES OF SOLUTIONS TO RECURRENCES 81 4.3 Growth Rates of Solutios to Recurreces 4.3.1 Divide ad Coquer Algorithms Oe of the most basic ad powerful algorithmic techiques is divide ad coquer.
More informationACCESS TO SCIENCE, ENGINEERING AND AGRICULTURE: MATHEMATICS 1 MATH00030 SEMESTER / Statistics
ACCESS TO SCIENCE, ENGINEERING AND AGRICULTURE: MATHEMATICS 1 MATH00030 SEMESTER 1 018/019 DR. ANTHONY BROWN 8. Statistics 8.1. Measures of Cetre: Mea, Media ad Mode. If we have a series of umbers the
More informationFeedback in Iterative Algorithms
Feedback i Iterative Algorithms Charles Byre (Charles Byre@uml.edu), Departmet of Mathematical Scieces, Uiversity of Massachusetts Lowell, Lowell, MA 01854 October 17, 2005 Abstract Whe the oegative system
More information1 Generating functions for balls in boxes
Math 566 Fall 05 Some otes o geeratig fuctios Give a sequece a 0, a, a,..., a,..., a geeratig fuctio some way of represetig the sequece as a fuctio. There are may ways to do this, with the most commo ways
More informationFrequentist Inference
Frequetist Iferece The topics of the ext three sectios are useful applicatios of the Cetral Limit Theorem. Without kowig aythig about the uderlyig distributio of a sequece of radom variables {X i }, for
More informationCastiel, Supernatural, Season 6, Episode 18
13 Differetial Equatios the aswer to your questio ca best be epressed as a series of partial differetial equatios... Castiel, Superatural, Seaso 6, Episode 18 A differetial equatio is a mathematical equatio
More informationSeptember 2012 C1 Note. C1 Notes (Edexcel) Copyright - For AS, A2 notes and IGCSE / GCSE worksheets 1
September 0 s (Edecel) Copyright www.pgmaths.co.uk - For AS, A otes ad IGCSE / GCSE worksheets September 0 Copyright www.pgmaths.co.uk - For AS, A otes ad IGCSE / GCSE worksheets September 0 Copyright
More information(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)
Chapter 0 Review 597. E; a ( + )( + ) + + S S + S + + + + + + S lim + l. D; a diverges by the Itegral l k Test sice d lim [(l ) ], so k l ( ) does ot coverge absolutely. But it coverges by the Alteratig
More informationMath 113, Calculus II Winter 2007 Final Exam Solutions
Math, Calculus II Witer 7 Fial Exam Solutios (5 poits) Use the limit defiitio of the defiite itegral ad the sum formulas to compute x x + dx The check your aswer usig the Evaluatio Theorem Solutio: I this
More informationRecurrence Relations
Recurrece Relatios Aalysis of recursive algorithms, such as: it factorial (it ) { if (==0) retur ; else retur ( * factorial(-)); } Let t be the umber of multiplicatios eeded to calculate factorial(). The
More informationMath 113 Exam 3 Practice
Math Exam Practice Exam 4 will cover.-., 0. ad 0.. Note that eve though. was tested i exam, questios from that sectios may also be o this exam. For practice problems o., refer to the last review. This
More informationf(x) dx as we do. 2x dx x also diverges. Solution: We compute 2x dx lim
Math 3, Sectio 2. (25 poits) Why we defie f(x) dx as we do. (a) Show that the improper itegral diverges. Hece the improper itegral x 2 + x 2 + b also diverges. Solutio: We compute x 2 + = lim b x 2 + =
More informationSTA Learning Objectives. Population Proportions. Module 10 Comparing Two Proportions. Upon completing this module, you should be able to:
STA 2023 Module 10 Comparig Two Proportios Learig Objectives Upo completig this module, you should be able to: 1. Perform large-sample ifereces (hypothesis test ad cofidece itervals) to compare two populatio
More informationENGI Series Page 6-01
ENGI 3425 6 Series Page 6-01 6. Series Cotets: 6.01 Sequeces; geeral term, limits, covergece 6.02 Series; summatio otatio, covergece, divergece test 6.03 Stadard Series; telescopig series, geometric series,
More informationSignals & Systems Chapter3
Sigals & Systems Chapter3 1.2 Discrete-Time (D-T) Sigals Electroic systems do most of the processig of a sigal usig a computer. A computer ca t directly process a C-T sigal but istead eeds a stream of
More informationChapter 22. Comparing Two Proportions. Copyright 2010, 2007, 2004 Pearson Education, Inc.
Chapter 22 Comparig Two Proportios Copyright 2010, 2007, 2004 Pearso Educatio, Ic. Comparig Two Proportios Read the first two paragraphs of pg 504. Comparisos betwee two percetages are much more commo
More informationRiemann Sums y = f (x)
Riema Sums Recall that we have previously discussed the area problem I its simplest form we ca state it this way: The Area Problem Let f be a cotiuous, o-egative fuctio o the closed iterval [a, b] Fid
More informationMAT1026 Calculus II Basic Convergence Tests for Series
MAT026 Calculus II Basic Covergece Tests for Series Egi MERMUT 202.03.08 Dokuz Eylül Uiversity Faculty of Sciece Departmet of Mathematics İzmir/TURKEY Cotets Mootoe Covergece Theorem 2 2 Series of Real
More informationMIDTERM 3 CALCULUS 2. Monday, December 3, :15 PM to 6:45 PM. Name PRACTICE EXAM SOLUTIONS
MIDTERM 3 CALCULUS MATH 300 FALL 08 Moday, December 3, 08 5:5 PM to 6:45 PM Name PRACTICE EXAM S Please aswer all of the questios, ad show your work. You must explai your aswers to get credit. You will
More informationChapter 23. The Economics of Resources. Chapter Outline. Chapter Summary
Chapter 23 The Ecoomics of Resources Chapter Outlie Itroductio Sectio 23. Growth Models for Biological Populatios Sectio 23.2 How Log Ca a Noreewable Resource Last? Sectio 23.3 Sustaiig Reewable Resources
More informationChapter 2 The Solution of Numerical Algebraic and Transcendental Equations
Chapter The Solutio of Numerical Algebraic ad Trascedetal Equatios Itroductio I this chapter we shall discuss some umerical methods for solvig algebraic ad trascedetal equatios. The equatio f( is said
More informationMATH301 Real Analysis (2008 Fall) Tutorial Note #7. k=1 f k (x) converges pointwise to S(x) on E if and
MATH01 Real Aalysis (2008 Fall) Tutorial Note #7 Sequece ad Series of fuctio 1: Poitwise Covergece ad Uiform Covergece Part I: Poitwise Covergece Defiitio of poitwise covergece: A sequece of fuctios f
More information3.2 Properties of Division 3.3 Zeros of Polynomials 3.4 Complex and Rational Zeros of Polynomials
Math 60 www.timetodare.com 3. Properties of Divisio 3.3 Zeros of Polyomials 3.4 Complex ad Ratioal Zeros of Polyomials I these sectios we will study polyomials algebraically. Most of our work will be cocered
More informationKinetics of Complex Reactions
Kietics of Complex Reactios by Flick Colema Departmet of Chemistry Wellesley College Wellesley MA 28 wcolema@wellesley.edu Copyright Flick Colema 996. All rights reserved. You are welcome to use this documet
More informationMA131 - Analysis 1. Workbook 2 Sequences I
MA3 - Aalysis Workbook 2 Sequeces I Autum 203 Cotets 2 Sequeces I 2. Itroductio.............................. 2.2 Icreasig ad Decreasig Sequeces................ 2 2.3 Bouded Sequeces..........................
More informationSigma notation. 2.1 Introduction
Sigma otatio. Itroductio We use sigma otatio to idicate the summatio process whe we have several (or ifiitely may) terms to add up. You may have see sigma otatio i earlier courses. It is used to idicate
More information(b) What is the probability that a particle reaches the upper boundary n before the lower boundary m?
MATH 529 The Boudary Problem The drukard s walk (or boudary problem) is oe of the most famous problems i the theory of radom walks. Oe versio of the problem is described as follows: Suppose a particle
More informationZeros of Polynomials
Math 160 www.timetodare.com 4.5 4.6 Zeros of Polyomials I these sectios we will study polyomials algebraically. Most of our work will be cocered with fidig the solutios of polyomial equatios of ay degree
More information4x 2. (n+1) x 3 n+1. = lim. 4x 2 n+1 n3 n. n 4x 2 = lim = 3
Exam Problems (x. Give the series (, fid the values of x for which this power series coverges. Also =0 state clearly what the radius of covergece is. We start by settig up the Ratio Test: x ( x x ( x x
More information10.6 ALTERNATING SERIES
0.6 Alteratig Series Cotemporary Calculus 0.6 ALTERNATING SERIES I the last two sectios we cosidered tests for the covergece of series whose terms were all positive. I this sectio we examie series whose
More informationStability Analysis of the Euler Discretization for SIR Epidemic Model
Stability Aalysis of the Euler Discretizatio for SIR Epidemic Model Agus Suryato Departmet of Mathematics, Faculty of Scieces, Brawijaya Uiversity, Jl Vetera Malag 6545 Idoesia Abstract I this paper we
More informationMath 155 (Lecture 3)
Math 55 (Lecture 3) September 8, I this lecture, we ll cosider the aswer to oe of the most basic coutig problems i combiatorics Questio How may ways are there to choose a -elemet subset of the set {,,,
More informationChapter 6 Overview: Sequences and Numerical Series. For the purposes of AP, this topic is broken into four basic subtopics:
Chapter 6 Overview: Sequeces ad Numerical Series I most texts, the topic of sequeces ad series appears, at first, to be a side topic. There are almost o derivatives or itegrals (which is what most studets
More informationA 2nTH ORDER LINEAR DIFFERENCE EQUATION
A 2TH ORDER LINEAR DIFFERENCE EQUATION Doug Aderso Departmet of Mathematics ad Computer Sciece, Cocordia College Moorhead, MN 56562, USA ABSTRACT: We give a formulatio of geeralized zeros ad (, )-discojugacy
More information(3) If you replace row i of A by its sum with a multiple of another row, then the determinant is unchanged! Expand across the i th row:
Math 5-4 Tue Feb 4 Cotiue with sectio 36 Determiats The effective way to compute determiats for larger-sized matrices without lots of zeroes is to ot use the defiitio, but rather to use the followig facts,
More informationSequences I. Chapter Introduction
Chapter 2 Sequeces I 2. Itroductio A sequece is a list of umbers i a defiite order so that we kow which umber is i the first place, which umber is i the secod place ad, for ay atural umber, we kow which
More informationFall 2013 MTH431/531 Real analysis Section Notes
Fall 013 MTH431/531 Real aalysis Sectio 8.1-8. Notes Yi Su 013.11.1 1. Defiitio of uiform covergece. We look at a sequece of fuctios f (x) ad study the coverget property. Notice we have two parameters
More information62. 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 +
62. Power series Defiitio 16. (Power series) Give a sequece {c }, the series c x = c 0 + c 1 x + c 2 x 2 + c 3 x 3 + is called a power series i the variable x. The umbers c are called the coefficiets of
More information( 1) n (4x + 1) n. n=0
Problem 1 (10.6, #). Fid the radius of covergece for the series: ( 1) (4x + 1). For what values of x does the series coverge absolutely, ad for what values of x does the series coverge coditioally? Solutio.
More informationAlternating Series. 1 n 0 2 n n THEOREM 9.14 Alternating Series Test Let a n > 0. The alternating series. 1 n a n.
0_0905.qxd //0 :7 PM Page SECTION 9.5 Alteratig Series Sectio 9.5 Alteratig Series Use the Alteratig Series Test to determie whether a ifiite series coverges. Use the Alteratig Series Remaider to approximate
More informationA quick activity - Central Limit Theorem and Proportions. Lecture 21: Testing Proportions. Results from the GSS. Statistics and the General Population
A quick activity - Cetral Limit Theorem ad Proportios Lecture 21: Testig Proportios Statistics 10 Coli Rudel Flip a coi 30 times this is goig to get loud! Record the umber of heads you obtaied ad calculate
More informationThe Pendulum. Purpose
The Pedulum Purpose To carry out a example illustratig how physics approaches ad solves problems. The example used here is to explore the differet factors that determie the period of motio of a pedulum.
More informationECE-S352 Introduction to Digital Signal Processing Lecture 3A Direct Solution of Difference Equations
ECE-S352 Itroductio to Digital Sigal Processig Lecture 3A Direct Solutio of Differece Equatios Discrete Time Systems Described by Differece Equatios Uit impulse (sample) respose h() of a DT system allows
More informationLecture 6 Chi Square Distribution (χ 2 ) and Least Squares Fitting
Lecture 6 Chi Square Distributio (χ ) ad Least Squares Fittig Chi Square Distributio (χ ) Suppose: We have a set of measuremets {x 1, x, x }. We kow the true value of each x i (x t1, x t, x t ). We would
More informationIntroduction to Signals and Systems, Part V: Lecture Summary
EEL33: Discrete-Time Sigals ad Systems Itroductio to Sigals ad Systems, Part V: Lecture Summary Itroductio to Sigals ad Systems, Part V: Lecture Summary So far we have oly looked at examples of o-recursive
More informationChapter 7: Numerical Series
Chapter 7: Numerical Series Chapter 7 Overview: Sequeces ad Numerical Series I most texts, the topic of sequeces ad series appears, at first, to be a side topic. There are almost o derivatives or itegrals
More informationTime-Domain Representations of LTI Systems
2.1 Itroductio Objectives: 1. Impulse resposes of LTI systems 2. Liear costat-coefficiets differetial or differece equatios of LTI systems 3. Bloc diagram represetatios of LTI systems 4. State-variable
More information3. Z Transform. Recall that the Fourier transform (FT) of a DT signal xn [ ] is ( ) [ ] = In order for the FT to exist in the finite magnitude sense,
3. Z Trasform Referece: Etire Chapter 3 of text. Recall that the Fourier trasform (FT) of a DT sigal x [ ] is ω ( ) [ ] X e = j jω k = xe I order for the FT to exist i the fiite magitude sese, S = x [
More informationChapter 6 Principles of Data Reduction
Chapter 6 for BST 695: Special Topics i Statistical Theory. Kui Zhag, 0 Chapter 6 Priciples of Data Reductio Sectio 6. Itroductio Goal: To summarize or reduce the data X, X,, X to get iformatio about a
More informationOn an Application of Bayesian Estimation
O a Applicatio of ayesia Estimatio KIYOHARU TANAKA School of Sciece ad Egieerig, Kiki Uiversity, Kowakae, Higashi-Osaka, JAPAN Email: ktaaka@ifokidaiacjp EVGENIY GRECHNIKOV Departmet of Mathematics, auma
More informationLinear Programming and the Simplex Method
Liear Programmig ad the Simplex ethod Abstract This article is a itroductio to Liear Programmig ad usig Simplex method for solvig LP problems i primal form. What is Liear Programmig? Liear Programmig is
More informationProblem 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 =
Mathematics Summer Wilso Fial Exam August 8, ANSWERS Problem 1 (a) Fid the solutio to y +x y = e x x that satisfies y() = 5 : This is already i the form we used for a first order liear differetial equatio,
More informationLecture 6 Chi Square Distribution (χ 2 ) and Least Squares Fitting
Lecture 6 Chi Square Distributio (χ ) ad Least Squares Fittig Chi Square Distributio (χ ) Suppose: We have a set of measuremets {x 1, x, x }. We kow the true value of each x i (x t1, x t, x t ). We would
More informationMath 257: Finite difference methods
Math 257: Fiite differece methods 1 Fiite Differeces Remember the defiitio of a derivative f f(x + ) f(x) (x) = lim 0 Also recall Taylor s formula: (1) f(x + ) = f(x) + f (x) + 2 f (x) + 3 f (3) (x) +...
More informationThe Riemann Zeta Function
Physics 6A Witer 6 The Riema Zeta Fuctio I this ote, I will sketch some of the mai properties of the Riema zeta fuctio, ζ(x). For x >, we defie ζ(x) =, x >. () x = For x, this sum diverges. However, we
More informationChapter 6: Numerical Series
Chapter 6: Numerical Series 327 Chapter 6 Overview: Sequeces ad Numerical Series I most texts, the topic of sequeces ad series appears, at first, to be a side topic. There are almost o derivatives or itegrals
More informationEstimation for Complete Data
Estimatio for Complete Data complete data: there is o loss of iformatio durig study. complete idividual complete data= grouped data A complete idividual data is the oe i which the complete iformatio of
More informationThe Method of Least Squares. To understand least squares fitting of data.
The Method of Least Squares KEY WORDS Curve fittig, least square GOAL To uderstad least squares fittig of data To uderstad the least squares solutio of icosistet systems of liear equatios 1 Motivatio Curve
More informationSimilarity Solutions to Unsteady Pseudoplastic. Flow Near a Moving Wall
Iteratioal Mathematical Forum, Vol. 9, 04, o. 3, 465-475 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/0.988/imf.04.48 Similarity Solutios to Usteady Pseudoplastic Flow Near a Movig Wall W. Robi Egieerig
More informationExponential and Trigonometric Functions Lesson #1
Epoetial ad Trigoometric Fuctios Lesso # Itroductio To Epoetial Fuctios Cosider a populatio of 00 mice which is growig uder plague coditios. If the mouse populatio doubles each week we ca costruct a table
More informationAlgebra II Notes Unit Seven: Powers, Roots, and Radicals
Syllabus Objectives: 7. The studets will use properties of ratioal epoets to simplify ad evaluate epressios. 7.8 The studet will solve equatios cotaiig radicals or ratioal epoets. b a, the b is the radical.
More informationINFINITE SEQUENCES AND SERIES
INFINITE SEQUENCES AND SERIES INFINITE SEQUENCES AND SERIES I geeral, it is difficult to fid the exact sum of a series. We were able to accomplish this for geometric series ad the series /[(+)]. This is
More informationAN OPEN-PLUS-CLOSED-LOOP APPROACH TO SYNCHRONIZATION OF CHAOTIC AND HYPERCHAOTIC MAPS
http://www.paper.edu.c Iteratioal Joural of Bifurcatio ad Chaos, Vol. 1, No. 5 () 119 15 c World Scietific Publishig Compay AN OPEN-PLUS-CLOSED-LOOP APPROACH TO SYNCHRONIZATION OF CHAOTIC AND HYPERCHAOTIC
More informationTHE SOLUTION OF NONLINEAR EQUATIONS f( x ) = 0.
THE SOLUTION OF NONLINEAR EQUATIONS f( ) = 0. Noliear Equatio Solvers Bracketig. Graphical. Aalytical Ope Methods Bisectio False Positio (Regula-Falsi) Fied poit iteratio Newto Raphso Secat The root of
More informationDiscrete-Time Systems, LTI Systems, and Discrete-Time Convolution
EEL5: Discrete-Time Sigals ad Systems. Itroductio I this set of otes, we begi our mathematical treatmet of discrete-time s. As show i Figure, a discrete-time operates or trasforms some iput sequece x [
More informationYou may work in pairs or purely individually for this assignment.
CS 04 Problem Solvig i Computer Sciece OOC Assigmet 6: Recurreces You may work i pairs or purely idividually for this assigmet. Prepare your aswers to the followig questios i a plai ASCII text file or
More informationMath 113 Exam 4 Practice
Math Exam 4 Practice Exam 4 will cover.-.. This sheet has three sectios. The first sectio will remid you about techiques ad formulas that you should kow. The secod gives a umber of practice questios for
More informationAnalysis of Algorithms. Introduction. Contents
Itroductio The focus of this module is mathematical aspects of algorithms. Our mai focus is aalysis of algorithms, which meas evaluatig efficiecy of algorithms by aalytical ad mathematical methods. We
More informationPrecalculus MATH Sections 3.1, 3.2, 3.3. Exponential, Logistic and Logarithmic Functions
Precalculus MATH 2412 Sectios 3.1, 3.2, 3.3 Epoetial, Logistic ad Logarithmic Fuctios Epoetial fuctios are used i umerous applicatios coverig may fields of study. They are probably the most importat group
More informationCALCULUS BASIC SUMMER REVIEW
CALCULUS BASIC SUMMER REVIEW NAME rise y y y Slope of a o vertical lie: m ru Poit Slope Equatio: y y m( ) The slope is m ad a poit o your lie is, ). ( y Slope-Itercept Equatio: y m b slope= m y-itercept=
More informationAP Calculus BC Review Applications of Derivatives (Chapter 4) and f,
AP alculus B Review Applicatios of Derivatives (hapter ) Thigs to Kow ad Be Able to Do Defiitios of the followig i terms of derivatives, ad how to fid them: critical poit, global miima/maima, local (relative)
More informationThe picture in figure 1.1 helps us to see that the area represents the distance traveled. Figure 1: Area represents distance travelled
1 Lecture : Area Area ad distace traveled Approximatig area by rectagles Summatio The area uder a parabola 1.1 Area ad distace Suppose we have the followig iformatio about the velocity of a particle, how
More information1 Approximating Integrals using Taylor Polynomials
Seughee Ye Ma 8: Week 7 Nov Week 7 Summary This week, we will lear how we ca approximate itegrals usig Taylor series ad umerical methods. Topics Page Approximatig Itegrals usig Taylor Polyomials. Defiitios................................................
More informationSequences III. Chapter Roots
Chapter 4 Sequeces III 4. Roots We ca use the results we ve established i the last workbook to fid some iterestig limits for sequeces ivolvig roots. We will eed more techical expertise ad low cuig tha
More informationSequences and Series of Functions
Chapter 6 Sequeces ad Series of Fuctios 6.1. Covergece of a Sequece of Fuctios Poitwise Covergece. Defiitio 6.1. Let, for each N, fuctio f : A R be defied. If, for each x A, the sequece (f (x)) coverges
More informationSequences. Notation. Convergence of a Sequence
Sequeces A sequece is essetially just a list. Defiitio (Sequece of Real Numbers). A sequece of real umbers is a fuctio Z (, ) R for some real umber. Do t let the descriptio of the domai cofuse you; it
More informationAP Calculus Chapter 9: Infinite Series
AP Calculus Chapter 9: Ifiite Series 9. Sequeces a, a 2, a 3, a 4, a 5,... Sequece: A fuctio whose domai is the set of positive itegers = 2 3 4 a = a a 2 a 3 a 4 terms of the sequece Begi with the patter
More informationThe axial dispersion model for tubular reactors at steady state can be described by the following equations: dc dz R n cn = 0 (1) (2) 1 d 2 c.
5.4 Applicatio of Perturbatio Methods to the Dispersio Model for Tubular Reactors The axial dispersio model for tubular reactors at steady state ca be described by the followig equatios: d c Pe dz z =
More informationLesson 10: Limits and Continuity
www.scimsacademy.com Lesso 10: Limits ad Cotiuity SCIMS Academy 1 Limit of a fuctio The cocept of limit of a fuctio is cetral to all other cocepts i calculus (like cotiuity, derivative, defiite itegrals
More information