Lesson 4: Population, Taylor and Runge-Kutta Methods
|
|
- Melvyn Roy Kelley
- 6 years ago
- Views:
Transcription
1 Lesson 4: Population, Taylor and Runge-Kutta Methods 4.1 Applied Problem. Consider a single fish population whose size is given by x(t). The change in the size of the fish population over a given time interval is approximately equal to the product of the change in time, t, the difference in the birth rate and death rate, b - d, and the "present" fish population, x(t). This may be written as x(t + t) - x(t) t (b - d) x(t) where t is between t and t + t. The simplest model is for b - d being a constant. A second model is the logistic model where b - d = c(m - x) with c, M constant and M is the maximum population size. A third model may involve harvesting, -h(t), or stocking, +s(t), at a given rate. We want to be able to predict the fish population size as a function of these parameters. In this lesson we will focus on the logistic model, and in the lesson five we will account for harvesting or stocking of the lake. In both these lessons we have assumed there are no predator fish that significantly alter the fish population; we will study this in lesson seven. 4.2 Differential Equation Model. A differential equation can be formed from the above approximation by dividing by t and letting it go to zero. The approximation will get better as t goes to zero
2 2 because the population size in the interval will vary less as t goes to zero. The above approximation becomes x' = (b - d)x. If (b - d) are constant, then the solution is x(t) = x(0) e (b - d)t. If b - d = c(m - x), then the solution can be found in terms of a more complicated expression with an exponential function, provided c and M are constants! In more sophisticated models this is not the case, and so, we are forced to consider numerical solution to these models. A variation of the logistic model that includes harvesting is x' = c(m - x)x - h(t). 4.3 Taylor Numerical Method. We wish to have a higher order approximation scheme, and so, we apply the fourth order Taylor polynomial approximation to u(t + h) and a = t. Let u have five continuous derivatives so that for some C between t and t + h we have u(t + h) = u(t) + u t (t) h + u tt (t) h 2 /2 + u ttt (t) h 3 /6 + u tttt (t) h 4 /24 + u (5) (C) h 5 /120. Since u is a solution of the differential equation, one can compute the higher order derivatives by using the chain rule, for example, u tt = f t (t,u(t)) 1 + f u (t,u(t)) u t = f t (t,u(t)) 1 + f u (t,u(t)) f(t,u(t)). If f(t,u) is complicated, then these calculations will become costly. However, for simpler cases it is very powerful. Consider the Newton's law of cooling where f(t,u) = c(usur - u). Then the n th derivative of u has the form (-c) n-1 f(u). The above Taylor polynomial with variable h is
3 3 u(t + h) = u(t) + f(u(t)) h + (-c) 1 f(u(t)) h 2 /2 + (-c) 2 f(u(t)) h 3 /6 This suggests the following algorithm + (-c) 3 f(u(t)) h 4 /24 + (-c) 4 f(c)h 5 /120. u k+1 = u k + f(u k ) h - cf(u k ) h 2 /2 + c 2 f(u k ) h 3 /6 - c 3 f(u k ) h 4 /24. Since the error in Taylor's theorem is of order 5, the discretization error might have an error of order 4. This is the case provided the solution has 5 continuous derivatives. The following Matlab code in the m-file tayerr.m illustrated the order of convergence for the cooling problem with c = 1/26, ysur = 70 and y(0) = 200. The errors are computed at time equal to 10.0, and the steps sizes are reduced by 50% of the previous step size. The table indicates the fourth order Taylor method has an error that is proportional the step size raised to the fourth. Matlab m-file tayerr.m: Euler and Fourth Order Taylor Errors clear; kk = 40; T = 10.0; dt = T/kk; u0 = 200.; c = 1/26; usur = 70.; uk = u0; ut = u0; for k = 1:kk uk = uk + dt*c*(usur -uk); uex = usur + (u0 -usur)*exp(-c*k*dt); utp = ut; ut = ut + dt*c*(usur -utp); ut = ut - (dt^2)/2*c*(c*(usur -utp)); ut = ut + (dt^3)/6*c^2*(c*(usur -utp)); ut = ut - (dt^4)/24*c^3*(c*(usur -utp)); erreul = abs(uk - uex); errtay = abs(ut - uex); end kk erreul errtay
4 4 Table: Discretization Errors with Euler Order One and Taylor Order Four K (h = 10/K) Euler Error Taylor Error 5 (2.000) (1.000) (0.500) (0.250) The n th order Talyor method for approximating the solution of ut = f(t,u(t)) with u(0) given is u k+1 = u k + f(t k, u k ) h + f (1) ( t k, u k ) h 2 / f (n-1) ( t k, u k ) h n /n! where f (i) is the i th derivative of the composed function f(t, u(t)). Example. In the above Newton's model of cooling the derivatives of the composed function are f (i) = (-c) i f(u) provided f(u) = c(u sur - u) with u sur equal to a constant. Example. In the calculations below we consider the second order Taylor method, but for more general f(t, u(t)). u k+1 = u k + f(t k, u k ) h + f (1) ( t k, u k ) h 2 /2 = u k + f(t k, u k ) h + (f t (t k, u k ) + f u (t k, u k ) f(t k, u k )) h 2 /2.
5 5 4.4 Runge-Kutta Numerical Method. The Taylor method for more accurate numerical solutions of ordinary differential equations requires the computation of a number of partial derivatives of f(t,u), and this made its implementation difficult for higher order methods. Here we will show how one can make use a number of function evaluations of just f(t,u) and still obtain higher order methods based on the Taylor method. The second order Taylor algorithm is u k+1 = u k + h [f(t k, u k ) + (f t (t k, u k ) + f u (t k, u k ) f (t k, u k ))h/2]. In order to avoid some of the partial derivatives, we may evaluate f(t,u) at a number of points. The location of these points can be found by using the two variable version of Taylor polynomials for f(x,y). The derivation can be done via the one variable problem where F(t) = f(a+th,b+tk). Use the extended mean value theorem F(0+1) = F(0) + F (1) (0)(1-0) + F (2) (c)(1-0) 2 /2 where c is in [0,1]. The first and second order derivatives of F(t) must be computed via the chain rule: F (1) = f x h + f y k = (D x h + D y k)f F (2) = (D x h + D y k) 2 f = (D x h + D y k)f x h + (D x h + D y k)f y k = f xx hh + 2f xy hk + f yy kk. Therefore, the second order Taylor polynomial with error in two variables is f(a+h,b+k) = f(a,b) + f x (a,b) h + f y (a,b) k + ( f xx (a+ch,b+ck)hh + 2f xy (a+ch,b+ck)hk + f yy (a+ch,b+ck)kk)/2.
6 6 This multilinear approximation of a function of two variables is the model, which allows us to simplify the Taylor method for the numerical solution of ordinary differential equations. Consider the above second order Taylor method. We want to replace the expression in the square brackets with a suitable evaluation of f at f(t k + α, u k + β). The α and β can be chosen via the second order Taylor polynomial error in two variables with a = t k, h = α, b = u k and k = β f(t k + α, u k + β) = f(t k,u k ) + f t (t k,u k ) α + f u (t k,u k ) β + O(α 2,αβ,β 2 ). In order to match this with the terms in the square bracket in the second order Taylor algorithm, let α = h/2 and β = f(t k,u k ) h/2 so that a variation of this method is u k+1 = u k + h [f(t k + h/2, u k + f(t k,u k ) h/2)]. This is known as the midpoint method or the second order Runge-Kutta method. The fourth order Runge-Kutta method can be formulated using a similar construction. It also can be viewed as Simpson's rule numerical approximation of the equivalent integral equation t+ h ut ( + h) = ut ( ) + fzuz (, ( ))dz. The integral can be approximated by (h/6)(k 1 + 4(k 2 /2 + k 3 /2) + k 4 ) where k 1 = f(t,u(t)), k 2 = f(t+h/2, u(t) + (h/2)k 1 ), k 3 = f(t+h/2, u(t) + (h/2)k 2 ) and t
7 7 k 4 = f(t+h, u(t) + hk 3 ). The fourth order Runge-Kutta method, where t and u(t) are replaced by t k and u k, is u k+1 = u k + (h/6)(k 1 + 2k 2 + 2k 3 + k 4 ) In order to show this scheme is fourth order convergent, that is, u(t+h) - u k+1 Ah 5, one must use the Taylor expansions, and in this case the solution should have continuous derivatives of order five. 4.5 Matlab Implementation. The following Matlab code for the Runge-Kutta fourth order method uses fixed step sizes. The logistic differential equation is solved where c =.01, M = 100 and x(0) = 10. Notice the solution approaches 100. The steady state solutions are defined by any constant where the right side is zero. This requires cx(m - x) = 0, and so, x = 0 or x = M. The right side of the differential equation is stored is the function file fpop.m, and the Runge-Kutta code is stored in the file rk4.m. This initial population is stored in x(1), and the values for c = 0.01 and M = 100 are in fpop.m. function fpop = fpop(t,x) fpop =.01*(100 - x)*x; %your name, your student number, lesson number clear; x(1) = 10.; T = 10; KK = 50 h = T/KK; t(1)= 0.; for k = 1:KK k1 = h*fpop(t(k),x(k)); k2 = h*fpop(t(k)+.5*h,x(k)+.5*k1); k3 = h*fpop(t(k)+.5*h,x(k)+.5*k2);
8 8 k4 = h*fpop(t(k)+h,x(k)+.5*k3); x(k+1) = x(k) + (k1 + 2*k2 + 2*k3 +k4)/6; t(k+1) = t(k) + h; end plot(t,x) title('your name, your student number, lesson number') xlabel('time') ylabel('population') 100 your name, your student number, lesson number population time 6.5 Numerical Experiments. 4.6 Numerical Experiments. In the following numerical experiments we keep c = 0.01 and M = 100 fixed, and vary the initial population. We have executed rk4.m with a number of initial conditions, stored the output, and plotted then all on the same graph. Notice if x(0) is positive, then the solution will always converge to the largest steady state solution. Unless x(0) = 0, the smallest steady state solution, the x(t) always goes away from the smallest steady state
9 9 solution. Here the largest steady state solution is called stable, and the smallest steady state solution is call unstable. Use the hold on command and six different initial populations 1, 30, 60, 90, 110 and 140. These should be stored in the array x of the rk4.m file. This is, execute rk4.m six times with different x(1) (x(1) = 1,, x(1) = 140). Note the abuse of notation: if x = x(t) is a function of t, then x(1) is a function evaluation at t = 1; if x is an array, then x(1) is the first entry in the array populations for different x(0) time
10 Additional Calculations. Next we fix the initial condition x(0) = 10, M = 100*(1+.S), and vary the c. You may want to increase the final time from T = 10 to T = 20 or larger. (a). (b). State the logistic differential equation for c = and M = 100*(1+.S). Modify the pop.m and rk4.m files. (c). Execute the rk4.m file for c = (d). Use the hold on command and repeat (c) for c = 0.01, and (e). Examine the curves. What happens to the population as c increases?
Falling Mass and Improved Euler
Lesson 3: Falling Mass and Improved Euler 3.1 Applied Problem. Consider a mass which is falling through a viscous medium. One example is a falling rock, and a second example is a person in parachute. These
More informationFalling Mass and Euler Methods
Lesson 2: Falling Mass and Euler Methods 2.1 Applied Problem. Consider a mass, which is falling through a viscous medium. One example is a falling rock, and a second example is a person in parachute. These
More informationLesson 9: Predator-Prey and ode45
Lesson 9: Predator-Prey and ode45 9.1 Applied Problem. In this lesson we will allow for more than one population where they depend on each other. One population could be the predator such as a fox, and
More informationLesson 13: Rapid Cooling and Euler-trapezoid
Lesson 13: Rapid Cooling and Euler-trapezoid 13.1 Applied Problem. If an object is being cooled very rapidly, and the model is Newton's law of cooling, then the constant c in u t = c(usur - u) will be
More informationLesson 13: Rapid Cooling and Euler-trapezoid
Lesson 3: Rapid Cooling and Euler-trapezoid 3. Applied Problem. If an object is being cooled very rapidly, and the model is Newton's law of cooling, then the constant c in u t = c(usur - u) will be large.
More informationLesson 9: Diffusion of Heat (discrete rod) and ode45
Lesson 9: Diffusion of Heat (discrete rod) and ode45 9.1 Applied Problem. Consider the temperature in a thin rod such as a wire with electrical current. Assume the ends have a fixed temperature and the
More information2015 Holl ISU MSM Ames, Iowa. A Few Good ODEs: An Introduction to Modeling and Computation
2015 Holl Mini-Conference @ ISU MSM Ames, Iowa A Few Good ODEs: An Introduction to Modeling and Computation James A. Rossmanith Department of Mathematics Iowa State University June 20 th, 2015 J.A. Rossmanith
More informationLesson 14: Van der Pol Circuit and ode23s
Lesson 4: Van der Pol Circuit and ode3s 4. Applied Problem. A series LRC circuit when coupled via mutual inductance with a triode circuit can generate a sequence of pulsing currents that have very rapid
More informationOrdinary Differential Equations
Chapter 7 Ordinary Differential Equations Differential equations are an extremely important tool in various science and engineering disciplines. Laws of nature are most often expressed as different equations.
More informationChap. 20: Initial-Value Problems
Chap. 20: Initial-Value Problems Ordinary Differential Equations Goal: to solve differential equations of the form: dy dt f t, y The methods in this chapter are all one-step methods and have the general
More informationMTH 452/552 Homework 3
MTH 452/552 Homework 3 Do either 1 or 2. 1. (40 points) [Use of ode113 and ode45] This problem can be solved by a modifying the m-files odesample.m and odesampletest.m available from the author s webpage.
More informationFourth Order RK-Method
Fourth Order RK-Method The most commonly used method is Runge-Kutta fourth order method. The fourth order RK-method is y i+1 = y i + 1 6 (k 1 + 2k 2 + 2k 3 + k 4 ), Ordinary Differential Equations (ODE)
More informationKINGS COLLEGE OF ENGINEERING DEPARTMENT OF MATHEMATICS ACADEMIC YEAR / EVEN SEMESTER QUESTION BANK
KINGS COLLEGE OF ENGINEERING MA5-NUMERICAL METHODS DEPARTMENT OF MATHEMATICS ACADEMIC YEAR 00-0 / EVEN SEMESTER QUESTION BANK SUBJECT NAME: NUMERICAL METHODS YEAR/SEM: II / IV UNIT - I SOLUTION OF EQUATIONS
More informationAIMS Exercise Set # 1
AIMS Exercise Set #. Determine the form of the single precision floating point arithmetic used in the computers at AIMS. What is the largest number that can be accurately represented? What is the smallest
More informationFirst In-Class Exam Solutions Math 246, Professor David Levermore Thursday, 20 September 2018
First In-Class Exam Solutions Math 246, Professor David Levermore Thursday, 20 September 208 () [6] In the absence of predators the population of mosquitoes in a certain area would increase at a rate proportional
More informationSection 7.4 Runge-Kutta Methods
Section 7.4 Runge-Kutta Methods Key terms: Taylor methods Taylor series Runge-Kutta; methods linear combinations of function values at intermediate points Alternatives to second order Taylor methods Fourth
More informationAM205: Assignment 3 (due 5 PM, October 20)
AM25: Assignment 3 (due 5 PM, October 2) For this assignment, first complete problems 1, 2, 3, and 4, and then complete either problem 5 (on theory) or problem 6 (on an application). If you submit answers
More informationTaylor Series and stationary points
Chapter 5 Taylor Series and stationary points 5.1 Taylor Series The surface z = f(x, y) and its derivatives can give a series approximation for f(x, y) about some point (x 0, y 0 ) as illustrated in Figure
More informationEuler s Method, cont d
Jim Lambers MAT 461/561 Spring Semester 009-10 Lecture 3 Notes These notes correspond to Sections 5. and 5.4 in the text. Euler s Method, cont d We conclude our discussion of Euler s method with an example
More informationPowerPoints organized by Dr. Michael R. Gustafson II, Duke University
Part 6 Chapter 20 Initial-Value Problems PowerPoints organized by Dr. Michael R. Gustafson II, Duke University All images copyright The McGraw-Hill Companies, Inc. Permission required for reproduction
More informationMath Assignment 2
Math 2280 - Assignment 2 Dylan Zwick Spring 2014 Section 1.5-1, 15, 21, 29, 38, 42 Section 1.6-1, 3, 13, 16, 22, 26, 31, 36, 56 Section 2.1-1, 8, 11, 16, 29 Section 2.2-1, 10, 21, 23, 24 1 Section 1.5
More informationMathematics 22: Lecture 11
Mathematics 22: Lecture 11 Runge-Kutta Dan Sloughter Furman University January 25, 2008 Dan Sloughter (Furman University) Mathematics 22: Lecture 11 January 25, 2008 1 / 11 Order of approximations One
More informationAn Overly Simplified and Brief Review of Differential Equation Solution Methods. 1. Some Common Exact Solution Methods for Differential Equations
An Overly Simplified and Brief Review of Differential Equation Solution Methods We will be dealing with initial or boundary value problems. A typical initial value problem has the form y y 0 y(0) 1 A typical
More informationSolution: (a) Before opening the parachute, the differential equation is given by: dv dt. = v. v(0) = 0
Math 2250 Lab 4 Name/Unid: 1. (25 points) A man bails out of an airplane at the altitute of 12,000 ft, falls freely for 20 s, then opens his parachute. Assuming linear air resistance ρv ft/s 2, taking
More informationOrdinary Differential Equations (ODE)
Ordinary Differential Equations (ODE) Why study Differential Equations? Many physical phenomena are best formulated mathematically in terms of their rate of change. Motion of a swinging pendulum Bungee-jumper
More informationWhat we ll do: Lecture 21. Ordinary Differential Equations (ODEs) Differential Equations. Ordinary Differential Equations
What we ll do: Lecture Ordinary Differential Equations J. Chaudhry Department of Mathematics and Statistics University of New Mexico Review ODEs Single Step Methods Euler s method (st order accurate) Runge-Kutta
More informationLecture 4: Numerical solution of ordinary differential equations
Lecture 4: Numerical solution of ordinary differential equations Department of Mathematics, ETH Zürich General explicit one-step method: Consistency; Stability; Convergence. High-order methods: Taylor
More information3 Applications of partial differentiation
Advanced Calculus Chapter 3 Applications of partial differentiation 37 3 Applications of partial differentiation 3.1 Stationary points Higher derivatives Let U R 2 and f : U R. The partial derivatives
More information1 (t + 4)(t 1) dt. Solution: The denominator of the integrand is already factored with the factors being distinct, so 1 (t + 4)(t 1) = A
Calculus Topic: Integration of Rational Functions Section 8. # 0: Evaluate the integral (t + )(t ) Solution: The denominator of the integrand is already factored with the factors being distinct, so (t
More informationOrdinary Differential Equations
Ordinary Differential Equations Michael H. F. Wilkinson Institute for Mathematics and Computing Science University of Groningen The Netherlands December 2005 Overview What are Ordinary Differential Equations
More informationNUMERICAL ANALYSIS PROBLEMS
NUMERICAL ANALYSIS PROBLEMS JAMES KEESLING The problems that follow illustrate the methods covered in class. They are typical of the types of problems that will be on the tests.. Solving Equations Problem.
More informationConsistency and Convergence
Jim Lambers MAT 77 Fall Semester 010-11 Lecture 0 Notes These notes correspond to Sections 1.3, 1.4 and 1.5 in the text. Consistency and Convergence We have learned that the numerical solution obtained
More informationNumerical and Statistical Methods
F.Y. B.Sc.(IT) : Sem. II Numerical and Statistical Methods Time : ½ Hrs.] Prelim Question Paper Solution [Marks : 75 Q. Attempt any THREE of the following : [5] Q.(a) What is a mathematical model? With
More informationPH36010: Numerical Methods - Evaluating the Lorenz Attractor using Runge-Kutta methods Abstract
PH36010: Numerical Methods - Evaluating the Lorenz Attractor using Runge-Kutta methods Mr. Benjamen P. Reed (110108461) IMPACS, Aberystwyth University January 31, 2014 Abstract A set of three coupled ordinary
More informationFORTRAN 77 Lesson 7. Reese Haywood Ayan Paul
FORTRAN 77 Lesson 7 Reese Haywood Ayan Paul 1 Numerical Integration A general all purpose Numerical Integration technique is the Trapezoidal Method. For most functions, this method is fast and accurate.
More information13 Numerical Solution of ODE s
13 NUMERICAL SOLUTION OF ODE S 28 13 Numerical Solution of ODE s In simulating dynamical systems, we frequently solve ordinary differential equations. These are of the form dx = f(t, x), dt where the function
More informationEuler s Method and Logistic Growth (BC Only)
Euler s Method Students should be able to: Approximate numerical solutions of differential equations using Euler s method without a calculator. Recognize the method as a recursion formula extension of
More informationNumerical and Statistical Methods
F.Y. B.Sc.(IT) : Sem. II Numerical and Statistical Methods Time : ½ Hrs.] Prelim Question Paper Solution [Marks : 75 Q. Attempt any THREE of the following : [5] Q.(a) What is a mathematical model? With
More informationSolution: (a) Before opening the parachute, the differential equation is given by: dv dt. = v. v(0) = 0
Math 2250 Lab 4 Name/Unid: 1. (35 points) Leslie Leroy Irvin bails out of an airplane at the altitude of 16,000 ft, falls freely for 20 s, then opens his parachute. Assuming linear air resistance ρv ft/s
More informationUse separation of variables to solve the following differential equations with given initial conditions. y 1 1 y ). y(y 1) = 1
Chapter 11 Differential Equations 11.1 Use separation of variables to solve the following differential equations with given initial conditions. (a) = 2ty, y(0) = 10 (b) = y(1 y), y(0) = 0.5, (Hint: 1 y(y
More informationOrdinary Differential Equations II
Ordinary Differential Equations II CS 205A: Mathematical Methods for Robotics, Vision, and Graphics Justin Solomon CS 205A: Mathematical Methods Ordinary Differential Equations II 1 / 29 Almost Done! No
More informationIntegration of Ordinary Differential Equations
Integration of Ordinary Differential Equations Com S 477/577 Nov 7, 00 1 Introduction The solution of differential equations is an important problem that arises in a host of areas. Many differential equations
More informationx x2 2 + x3 3 x4 3. Use the divided-difference method to find a polynomial of least degree that fits the values shown: (b)
Numerical Methods - PROBLEMS. The Taylor series, about the origin, for log( + x) is x x2 2 + x3 3 x4 4 + Find an upper bound on the magnitude of the truncation error on the interval x.5 when log( + x)
More informationIntroduction to standard and non-standard Numerical Methods
Introduction to standard and non-standard Numerical Methods Dr. Mountaga LAM AMS : African Mathematic School 2018 May 23, 2018 One-step methods Runge-Kutta Methods Nonstandard Finite Difference Scheme
More informationPowerPoints organized by Dr. Michael R. Gustafson II, Duke University
Part 6 Chapter 20 Initial-Value Problems PowerPoints organized by Dr. Michael R. Gustafson II, Duke University All images copyright The McGraw-Hill Companies, Inc. Permission required for reproduction
More informationINTRODUCTION TO COMPUTER METHODS FOR O.D.E.
INTRODUCTION TO COMPUTER METHODS FOR O.D.E. 0. Introduction. The goal of this handout is to introduce some of the ideas behind the basic computer algorithms to approximate solutions to differential equations.
More informationMath 128A Spring 2003 Week 12 Solutions
Math 128A Spring 2003 Week 12 Solutions Burden & Faires 5.9: 1b, 2b, 3, 5, 6, 7 Burden & Faires 5.10: 4, 5, 8 Burden & Faires 5.11: 1c, 2, 5, 6, 8 Burden & Faires 5.9. Higher-Order Equations and Systems
More information1 Lecture 8: Interpolating polynomials.
1 Lecture 8: Interpolating polynomials. 1.1 Horner s method Before turning to the main idea of this part of the course, we consider how to evaluate a polynomial. Recall that a polynomial is an expression
More informationδ Substituting into the differential equation gives: x i+1 x i δ f(t i,x i ) (3)
Solving Differential Equations Numerically Differential equations are ubiquitous in Physics since the laws of nature often take on a simple form when expressed in terms of infinitesimal changes of the
More informationOrdinary Differential Equations: Initial Value problems (IVP)
Chapter Ordinary Differential Equations: Initial Value problems (IVP) Many engineering applications can be modeled as differential equations (DE) In this book, our emphasis is about how to use computer
More information(f(x) P 3 (x)) dx. (a) The Lagrange formula for the error is given by
1. QUESTION (a) Given a nth degree Taylor polynomial P n (x) of a function f(x), expanded about x = x 0, write down the Lagrange formula for the truncation error, carefully defining all its elements. How
More informationSecond Order ODEs. CSCC51H- Numerical Approx, Int and ODEs p.130/177
Second Order ODEs Often physical or biological systems are best described by second or higher-order ODEs. That is, second or higher order derivatives appear in the mathematical model of the system. For
More informationDo not turn over until you are told to do so by the Invigilator.
UNIVERSITY OF EAST ANGLIA School of Mathematics Main Series UG Examination 216 17 INTRODUCTION TO NUMERICAL ANALYSIS MTHE612B Time allowed: 3 Hours Attempt QUESTIONS 1 and 2, and THREE other questions.
More informationHigher Order Taylor Methods
Higher Order Taylor Methods Marcelo Julio Alvisio & Lisa Marie Danz May 6, 2007 Introduction Differential equations are one of the building blocks in science or engineering. Scientists aim to obtain numerical
More informationNumerical Methods - Initial Value Problems for ODEs
Numerical Methods - Initial Value Problems for ODEs Y. K. Goh Universiti Tunku Abdul Rahman 2013 Y. K. Goh (UTAR) Numerical Methods - Initial Value Problems for ODEs 2013 1 / 43 Outline 1 Initial Value
More informationNumerical Differential Equations: IVP
Chapter 11 Numerical Differential Equations: IVP **** 4/16/13 EC (Incomplete) 11.1 Initial Value Problem for Ordinary Differential Equations We consider the problem of numerically solving a differential
More informationFirst In-Class Exam Solutions Math 246, Professor David Levermore Tuesday, 21 February log(2)m 40, 000, M(0) = 250, 000.
First In-Class Exam Solutions Math 26, Professor David Levermore Tuesday, 2 February 207 ) [6] In the absence of predators the population of mosquitoes in a certain area would increase at a rate proportional
More informationChapter 9b: Numerical Methods for Calculus and Differential Equations. Initial-Value Problems Euler Method Time-Step Independence MATLAB ODE Solvers
Chapter 9b: Numerical Methods for Calculus and Differential Equations Initial-Value Problems Euler Method Time-Step Independence MATLAB ODE Solvers Acceleration Initial-Value Problems Consider a skydiver
More informationManifesto on Numerical Integration of Equations of Motion Using Matlab
Manifesto on Numerical Integration of Equations of Motion Using Matlab C. Hall April 11, 2002 This handout is intended to help you understand numerical integration and to put it into practice using Matlab
More informationOrdinary differential equations. Phys 420/580 Lecture 8
Ordinary differential equations Phys 420/580 Lecture 8 Most physical laws are expressed as differential equations These come in three flavours: initial-value problems boundary-value problems eigenvalue
More informationChapter 5 Exercises. (a) Determine the best possible Lipschitz constant for this function over 2 u <. u (t) = log(u(t)), u(0) = 2.
Chapter 5 Exercises From: Finite Difference Methods for Ordinary and Partial Differential Equations by R. J. LeVeque, SIAM, 2007. http://www.amath.washington.edu/ rjl/fdmbook Exercise 5. (Uniqueness for
More informationChapter 11 ORDINARY DIFFERENTIAL EQUATIONS
Chapter 11 ORDINARY DIFFERENTIAL EQUATIONS The general form of a first order differential equations is = f(x, y) with initial condition y(a) = y a We seek the solution y = y(x) for x > a This is shown
More informationBrownian Motion. An Undergraduate Introduction to Financial Mathematics. J. Robert Buchanan. J. Robert Buchanan Brownian Motion
Brownian Motion An Undergraduate Introduction to Financial Mathematics J. Robert Buchanan 2010 Background We have already seen that the limiting behavior of a discrete random walk yields a derivation of
More informationMath 308 Week 8 Solutions
Math 38 Week 8 Solutions There is a solution manual to Chapter 4 online: www.pearsoncustom.com/tamu math/. This online solutions manual contains solutions to some of the suggested problems. Here are solutions
More informationDifferential Equations
Differential Equations Definitions Finite Differences Taylor Series based Methods: Euler Method Runge-Kutta Methods Improved Euler, Midpoint methods Runge Kutta (2nd, 4th order) methods Predictor-Corrector
More informationR Function Tutorial in Module 8.2
R Function Tutorial in Module 8.2 Introduction to Computational Science: Modeling and Simulation for the Sciences, 2 nd Edition Angela B. Shiflet and George W. Shiflet Wofford College 2014 by Princeton
More informationPhysics 584 Computational Methods
Physics 584 Computational Methods Introduction to Matlab and Numerical Solutions to Ordinary Differential Equations Ryan Ogliore April 18 th, 2016 Lecture Outline Introduction to Matlab Numerical Solutions
More informationTutorial 2. Introduction to numerical schemes
236861 Numerical Geometry of Images Tutorial 2 Introduction to numerical schemes c 2012 Classifying PDEs Looking at the PDE Au xx + 2Bu xy + Cu yy + Du x + Eu y + Fu +.. = 0, and its discriminant, B 2
More informationNumerical Solution of Differential Equations
1 Numerical Solution of Differential Equations A differential equation (or "DE") contains derivatives or differentials. In a differential equation the unknown is a function, and the differential equation
More informationLecture 28 The Main Sources of Error
Lecture 28 The Main Sources of Error Truncation Error Truncation error is defined as the error caused directly by an approximation method For instance, all numerical integration methods are approximations
More informationMath Numerical Analysis Mid-Term Test Solutions
Math 400 - Numerical Analysis Mid-Term Test Solutions. Short Answers (a) A sufficient and necessary condition for the bisection method to find a root of f(x) on the interval [a,b] is f(a)f(b) < 0 or f(a)
More informationECE257 Numerical Methods and Scientific Computing. Ordinary Differential Equations
ECE257 Numerical Methods and Scientific Computing Ordinary Differential Equations Today s s class: Stiffness Multistep Methods Stiff Equations Stiffness occurs in a problem where two or more independent
More informationFIRST-ORDER SYSTEMS OF ORDINARY DIFFERENTIAL EQUATIONS III: Autonomous Planar Systems David Levermore Department of Mathematics University of Maryland
FIRST-ORDER SYSTEMS OF ORDINARY DIFFERENTIAL EQUATIONS III: Autonomous Planar Systems David Levermore Department of Mathematics University of Maryland 4 May 2012 Because the presentation of this material
More informationMECH : a Primer for Matlab s ode suite of functions
Objectives MECH 4-563: a Primer for Matlab s ode suite of functions. Review the fundamentals of initial value problems and why numerical integration methods are needed.. Introduce the ode suite of numerical
More informationSolution. Your sketch should show both x and y axes marked from 5 to 5 and circles of radius 1, 3, and 5 centered at the origin.
Solutions of the Sample Problems for the First In-Class Exam Math 246, Fall 208, Professor David Levermore () (a) Sketch the graph that would be produced by the following Matlab command. fplot(@(t) 2/t,
More informationPowerPoints organized by Dr. Michael R. Gustafson II, Duke University
Part 5 Chapter 21 Numerical Differentiation PowerPoints organized by Dr. Michael R. Gustafson II, Duke University 1 All images copyright The McGraw-Hill Companies, Inc. Permission required for reproduction
More informationOrdinary Differential Equations II
Ordinary Differential Equations II CS 205A: Mathematical Methods for Robotics, Vision, and Graphics Justin Solomon CS 205A: Mathematical Methods Ordinary Differential Equations II 1 / 33 Almost Done! Last
More informationOrdinary Differential Equations
Ordinary Differential Equations We call Ordinary Differential Equation (ODE) of nth order in the variable x, a relation of the kind: where L is an operator. If it is a linear operator, we call the equation
More informationDifferential equations
Differential equations Math 27 Spring 2008 In-term exam February 5th. Solutions This exam contains fourteen problems numbered through 4. Problems 3 are multiple choice problems, which each count 6% of
More informationUnit 2: Modeling in the Frequency Domain Part 2: The Laplace Transform. The Laplace Transform. The need for Laplace
Unit : Modeling in the Frequency Domain Part : Engineering 81: Control Systems I Faculty of Engineering & Applied Science Memorial University of Newfoundland January 1, 010 1 Pair Table Unit, Part : Unit,
More informationOrdinary differential equation II
Ordinary Differential Equations ISC-5315 1 Ordinary differential equation II 1 Some Basic Methods 1.1 Backward Euler method (implicit method) The algorithm looks like this: y n = y n 1 + hf n (1) In contrast
More informationSolutions of the Sample Problems for the First In-Class Exam Math 246, Fall 2017, Professor David Levermore
Solutions of the Sample Problems for the First In-Class Exam Math 246, Fall 207, Professor David Levermore () (a) Give the integral being evaluated by the following Matlab command. int( x/(+xˆ4), x,0,inf)
More informationLecture 8: Calculus and Differential Equations
Lecture 8: Calculus and Differential Equations Dr. Mohammed Hawa Electrical Engineering Department University of Jordan EE201: Computer Applications. See Textbook Chapter 9. Numerical Methods MATLAB provides
More informationLecture 8: Calculus and Differential Equations
Lecture 8: Calculus and Differential Equations Dr. Mohammed Hawa Electrical Engineering Department University of Jordan EE21: Computer Applications. See Textbook Chapter 9. Numerical Methods MATLAB provides
More information551614:Advanced Mathematics for Mechatronics. Numerical solution for ODEs School of Mechanical Engineering
551614:Advanced Mathematics for Mechatronics Numerical solution for ODEs School of Mechanical Engineering 1 Prescribed text : Numerical Method for Engineering, Seventh Edition, Steven C.Chapra, Raymond
More informationMon Jan Improved acceleration models: linear and quadratic drag forces. Announcements: Warm-up Exercise:
Math 2250-004 Week 4 notes We will not necessarily finish the material from a given day's notes on that day. We may also add or subtract some material as the week progresses, but these notes represent
More informationLecture 7 - Separable Equations
Lecture 7 - Separable Equations Separable equations is a very special type of differential equations where you can separate the terms involving only y on one side of the equation and terms involving only
More informationMAT 275 Laboratory 4 MATLAB solvers for First-Order IVP
MAT 275 Laboratory 4 MATLAB solvers for First-Order IVP In this laboratory session we will learn how to. Use MATLAB solvers for solving scalar IVP 2. Use MATLAB solvers for solving higher order ODEs and
More informationName of the Student: Unit I (Solution of Equations and Eigenvalue Problems)
Engineering Mathematics 8 SUBJECT NAME : Numerical Methods SUBJECT CODE : MA6459 MATERIAL NAME : University Questions REGULATION : R3 UPDATED ON : November 7 (Upto N/D 7 Q.P) (Scan the above Q.R code for
More informationMath Numerical Analysis Homework #4 Due End of term. y = 2y t 3y2 t 3, 1 t 2, y(1) = 1. n=(b-a)/h+1; % the number of steps we need to take
Math 32 - Numerical Analysis Homework #4 Due End of term Note: In the following y i is approximation of y(t i ) and f i is f(t i,y i ).. Consider the initial value problem, y = 2y t 3y2 t 3, t 2, y() =.
More informationLogistic Map, Euler & Runge-Kutta Method and Lotka-Volterra Equations
Logistic Map, Euler & Runge-Kutta Method and Lotka-Volterra Equations S. Y. Ha and J. Park Department of Mathematical Sciences Seoul National University Sep 23, 2013 Contents 1 Logistic Map 2 Euler and
More informationComputers, Lies and the Fishing Season
1/47 Computers, Lies and the Fishing Season Liz Arnold May 21, 23 Introduction Computers, lies and the fishing season takes a look at computer software programs. As mathematicians, we depend on computers
More informationMATH107 Vectors and Matrices
School of Mathematics, KSU 20/11/16 Vector valued functions Let D be a set of real numbers D R. A vector-valued functions r with domain D is a correspondence that assigns to each number t in D exactly
More information1 Partial differentiation and the chain rule
1 Partial differentiation and the chain rule In this section we review and discuss certain notations and relations involving partial derivatives. The more general case can be illustrated by considering
More informationModule Two: Differential Calculus(continued) synopsis of results and problems (student copy)
Module Two: Differential Calculus(continued) synopsis of results and problems (student copy) Srikanth K S 1 Syllabus Taylor s and Maclaurin s theorems for function of one variable(statement only)- problems.
More informationOrdinary Differential Equations
Ordinary Differential Equations In this lecture, we will look at different options for coding simple differential equations. Start by considering bicycle riding as an example. Why does a bicycle move forward?
More informationODE Runge-Kutta methods
ODE Runge-Kutta methods The theory (very short excerpts from lectures) First-order initial value problem We want to approximate the solution Y(x) of a system of first-order ordinary differential equations
More informationMA102: Multivariable Calculus
MA102: Multivariable Calculus Rupam Barman and Shreemayee Bora Department of Mathematics IIT Guwahati Differentiability of f : U R n R m Definition: Let U R n be open. Then f : U R n R m is differentiable
More informationThe problems that follow illustrate the methods covered in class. They are typical of the types of problems that will be on the tests.
NUMERICAL ANALYSIS PRACTICE PROBLEMS JAMES KEESLING The problems that follow illustrate the methods covered in class. They are typical of the types of problems that will be on the tests.. Solving Equations
More informationExpanding brackets and factorising
Chapter 7 Expanding brackets and factorising This chapter will show you how to expand and simplify expressions with brackets solve equations and inequalities involving brackets factorise by removing a
More information