Lecture 5: Single Step Methods

Size: px
Start display at page:

Download "Lecture 5: Single Step Methods"

Transcription

1 Lecture 5: Single Step Methods J.K. WI3097TU Delft Institute of Applied Mathematics Delft University of Technology 1 October 2012 () Single Step Methods 1 October / 44

2 Outline 1 Review Difference Formula vs. Interpolation Richardson s Extrapolation 2 Initial Value Problems (IVP s) Single-step methods Amplification factor Stability Nonlinear Stability () Single Step Methods 1 October / 44

3 Difference Formula vs. Interpolation The difference formula for approximating the k th derivative, f (k) (x), is f (k) (x) Q k (h) = 1 h k n α i f (x i ). i=0 This relates to the derivative of the Lagrange interpolant by α i h k = d k dx k L i,n(x), k n () Single Step Methods 1 October / 44

4 Richardson s Extrapolation Assume the error has the form M N(h) = K 1 h α 1 + K 2 h α 2 where K 1, K 2,... are unknown constants. M = a function value. N(h) = an approximation to M We can use this knowledge to either: Create a high order approximation from low order ones; or Obtain an error estimate () Single Step Methods 1 October / 44

5 Initial Value Problems (IVP s) Goal: We want to solve the equation y (t) = f (t, y(t)) y(t 0 ) = y 0. If f (t, y(t)) is linear, i.e., f (t, y(t)) = p(t)y + g(t), there is no problem, we learned how to solve this using integrating factors. () Single Step Methods 1 October / 44

6 Initial Value Problems (IVP s) However, if f (t, y(t)) is nonlinear, we have a problem. There is no general theory for solving nonlinear differential equations. Must solve numerically. Last time, we began discussing using single-step numerical methods to solve this equation. t y(t) = y 0 + t 0 y 0 + F }{{} c constant t y (τ) dτ = y 0 + }{{} t 0 f (τ,y(τ)) (t t 0 ) }{{} interval length f (τ, y(τ)) dτ }{{} treat as a constant,f (t 0,y 0 ) = y 0 + hf c = y(t) () Single Step Methods 1 October / 44

7 Single-step methods The Euler Forward method is an explicit method and is given by w n+1 = w n + hf (t n, w n ), n = 0,..., N 1 The Euler Backward method is an implicit method and is given by w n+1 = w n + hf (t n+1, w n+1 ), n = 0,..., N 1 () Single Step Methods 1 October / 44

8 Trapezoidal Method If we take the average of the Euler Forward and Euler Backward method, then we have the Trapezoidal method: w n+1 = w n + h 2 (f (t n, w n ) + f (t n+1, w n+1 )) This is an implicit method. () Single Step Methods 1 October / 44

9 Modified Euler Predictor-corrector schemes We can also use variations on this. Such as the Modified Euler method. w n+1 = w n + hf (t n, w n ) (predict) w n+1 = w n + h 2 (f (t n, w n ) + f (t n+1, w n+1 )) (correct) Uses an Euler forward step to predict. Uses a modified Trapezoidal method to correct. It is an explicit method. () Single Step Methods 1 October / 44

10 Single-step methods Summary We now have 4 schemes to solve y (t) = f (t, y(t)) + g(t) }{{} F (t,y) y(t 0 ) = y 0. Forward Euler: w n+1 = w n + hf (t n, w n ) Backward Euler: w n+1 = w n + hf (t n+1, w n+1 ) Trapezoidal method: w n+1 = w n + h 2 (F (t n, w n ) + F (t n+1, w n+1 )) Modified Euler: w n+1 = w n + hf (t n, w n ) w n+1 = w n + h 2 (F (t n, w n ) + F (t n+1, w n+1 )) () Single Step Methods 1 October / 44

11 Single-step methods How good are these methods? What are the differences between them? () Single Step Methods 1 October / 44

12 Single-step methods Convergence Theorem (Lax equivalence theorem) A method converges if and only if it is stable and consistent. Stability + Consistency = Convergence Today, we concentrate on stability. Requires a bit of ODE theory and some new concepts. () Single Step Methods 1 October / 44

13 Single-step methods Convergence Recall: A well-posed initial value problem (IVP) is one where a solution exists the solution is unique the solution depends continuously on the initial data. We need something similar for the numerical solution. () Single Step Methods 1 October / 44

14 Single-step methods Amplification factor Definition (Amplification factor) The amplification factor, Q(λh), is given by w n+1 = Q(λh)w n and is used to determine stability of a numerical scheme. To study this, consider a test IVP y (t) = λy(t) y(0) = y 0 where f (t, y) = λy and the solution is given by y(t) = y 0 e λ(t t 0). () Single Step Methods 1 October / 44

15 Amplification factor Euler forward Applying the Euler forward method to y (t) = λy(t), we would have w n+1 = w n + h f (t n, w n ) }{{} f (t n,w n)=λw n = w n + hλw n = (1 + hλ)w n w n+1 = (1 + hλ)w n The amplification factor for the forward Euler method is given by Q(hλ) = 1 + hλ () Single Step Methods 1 October / 44

16 Amplification factor Euler backward For the Euler backward method, we have to work a bit harder: w n+1 = w n + h f (t n+1, w n+1 ) }{{} f (t n+1,w n+1 )=λw n+1 = w n + hλw n+1 w n+1 hλw n+1 = w n 1 w n+1 = 1 hλ w n The amplification factor for the backward Euler method is given by Q(hλ) = 1 1 hλ () Single Step Methods 1 October / 44

17 Amplification factor Trapezoidal method The amplification factor for trapezoidal method can be written as: w n+1 = w n + h 2 w n+1 = w n + hλ 2 (w n + w n+1 ) f (t n, w n ) + f (t n+1, w n+1 ) }{{}}{{} λw n λw n+1 w n+1 h 2 λw n+1 = (1 + h 2 λ)w n w n+1 = 1 + h 2 λ 1 h 2 λw n The amplification factor for the trapezoidal method is given by Q(hλ) = 1 + h 2 λ 1 h 2 λ () Single Step Methods 1 October / 44

18 Amplification factor Modified Euler To find the amplification factor for modified Euler, we need to rewrite the method as: w n+1 = w n + h 2 f (t n, w n ) + f (t n+1, w n + hf (t n, w n )) }{{}}{{} λw n λ(w n+hλw n) = w n + (hλ + 1 ) 2 (hλ)2 w n w n+1 = (1 + hλ + 1 ) 2 (hλ)2 w n So that the amplification factor for the modified Euler method is given by Q(hλ) = 1 + hλ (hλ)2 () Single Step Methods 1 October / 44

19 Stability Using the amplification factor, we can get insight into the stability of the numerical method. Definition (Stability) A method is stable if small perturbations of the parameters results in only a small difference in the solution. () Single Step Methods 1 October / 44

20 Stability Initial Value Problem The exact initial value problem is given as y (t) = λy(t) + g(t) y(0) = y 0 Consider a small perturbation of the initial condition: ỹ (t) = λỹ(t) + g(t) ỹ(0) = y 0 + ɛ 0 where ɛ 0 is small. Define ɛ(t) = ỹ(t) y(t). () Single Step Methods 1 October / 44

21 Stability Initial Value Problem The problem is stable if ɛ(t) = ỹ(t) y(t) is finite for all t > 0. That is lim t ɛ(t) < ỹ (t) y (t) = (λỹ(t) + g(t)) (λy(t) + g(t)) ɛ (t) = λɛ(t) = λ(ỹ(t) y(t)) () Single Step Methods 1 October / 44

22 Stability Initial Value Problem We have the new PDE: ɛ (t) = λɛ(t) ɛ(0) = ɛ 0, which has solution ɛ(t) = ɛ 0 e λt. Clearly, if and lim ɛ(t) = lim ɛ 0e λt = 0 t t λ < 0 lim ɛ(t) = ɛ 0 if λ = 0. t () Single Step Methods 1 October / 44

23 Numerical Stability We need to apply these concepts numerically. To review: for the stability of the IVP We need lim t ɛ(t) = 0. This means that λ < 0. Remark: The IVP needs to be stable to study the stability of the numerical method. () Single Step Methods 1 October / 44

24 Numerical Stability Exact Perturbed w n+1 = Q(hλ)w n w 0 = y 0 w n+1 = Q(hλ) w n w 0 = y 0 + ɛ 0 Define ɛ n+1 = w n+1 w n+1. The numerical stability is given by examining ɛ n+1 = Q(hλ)ɛ n. The numerical stability condition is then lim ɛ n+1 = 0. n () Single Step Methods 1 October / 44

25 Numerical Stability We can simplify this. ɛ n+1 = Q(hλ)ɛ n = Q(hλ) (Q(hλ)ɛ n 1 ) = (Q(hλ)) 2 ɛ n 1 = (Q(hλ)) 3 ɛ n 2 = For numerical stability, This only happens if ɛ n+1 = (Q(hλ)) n+1 ɛ 0 lim ɛ n+1 = lim Q(hλ) n+1 ɛ 0 n h 0 }{{} 0. Q(hλ) < 1. want () Single Step Methods 1 October / 44

26 Numerical Stability To summarize, we can write the numerical method in terms of the amplification factor, The method is stable if w n+1 = Q(hλ)w n. Q(hλ) < 1. We use this to determine the maximum h =step size for which the method is stable. () Single Step Methods 1 October / 44

27 Numerical Stability Euler Forward: (Explicit) For stability, we must have w n+1 = Q(hλ)w n = (1 + hλ)w n Q(hλ) = 1 + hλ < 1 where λ < 0. This gives 0 < h < 2 λ () Single Step Methods 1 October / 44

28 Numerical Stability Euler Backward: (Implicit) w n+1 = Q(hλ)w n = 1 1 hλ w n For stability, we must have Q(hλ) = 1 1 hλ < 1 where λ < 0. This gives h > 0. So that the Euler Backward method is unconditionally stable. () Single Step Methods 1 October / 44

29 Numerical Stability Trapezoidal Method: (Implicit) w n+1 = Q(hλ)w n = 1 + h 2 λ 1 h 2 λw n For stability, we must have 1 + h 2 Q(hλ) = λ 1 h 2 λ < 1 where λ < 0. This gives h > 0. So that the Trapezoidal method is unconditionally stable. () Single Step Methods 1 October / 44

30 Numerical Stability Modified Euler: (Explicit) w n+1 = Q(hλ)w n = (1 + hλ (hλ)2 )w n For stability, we must have Q(hλ) = 1 + hλ (hλ)2 < 1 where λ < 0. This gives 0 < h < 2 λ. () Single Step Methods 1 October / 44

31 Nonlinear Stability A general nonlinear IVP can be written as y (t) = f (t, y(t)) y(t 0 ) = y 0 To find the stability, we have to use Taylor expansion. Expand around (ˆt, ŷ) : f (t, y) f (ˆt, ŷ) + (y ŷ)f y (ˆt, ŷ) + (t ˆt)f t (ˆt, ŷ) + y (t) f (ˆt, ŷ) + (y ŷ)f y (ˆt, ŷ) + (t ˆt)f t (ˆt, ŷ) + So that y (t) f (ˆt, ŷ) (y ŷ) f y (ˆt, ŷ) +(t ˆt)f t (ˆt, ŷ) + }{{}}{{}}{{} ɛ (t) ɛ(t) λ () Single Step Methods 1 October / 44

32 Nonlinear Stability For nonlinear equations, the stability is given by λ = f y (ˆt, ŷ). Stability depends on ˆt, ŷ. Recall that λ should be negative. () Single Step Methods 1 October / 44

33 Nonlinear Stability Example Given the initial value problem y (t) = 1 + (t y) 2, t [2, 3] y(2) = 1, (1) what is the stability condition using modified Euler? () Single Step Methods 1 October / 44

34 Nonlinear Stability In this example, It is a nonlinear equation with f (t, y) = 1 + (t y) 2. f (t, y) f (2, 1) + (t 2)f t (2, 1) + (y 1)f y (2, 1) = 2 + 2(t 2) 2(y 1) = 2y 2t = 2y + g(t) (2) It is almost like the linear problem y (t) = 2y + g(t) with λ = 2. () Single Step Methods 1 October / 44

35 Nonlinear Stability Therefore, for stability of the the nonlinear problem y (t) = 1 + (t y) 2, we actually consider the stability of the linear problem y (t) = 2y + g(t). But, we know that the stability of modified Euler is given by 0 < h < 2 λ < 2 2 = 1. () Single Step Methods 1 October / 44

36 Example Modified Euler Example Use the modified Euler method to approximate the solution to the initial value problem y (t) = 1 + (t y) 2, t [2, 3] y(2) = 1, (3) with h = 0.5. The exact solution is given by y(t) = t t. Determine the error in the numerical approximation. () Single Step Methods 1 October / 44

37 Example Modified Euler From the previous, we know that h = 0.5 falls within the stability range, 0 < h < 1. The modified Euler method is given by: w n+1 = w n + hf (t n, w n ) w n+1 = w n + h 2 (F (t n, w n ) + F (t n+1, w n+1 )) h = 0.5 t 0 = 2, t 1 = 2.5, t 2 = 3 with w 0 = y 0 = 1, and F (t, y) = 1 + (t y) 2. We have to determine w 1, w 2. () Single Step Methods 1 October / 44

38 Example Modified Euler For w 1 : This becomes w 1 = w 0 + h F (t 0, w 0 ) }{{} 1+(t 0 w 0 ) 2 w 1 = w 0 + h 2 (F (t 0, w 0 ) + F (t 1, w 1 )) }{{} 1+(t 1 w 1 ) 2 w 1 = (1 + (2 1) 2 ) = 2 w 1 = ((1 + (2 1) 2 ) + (1 + (2.5 2) 2 )) = = w 1 The actual value is y(2.5) = = () Single Step Methods 1 October / 44

39 Example Modified Euler For w 2 : This becomes w 2 = w 1 + h F (t 1, w 1 ) }{{} 1+(t 1 w 1 ) 2 w 2 = w 1 + h 2 (F (t 1, w 1 ) + F (t 2, w 2 )) }{{} 1+(t 2 w 2 ) 2 w 2 = w 2 = The actual value is y(3) = = 2.5 () Single Step Methods 1 October / 44

40 Example Modified Euler To summarize: n t n y(t) w n Error where w n is obtained using the modified Euler () Single Step Methods 1 October / 44

41 Summary Today, we have addressed the following important topics: Lax Equivalence Theorem: For a linear scheme, Stability + Consistency = Convergence Stability is how much small perturbations affect the solution. For this we have to look at Stability of the initial value problem (IVP) Stability of the numerical method () Single Step Methods 1 October / 44

42 Summary IVP Stability For the stability of the initial value problem (IVP), we consider ɛ(t) = There are three possibilities: ỹ(t) y(t) }{{} perturbed problem 1 It is unstable if lim t ɛ(t) 2 It is stable if lim t ɛ(t) < (finite) 3 It is unconditionally stable if lim t ɛ(t) 0 Usually, this equates to λ < 0. () Single Step Methods 1 October / 44

43 Summary Numerical Stability For numerical stability, we must consider the amplification factor, Q(hλ) in The possiblities are: w n+1 = Q(hλ)w n = (Q(hλ)) n+1 w 0. 1 The method is unstable if lim h 0 Q(hλ) > 1. 2 The method is stable if lim h 0 Q(hλ) < 1. We use these conditions to choose an appropriate bound on h. () Single Step Methods 1 October / 44

44 Material addressed 1 Review Difference Formula vs. Interpolation Richardson s Extrapolation 2 Initial Value Problems (IVP s) Single-step methods Amplification factor Stability Nonlinear Stability Material in book: Chapter 6 Useful exercises: 1,3,4,5b,5c,6 () Single Step Methods 1 October / 44

Ordinary differential equation II

Ordinary 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 information

DELFT UNIVERSITY OF TECHNOLOGY Faculty of Electrical Engineering, Mathematics and Computer Science

DELFT UNIVERSITY OF TECHNOLOGY Faculty of Electrical Engineering, Mathematics and Computer Science DELFT UNIVERSITY OF TECHNOLOGY Faculty of Electrical Engineering, Mathematics and Computer Science ANSWERS OF THE TEST NUMERICAL METHODS FOR DIFFERENTIAL EQUATIONS (WI097 TU) Thursday January 014, 18:0-1:0

More information

DELFT UNIVERSITY OF TECHNOLOGY Faculty of Electrical Engineering, Mathematics and Computer Science

DELFT UNIVERSITY OF TECHNOLOGY Faculty of Electrical Engineering, Mathematics and Computer Science DELFT UNIVERSITY OF TECHNOLOGY Faculty of Electrical Engineering, Mathematics and Computer Science ANSWERS OF THE TEST NUMERICAL METHODS FOR DIFFERENTIAL EQUATIONS ( WI3097 TU AESB0 ) Thursday April 6

More information

Numerical Methods - Initial Value Problems for ODEs

Numerical 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 information

Math 128A Spring 2003 Week 12 Solutions

Math 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 information

Ordinary Differential Equations

Ordinary Differential Equations CHAPTER 8 Ordinary Differential Equations 8.1. Introduction My section 8.1 will cover the material in sections 8.1 and 8.2 in the book. Read the book sections on your own. I don t like the order of things

More information

multistep methods Last modified: November 28, 2017 Recall that we are interested in the numerical solution of the initial value problem (IVP):

multistep methods Last modified: November 28, 2017 Recall that we are interested in the numerical solution of the initial value problem (IVP): MATH 351 Fall 217 multistep methods http://www.phys.uconn.edu/ rozman/courses/m351_17f/ Last modified: November 28, 217 Recall that we are interested in the numerical solution of the initial value problem

More information

Linear Multistep Methods I: Adams and BDF Methods

Linear Multistep Methods I: Adams and BDF Methods Linear Multistep Methods I: Adams and BDF Methods Varun Shankar January 1, 016 1 Introduction In our review of 5610 material, we have discussed polynomial interpolation and its application to generating

More information

Consistency and Convergence

Consistency 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 information

Numerical Methods for Differential Equations

Numerical Methods for Differential Equations Numerical Methods for Differential Equations Chapter 2: Runge Kutta and Multistep Methods Gustaf Söderlind Numerical Analysis, Lund University Contents V4.16 1. Runge Kutta methods 2. Embedded RK methods

More information

ECE257 Numerical Methods and Scientific Computing. Ordinary Differential Equations

ECE257 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 information

Ordinary Differential Equations

Ordinary Differential Equations Ordinary Differential Equations Introduction: first order ODE We are given a function f(t,y) which describes a direction field in the (t,y) plane an initial point (t 0,y 0 ) We want to find a function

More information

Ordinary Differential Equations I

Ordinary Differential Equations I Ordinary Differential Equations I CS 205A: Mathematical Methods for Robotics, Vision, and Graphics Justin Solomon CS 205A: Mathematical Methods Ordinary Differential Equations I 1 / 27 Theme of Last Three

More information

CS 450 Numerical Analysis. Chapter 9: Initial Value Problems for Ordinary Differential Equations

CS 450 Numerical Analysis. Chapter 9: Initial Value Problems for Ordinary Differential Equations Lecture slides based on the textbook Scientific Computing: An Introductory Survey by Michael T. Heath, copyright c 2018 by the Society for Industrial and Applied Mathematics. http://www.siam.org/books/cl80

More information

NUMERICAL SOLUTION OF ODE IVPs. Overview

NUMERICAL SOLUTION OF ODE IVPs. Overview NUMERICAL SOLUTION OF ODE IVPs 1 Quick review of direction fields Overview 2 A reminder about and 3 Important test: Is the ODE initial value problem? 4 Fundamental concepts: Euler s Method 5 Fundamental

More information

Initial value problems for ordinary differential equations

Initial value problems for ordinary differential equations Initial value problems for ordinary differential equations Xiaojing Ye, Math & Stat, Georgia State University Spring 2019 Numerical Analysis II Xiaojing Ye, Math & Stat, Georgia State University 1 IVP

More information

FDM for parabolic equations

FDM for parabolic equations FDM for parabolic equations Consider the heat equation where Well-posed problem Existence & Uniqueness Mass & Energy decreasing FDM for parabolic equations CNFD Crank-Nicolson + 2 nd order finite difference

More information

Numerical solution of ODEs

Numerical solution of ODEs Numerical solution of ODEs Arne Morten Kvarving Department of Mathematical Sciences Norwegian University of Science and Technology November 5 2007 Problem and solution strategy We want to find an approximation

More information

8.1 Introduction. Consider the initial value problem (IVP):

8.1 Introduction. Consider the initial value problem (IVP): 8.1 Introduction Consider the initial value problem (IVP): y dy dt = f(t, y), y(t 0)=y 0, t 0 t T. Geometrically: solutions are a one parameter family of curves y = y(t) in(t, y)-plane. Assume solution

More information

Lecture 4: Numerical solution of ordinary differential equations

Lecture 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 information

CHAPTER 5: Linear Multistep Methods

CHAPTER 5: Linear Multistep Methods CHAPTER 5: Linear Multistep Methods Multistep: use information from many steps Higher order possible with fewer function evaluations than with RK. Convenient error estimates. Changing stepsize or order

More information

Ordinary Differential Equations I

Ordinary Differential Equations I Ordinary Differential Equations I CS 205A: Mathematical Methods for Robotics, Vision, and Graphics Justin Solomon CS 205A: Mathematical Methods Ordinary Differential Equations I 1 / 32 Theme of Last Few

More information

Lecture Notes to Accompany. Scientific Computing An Introductory Survey. by Michael T. Heath. Chapter 9

Lecture Notes to Accompany. Scientific Computing An Introductory Survey. by Michael T. Heath. Chapter 9 Lecture Notes to Accompany Scientific Computing An Introductory Survey Second Edition by Michael T. Heath Chapter 9 Initial Value Problems for Ordinary Differential Equations Copyright c 2001. Reproduction

More information

Scientific Computing: An Introductory Survey

Scientific Computing: An Introductory Survey Scientific Computing: An Introductory Survey Chapter 9 Initial Value Problems for Ordinary Differential Equations Prof. Michael T. Heath Department of Computer Science University of Illinois at Urbana-Champaign

More information

APPLICATIONS OF FD APPROXIMATIONS FOR SOLVING ORDINARY DIFFERENTIAL EQUATIONS

APPLICATIONS OF FD APPROXIMATIONS FOR SOLVING ORDINARY DIFFERENTIAL EQUATIONS LECTURE 10 APPLICATIONS OF FD APPROXIMATIONS FOR SOLVING ORDINARY DIFFERENTIAL EQUATIONS Ordinary Differential Equations Initial Value Problems For Initial Value problems (IVP s), conditions are specified

More information

Initial value problems for ordinary differential equations

Initial value problems for ordinary differential equations AMSC/CMSC 660 Scientific Computing I Fall 2008 UNIT 5: Numerical Solution of Ordinary Differential Equations Part 1 Dianne P. O Leary c 2008 The Plan Initial value problems (ivps) for ordinary differential

More information

2tdt 1 y = t2 + C y = which implies C = 1 and the solution is y = 1

2tdt 1 y = t2 + C y = which implies C = 1 and the solution is y = 1 Lectures - Week 11 General First Order ODEs & Numerical Methods for IVPs In general, nonlinear problems are much more difficult to solve than linear ones. Unfortunately many phenomena exhibit nonlinear

More information

Applied Math for Engineers

Applied Math for Engineers Applied Math for Engineers Ming Zhong Lecture 15 March 28, 2018 Ming Zhong (JHU) AMS Spring 2018 1 / 28 Recap Table of Contents 1 Recap 2 Numerical ODEs: Single Step Methods 3 Multistep Methods 4 Method

More information

DELFT UNIVERSITY OF TECHNOLOGY Faculty of Electrical Engineering, Mathematics and Computer Science

DELFT UNIVERSITY OF TECHNOLOGY Faculty of Electrical Engineering, Mathematics and Computer Science DELFT UNIVERSITY OF TECHNOLOGY Faculty of Electrical Engineering, Matematics and Computer Science. ANSWERS OF THE TEST NUMERICAL METHODS FOR DIFFERENTIAL EQUATIONS (WI3097 TU) Tuesday January 9 008, 9:00-:00

More information

Mathematics for chemical engineers. Numerical solution of ordinary differential equations

Mathematics for chemical engineers. Numerical solution of ordinary differential equations Mathematics for chemical engineers Drahoslava Janovská Numerical solution of ordinary differential equations Initial value problem Winter Semester 2015-2016 Outline 1 Introduction 2 One step methods Euler

More information

The family of Runge Kutta methods with two intermediate evaluations is defined by

The family of Runge Kutta methods with two intermediate evaluations is defined by AM 205: lecture 13 Last time: Numerical solution of ordinary differential equations Today: Additional ODE methods, boundary value problems Thursday s lecture will be given by Thomas Fai Assignment 3 will

More information

Numerical Differential Equations: IVP

Numerical 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 information

Lecture 10: Finite Differences for ODEs & Nonlinear Equations

Lecture 10: Finite Differences for ODEs & Nonlinear Equations Lecture 10: Finite Differences for ODEs & Nonlinear Equations J.K. Ryan@tudelft.nl WI3097TU Delft Institute of Applied Mathematics Delft University of Technology 21 November 2012 () Finite Differences

More information

Lecture Notes for Math 251: ODE and PDE. Lecture 7: 2.4 Differences Between Linear and Nonlinear Equations

Lecture Notes for Math 251: ODE and PDE. Lecture 7: 2.4 Differences Between Linear and Nonlinear Equations Lecture Notes for Math 51: ODE and PDE. Lecture 7:.4 Differences Between Linear and Nonlinear Equations Shawn D. Ryan Spring 01 1 Existence and Uniqueness Last Time: We developed 1st Order ODE models for

More information

Ordinary Differential Equations I

Ordinary Differential Equations I Ordinary Differential Equations I CS 205A: Mathematical Methods for Robotics, Vision, and Graphics Doug James (and Justin Solomon) CS 205A: Mathematical Methods Ordinary Differential Equations I 1 / 35

More information

Fourth Order RK-Method

Fourth 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 information

A Brief Introduction to Numerical Methods for Differential Equations

A Brief Introduction to Numerical Methods for Differential Equations A Brief Introduction to Numerical Methods for Differential Equations January 10, 2011 This tutorial introduces some basic numerical computation techniques that are useful for the simulation and analysis

More information

CS520: numerical ODEs (Ch.2)

CS520: numerical ODEs (Ch.2) .. CS520: numerical ODEs (Ch.2) Uri Ascher Department of Computer Science University of British Columbia ascher@cs.ubc.ca people.cs.ubc.ca/ ascher/520.html Uri Ascher (UBC) CPSC 520: ODEs (Ch. 2) Fall

More information

Introduction to numerical schemes

Introduction to numerical schemes 236861 Numerical Geometry of Images Tutorial 2 Introduction to numerical schemes Heat equation The simple parabolic PDE with the initial values u t = K 2 u 2 x u(0, x) = u 0 (x) and some boundary conditions

More information

Ordinary differential equations - Initial value problems

Ordinary differential equations - Initial value problems Education has produced a vast population able to read but unable to distinguish what is worth reading. G.M. TREVELYAN Chapter 6 Ordinary differential equations - Initial value problems In this chapter

More information

Do not turn over until you are told to do so by the Invigilator.

Do 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 information

Numerical Methods for Ordinary Differential Equations

Numerical Methods for Ordinary Differential Equations Numerical Methods for Ordinary Differential Equations Answers of the exercises C Vuik, S van Veldhuizen and S van Loenhout 08 Delft University of Technology Faculty Electrical Engineering, Mathematics

More information

Scientific Computing with Case Studies SIAM Press, Lecture Notes for Unit V Solution of

Scientific Computing with Case Studies SIAM Press, Lecture Notes for Unit V Solution of Scientific Computing with Case Studies SIAM Press, 2009 http://www.cs.umd.edu/users/oleary/sccswebpage Lecture Notes for Unit V Solution of Differential Equations Part 1 Dianne P. O Leary c 2008 1 The

More information

Ordinary Differential Equations

Ordinary Differential Equations Chapter 13 Ordinary Differential Equations We motivated the problem of interpolation in Chapter 11 by transitioning from analzying to finding functions. That is, in problems like interpolation and regression,

More information

Introduction to Initial Value Problems

Introduction to Initial Value Problems Chapter 2 Introduction to Initial Value Problems The purpose of this chapter is to study the simplest numerical methods for approximating the solution to a first order initial value problem (IVP). Because

More information

Review Higher Order methods Multistep methods Summary HIGHER ORDER METHODS. P.V. Johnson. School of Mathematics. Semester

Review Higher Order methods Multistep methods Summary HIGHER ORDER METHODS. P.V. Johnson. School of Mathematics. Semester HIGHER ORDER METHODS School of Mathematics Semester 1 2008 OUTLINE 1 REVIEW 2 HIGHER ORDER METHODS 3 MULTISTEP METHODS 4 SUMMARY OUTLINE 1 REVIEW 2 HIGHER ORDER METHODS 3 MULTISTEP METHODS 4 SUMMARY OUTLINE

More information

Finite Differences for Differential Equations 28 PART II. Finite Difference Methods for Differential Equations

Finite Differences for Differential Equations 28 PART II. Finite Difference Methods for Differential Equations Finite Differences for Differential Equations 28 PART II Finite Difference Methods for Differential Equations Finite Differences for Differential Equations 29 BOUNDARY VALUE PROBLEMS (I) Solving a TWO

More information

4 Stability analysis of finite-difference methods for ODEs

4 Stability analysis of finite-difference methods for ODEs MATH 337, by T. Lakoba, University of Vermont 36 4 Stability analysis of finite-difference methods for ODEs 4.1 Consistency, stability, and convergence of a numerical method; Main Theorem In this Lecture

More information

Numerical Methods for Differential Equations

Numerical Methods for Differential Equations Numerical Methods for Differential Equations Chapter 2: Runge Kutta and Linear Multistep methods Gustaf Söderlind and Carmen Arévalo Numerical Analysis, Lund University Textbooks: A First Course in the

More information

First Order ODEs, Part II

First Order ODEs, Part II Craig J. Sutton craig.j.sutton@dartmouth.edu Department of Mathematics Dartmouth College Math 23 Differential Equations Winter 2013 Outline Existence & Uniqueness Theorems 1 Existence & Uniqueness Theorems

More information

Chapter 2: First Order DE 2.4 Linear vs. Nonlinear DEs

Chapter 2: First Order DE 2.4 Linear vs. Nonlinear DEs Chapter 2: First Order DE 2.4 Linear vs. Nonlinear DEs First Order DE 2.4 Linear vs. Nonlinear DE We recall the general form of the First Oreder DEs (FODE): dy = f(t, y) (1) dt where f(t, y) is a function

More information

Ordinary Differential Equation Theory

Ordinary Differential Equation Theory Part I Ordinary Differential Equation Theory 1 Introductory Theory An n th order ODE for y = y(t) has the form Usually it can be written F (t, y, y,.., y (n) ) = y (n) = f(t, y, y,.., y (n 1) ) (Implicit

More information

Numerical Methods for the Solution of Differential Equations

Numerical Methods for the Solution of Differential Equations Numerical Methods for the Solution of Differential Equations Markus Grasmair Vienna, winter term 2011 2012 Analytical Solutions of Ordinary Differential Equations 1. Find the general solution of the differential

More information

Backward error analysis

Backward error analysis Backward error analysis Brynjulf Owren July 28, 2015 Introduction. The main source for these notes is the monograph by Hairer, Lubich and Wanner [2]. Consider ODEs in R d of the form ẏ = f(y), y(0) = y

More information

Numerical Methods. King Saud University

Numerical Methods. King Saud University Numerical Methods King Saud University Aims In this lecture, we will... find the approximate solutions of derivative (first- and second-order) and antiderivative (definite integral only). Numerical Differentiation

More information

Butcher tableau Can summarize an s + 1 stage Runge Kutta method using a triangular grid of coefficients

Butcher tableau Can summarize an s + 1 stage Runge Kutta method using a triangular grid of coefficients AM 205: lecture 13 Last time: ODE convergence and stability, Runge Kutta methods Today: the Butcher tableau, multi-step methods, boundary value problems Butcher tableau Can summarize an s + 1 stage Runge

More information

Finite Differences: Consistency, Stability and Convergence

Finite Differences: Consistency, Stability and Convergence Finite Differences: Consistency, Stability and Convergence Varun Shankar March, 06 Introduction Now that we have tackled our first space-time PDE, we will take a quick detour from presenting new FD methods,

More information

First Order Differential Equations Lecture 3

First Order Differential Equations Lecture 3 First Order Differential Equations Lecture 3 Dibyajyoti Deb 3.1. Outline of Lecture Differences Between Linear and Nonlinear Equations Exact Equations and Integrating Factors 3.. Differences between Linear

More information

The Definition and Numerical Method of Final Value Problem and Arbitrary Value Problem Shixiong Wang 1*, Jianhua He 1, Chen Wang 2, Xitong Li 1

The Definition and Numerical Method of Final Value Problem and Arbitrary Value Problem Shixiong Wang 1*, Jianhua He 1, Chen Wang 2, Xitong Li 1 The Definition and Numerical Method of Final Value Problem and Arbitrary Value Problem Shixiong Wang 1*, Jianhua He 1, Chen Wang 2, Xitong Li 1 1 School of Electronics and Information, Northwestern Polytechnical

More information

1 Ordinary Differential Equations

1 Ordinary Differential Equations Ordinary Differential Equations.0 Mathematical Background.0. Smoothness Definition. A function f defined on [a, b] is continuous at ξ [a, b] if lim x ξ f(x) = f(ξ). Remark Note that this implies existence

More information

1 Error Analysis for Solving IVP

1 Error Analysis for Solving IVP cs412: introduction to numerical analysis 12/9/10 Lecture 25: Numerical Solution of Differential Equations Error Analysis Instructor: Professor Amos Ron Scribes: Yunpeng Li, Mark Cowlishaw, Nathanael Fillmore

More information

Solving Ordinary Differential Equations

Solving Ordinary Differential Equations Solving Ordinary Differential Equations Sanzheng Qiao Department of Computing and Software McMaster University March, 2014 Outline 1 Initial Value Problem Euler s Method Runge-Kutta Methods Multistep Methods

More information

Numerical Analysis of Differential Equations Numerical Solution of Parabolic Equations

Numerical Analysis of Differential Equations Numerical Solution of Parabolic Equations Numerical Analysis of Differential Equations 215 6 Numerical Solution of Parabolic Equations 6 Numerical Solution of Parabolic Equations TU Bergakademie Freiberg, SS 2012 Numerical Analysis of Differential

More information

Basic Aspects of Discretization

Basic Aspects of Discretization Basic Aspects of Discretization Solution Methods Singularity Methods Panel method and VLM Simple, very powerful, can be used on PC Nonlinear flow effects were excluded Direct numerical Methods (Field Methods)

More information

y + p(t)y = g(t) for each t I, and that also satisfies the initial condition y(t 0 ) = y 0 where y 0 is an arbitrary prescribed initial value.

y + p(t)y = g(t) for each t I, and that also satisfies the initial condition y(t 0 ) = y 0 where y 0 is an arbitrary prescribed initial value. p1 Differences Between Linear and Nonlinear Equation Theorem 1: If the function p and g are continuous on an open interval I : α < t < β containing the point t = t 0, then there exists a unique function

More information

Introduction to multiscale modeling and simulation. Explicit methods for ODEs : forward Euler. y n+1 = y n + tf(y n ) dy dt = f(y), y(0) = y 0

Introduction to multiscale modeling and simulation. Explicit methods for ODEs : forward Euler. y n+1 = y n + tf(y n ) dy dt = f(y), y(0) = y 0 Introduction to multiscale modeling and simulation Lecture 5 Numerical methods for ODEs, SDEs and PDEs The need for multiscale methods Two generic frameworks for multiscale computation Explicit methods

More information

Jim Lambers MAT 772 Fall Semester Lecture 21 Notes

Jim Lambers MAT 772 Fall Semester Lecture 21 Notes Jim Lambers MAT 772 Fall Semester 21-11 Lecture 21 Notes These notes correspond to Sections 12.6, 12.7 and 12.8 in the text. Multistep Methods All of the numerical methods that we have developed for solving

More information

Graded Project #1. Part 1. Explicit Runge Kutta methods. Goals Differential Equations FMN130 Gustaf Söderlind and Carmen Arévalo

Graded Project #1. Part 1. Explicit Runge Kutta methods. Goals Differential Equations FMN130 Gustaf Söderlind and Carmen Arévalo 2008-11-07 Graded Project #1 Differential Equations FMN130 Gustaf Söderlind and Carmen Arévalo This homework is due to be handed in on Wednesday 12 November 2008 before 13:00 in the post box of the numerical

More information

Numerical Methods for Engineers and Scientists

Numerical Methods for Engineers and Scientists Numerical Methods for Engineers and Scientists Second Edition Revised and Expanded Joe D. Hoffman Department of Mechanical Engineering Purdue University West Lafayette, Indiana m MARCEL D E К К E R MARCEL

More information

Chapter 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. (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 information

Numerical Methods. Scientists. Engineers

Numerical Methods. Scientists. Engineers Third Edition Numerical Methods for Scientists and Engineers K. Sankara Rao Numerical Methods for Scientists and Engineers Numerical Methods for Scientists and Engineers Third Edition K. SANKARA RAO Formerly,

More information

Ordinary Differential Equations

Ordinary 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 information

2 Numerical Methods for Initial Value Problems

2 Numerical Methods for Initial Value Problems Numerical Analysis of Differential Equations 44 2 Numerical Methods for Initial Value Problems Contents 2.1 Some Simple Methods 2.2 One-Step Methods Definition and Properties 2.3 Runge-Kutta-Methods 2.4

More information

Differential Equations

Differential Equations Differential Equations Overview of differential equation! Initial value problem! Explicit numeric methods! Implicit numeric methods! Modular implementation Physics-based simulation An algorithm that

More information

AN OVERVIEW. Numerical Methods for ODE Initial Value Problems. 1. One-step methods (Taylor series, Runge-Kutta)

AN OVERVIEW. Numerical Methods for ODE Initial Value Problems. 1. One-step methods (Taylor series, Runge-Kutta) AN OVERVIEW Numerical Methods for ODE Initial Value Problems 1. One-step methods (Taylor series, Runge-Kutta) 2. Multistep methods (Predictor-Corrector, Adams methods) Both of these types of methods are

More information

Selected HW Solutions

Selected HW Solutions Selected HW Solutions HW1 1 & See web page notes Derivative Approximations. For example: df f i+1 f i 1 = dx h i 1 f i + hf i + h h f i + h3 6 f i + f i + h 6 f i + 3 a realmax 17 1.7014 10 38 b realmin

More information

Modeling & Simulation 2018 Lecture 12. Simulations

Modeling & Simulation 2018 Lecture 12. Simulations Modeling & Simulation 2018 Lecture 12. Simulations Claudio Altafini Automatic Control, ISY Linköping University, Sweden Summary of lecture 7-11 1 / 32 Models of complex systems physical interconnections,

More information

Differential Equations. Lectures INF2320 p. 1/64

Differential Equations. Lectures INF2320 p. 1/64 Differential Equations Lectures INF2320 p. 1/64 Lectures INF2320 p. 2/64 Differential equations A differential equations is: an equations that relate a function to its derivatives in such a way that the

More information

Multistep Methods for IVPs. t 0 < t < T

Multistep Methods for IVPs. t 0 < t < T Multistep Methods for IVPs We are still considering the IVP dy dt = f(t,y) t 0 < t < T y(t 0 ) = y 0 So far we have looked at Euler s method, which was a first order method and Runge Kutta (RK) methods

More information

Ordinary Differential Equations II

Ordinary 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 information

Lecture 2. Introduction to Differential Equations. Roman Kitsela. October 1, Roman Kitsela Lecture 2 October 1, / 25

Lecture 2. Introduction to Differential Equations. Roman Kitsela. October 1, Roman Kitsela Lecture 2 October 1, / 25 Lecture 2 Introduction to Differential Equations Roman Kitsela October 1, 2018 Roman Kitsela Lecture 2 October 1, 2018 1 / 25 Quick announcements URL for the class website: http://www.math.ucsd.edu/~rkitsela/20d/

More information

Ordinary Differential Equations II

Ordinary 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 information

Numerical Treatment of IVP ODEs... in a Nutshell

Numerical Treatment of IVP ODEs... in a Nutshell Numerical Treatment of IVP ODEs... in a Nutshell AT Patera, M Yano October 31, 2014 Draft V1.3 MIT 2014. From Math, Numerics, & Programming for Mechanical Engineers... in a Nutshell by AT Patera and M

More information

Review for Exam 2 Ben Wang and Mark Styczynski

Review for Exam 2 Ben Wang and Mark Styczynski Review for Exam Ben Wang and Mark Styczynski This is a rough approximation of what we went over in the review session. This is actually more detailed in portions than what we went over. Also, please note

More information

Notation Nodes are data points at which functional values are available or at which you wish to compute functional values At the nodes fx i

Notation Nodes are data points at which functional values are available or at which you wish to compute functional values At the nodes fx i LECTURE 6 NUMERICAL DIFFERENTIATION To find discrete approximations to differentiation (since computers can only deal with functional values at discrete points) Uses of numerical differentiation To represent

More information

Solutions to Math 53 Math 53 Practice Final

Solutions to Math 53 Math 53 Practice Final Solutions to Math 5 Math 5 Practice Final 20 points Consider the initial value problem y t 4yt = te t with y 0 = and y0 = 0 a 8 points Find the Laplace transform of the solution of this IVP b 8 points

More information

2.29 Numerical Fluid Mechanics Fall 2011 Lecture 20

2.29 Numerical Fluid Mechanics Fall 2011 Lecture 20 2.29 Numerical Fluid Mechanics Fall 2011 Lecture 20 REVIEW Lecture 19: Finite Volume Methods Review: Basic elements of a FV scheme and steps to step-up a FV scheme One Dimensional examples d x j x j 1/2

More information

AM205: Assignment 3 (due 5 PM, October 20)

AM205: 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 information

Numerical Solution of ODE IVPs

Numerical Solution of ODE IVPs L.G. de Pillis and A.E. Radunskaya July 30, 2002 This work was supported in part by a grant from the W.M. Keck Foundation 0-0 NUMERICAL SOLUTION OF ODE IVPs Overview 1. Quick review of direction fields.

More information

Ordinary Differential Equations: Initial Value problems (IVP)

Ordinary 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

Time stepping methods

Time stepping methods Time stepping methods ATHENS course: Introduction into Finite Elements Delft Institute of Applied Mathematics, TU Delft Matthias Möller (m.moller@tudelft.nl) 19 November 2014 M. Möller (DIAM@TUDelft) Time

More information

Research Article Diagonally Implicit Block Backward Differentiation Formulas for Solving Ordinary Differential Equations

Research Article Diagonally Implicit Block Backward Differentiation Formulas for Solving Ordinary Differential Equations International Mathematics and Mathematical Sciences Volume 212, Article ID 767328, 8 pages doi:1.1155/212/767328 Research Article Diagonally Implicit Block Backward Differentiation Formulas for Solving

More information

You may not use your books, notes; calculators are highly recommended.

You may not use your books, notes; calculators are highly recommended. Math 301 Winter 2013-14 Midterm 1 02/06/2014 Time Limit: 60 Minutes Name (Print): Instructor This exam contains 8 pages (including this cover page) and 6 problems. Check to see if any pages are missing.

More information

Runge-Kutta and Collocation Methods Florian Landis

Runge-Kutta and Collocation Methods Florian Landis Runge-Kutta and Collocation Methods Florian Landis Geometrical Numetric Integration p.1 Overview Define Runge-Kutta methods. Introduce collocation methods. Identify collocation methods as Runge-Kutta methods.

More information

Understand the existence and uniqueness theorems and what they tell you about solutions to initial value problems.

Understand the existence and uniqueness theorems and what they tell you about solutions to initial value problems. Review Outline To review for the final, look over the following outline and look at problems from the book and on the old exam s and exam reviews to find problems about each of the following topics.. Basics

More information

Euler s Method, cont d

Euler 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 information

Finite difference methods for the diffusion equation

Finite difference methods for the diffusion equation Finite difference methods for the diffusion equation D150, Tillämpade numeriska metoder II Olof Runborg May 0, 003 These notes summarize a part of the material in Chapter 13 of Iserles. They are based

More information

Do not turn over until you are told to do so by the Invigilator.

Do 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 MTHE712B Time allowed: 3 Hours Attempt QUESTIONS 1 and 2, and THREE other questions.

More information

Math 256: Applied Differential Equations: Final Review

Math 256: Applied Differential Equations: Final Review Math 256: Applied Differential Equations: Final Review Chapter 1: Introduction, Sec 1.1, 1.2, 1.3 (a) Differential Equation, Mathematical Model (b) Direction (Slope) Field, Equilibrium Solution (c) Rate

More information

Woods Hole Methods of Computational Neuroscience. Differential Equations and Linear Algebra. Lecture Notes

Woods Hole Methods of Computational Neuroscience. Differential Equations and Linear Algebra. Lecture Notes Woods Hole Methods of Computational Neuroscience Differential Equations and Linear Algebra Lecture Notes c 004, 005 William L. Kath MCN 005 ODE & Linear Algebra Notes 1. Classification of differential

More information