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

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

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

Consistency and Convergence

(f(x) P 3 (x)) dx. (a) The Lagrange formula for the error is given by

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

PowerPoints organized by Dr. Michael R. Gustafson II, Duke University

Math 128A Spring 2003 Week 12 Solutions

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

Euler s Method, cont d

Numerical Analysis Preliminary Exam 10.00am 1.00pm, January 19, 2018

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

Review. Numerical Methods Lecture 22. Prof. Jinbo Bi CSE, UConn

Numerical Methods - Initial Value Problems for ODEs

PowerPoints organized by Dr. Michael R. Gustafson II, Duke University

ENO and WENO schemes. Further topics and time Integration

Numerical Methods for Ordinary Differential Equations

Department of Applied Mathematics and Theoretical Physics. AMA 204 Numerical analysis. Exam Winter 2004

KINGS COLLEGE OF ENGINEERING DEPARTMENT OF MATHEMATICS ACADEMIC YEAR / EVEN SEMESTER QUESTION BANK

Fourth Order RK-Method

Exam in TMA4215 December 7th 2012

MATHEMATICAL PROBLEM SOLVING, MECHANICS AND MODELLING MTHA4004Y

Numerical Integration of Linear and Nonlinear Wave Equations

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

PowerPoints organized by Dr. Michael R. Gustafson II, Duke University

MecE 390 Final examination, Winter 2014

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

NUMERICAL ANALYSIS STUDY GUIDE. Topic # Rootfinding

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

5. Hand in the entire exam booklet and your computer score sheet.

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

Numerical Methods for Differential Equations

Solving scalar IVP s : Runge-Kutta Methods

MATHEMATICAL MODELLING, MECHANICS AND MOD- ELLING MTHA4004Y

Notes on Numerical Analysis

Ordinary Differential Equations II

Scientific Computing: An Introductory Survey

Jim Lambers MAT 460/560 Fall Semester Practice Final Exam

Ordinary Differential Equations II

NUMERICAL METHODS FOR ENGINEERING APPLICATION

Finite Differences: Consistency, Stability and Convergence

Chap. 20: Initial-Value Problems

CS 257: Numerical Methods

Math 216 Final Exam 14 December, 2012

ECE257 Numerical Methods and Scientific Computing. Ordinary Differential Equations

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

Section 7.4 Runge-Kutta Methods

Janacek statistics tables (2009 edition) are available on your desk. Do not turn over until you are told to do so by the Invigilator.

7 Hyperbolic Differential Equations

Part IB Numerical Analysis

Attempt QUESTIONS 1 and 2, and THREE other questions. penalised if you attempt additional questions.

Preface. 2 Linear Equations and Eigenvalue Problem 22

Attempt QUESTIONS 1 and 2, and THREE other questions. Do not turn over until you are told to do so by the Invigilator.

Numerical Differential Equations: IVP

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

Selected HW Solutions

Applied Math for Engineers

Attempt QUESTIONS 1 and 2, and THREE other questions. Do not turn over until you are told to do so by the Invigilator.

Chapter 11 ORDINARY DIFFERENTIAL EQUATIONS

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

Initial value problems for ordinary differential equations

ASSIGNMENT BOOKLET. Numerical Analysis (MTE-10) (Valid from 1 st July, 2011 to 31 st March, 2012)

Checking the Radioactive Decay Euler Algorithm

Numerical Analysis Preliminary Exam 10 am to 1 pm, August 20, 2018

Ordinary differential equations - Initial value problems

Lösning: Tenta Numerical Analysis för D, L. FMN011,

δ Substituting into the differential equation gives: x i+1 x i δ f(t i,x i ) (3)

x x2 2 + x3 3 x4 3. Use the divided-difference method to find a polynomial of least degree that fits the values shown: (b)

A New Fourth-Order Non-Oscillatory Central Scheme For Hyperbolic Conservation Laws

Contents. I Basic Methods 13

Attempt QUESTIONS 1 and 2, and THREE other questions. penalised if you attempt additional questions.

Lecture 42 Determining Internal Node Values

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

Attempt QUESTIONS 1 and 2, and THREE other questions. penalised if you attempt additional questions.

Numerical solution of ODEs

Euler s Method, Taylor Series Method, Runge Kutta Methods, Multi-Step Methods and Stability.

+ h4. + h5. 6! f (5) i. (C.3) Since., it yields

Numerical Analysis Comprehensive Exam Questions

Attempt QUESTIONS 1 and 2, and THREE other questions. penalised if you attempt additional questions.

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

Module 6 : Solving Ordinary Differential Equations - Initial Value Problems (ODE-IVPs) Section 1 : Introduction

Module 4: Numerical Methods for ODE. Michael Bader. Winter 2007/2008

Ordinary Differential Equations

Jim Lambers MAT 772 Fall Semester Lecture 21 Notes

Introduction to the Numerical Solution of IVP for ODE

9.6 Predictor-Corrector Methods

PH.D. PRELIMINARY EXAMINATION MATHEMATICS

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

Lecture 5: Single Step Methods

Ordinary Differential Equations

Module Contact: Dr Steven Hayward, CMP Copyright of the University of East Anglia Version 1

Introductory Numerical Analysis

A Brief Introduction to Numerical Methods for Differential Equations

Ordinary differential equations. Phys 420/580 Lecture 8

Mathematics for chemical engineers. Numerical solution of ordinary differential equations

Physics 584 Computational Methods

Chapter 10 Exercises

Attempt THREE questions. You will not be penalised if you attempt additional questions.

Ordinary Differential Equations

Solution: (a) Before opening the parachute, the differential equation is given by: dv dt. = v. v(0) = 0

Modeling & Simulation 2018 Lecture 12. Simulations

Transcription:

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. Notes are not permitted in this examination. Do not turn over until you are told to do so by the Invigilator. MTHE712B Module Contact: Dr. Jennifer Ryan, MTH Copyright of the University of East Anglia Version: 2

- 2-1. Consider the linear hyperbolic equation where α is a given constant. u t + α u =, x (x, t) [, 2π (, T, (1) u(x, ) =u (x), (i) Consider the discretised equation using the Lax-Wendroff finite difference method, u n+1 j = ν 2 (1 + ν)un j 1 + (1 ν 2 )u n j ν 2 (1 ν)un j+1. Assume that the approximation at (x j, t) is given by u n j = û(t)e ikx. (a) Derive the amplification factor for the Lax-Wendroff method. (b) Use the relation that (1 ν 2 ) iν sin(kh) + ν 2 cos(kh) 1 to obtain the stability condition for ν for the Lax-Wendroff approximation. [11 marks (ii) (a) Give an interpretation for what it means for a numerical method to be conservative. (b) Let ū n j = 1 x xj+1/2 x j 1/2 Finite Volume formulation, be the cell average over I j = (x j 1/2, x j+1/2 ). Derive the ū n+1 j = ū n j t x (F n j+1/2 F n j 1/2), that is used to approximate solutions to the Equation u t + f(u) =. x [9 marks MTHE712B Version: 2

- 3-2. Consider the two point Gauss Quadrature rule 1 1 f(x) dx = w 1 f(x 1 ) + w 2 f(x 2 ) such that the nodes x 1, x 2 and weights w 1, w 2 are given by w 1 (x 1 ) m + w 2 (x 2 ) m = 1 m + 1 [1 ( 1)m+1, m =,..., 3. (2) (i) Use Equation (2) and the fact that w 1 = w 2 and x 1 = x 2 to determine the nodes and weights in the Gauss Quadrature formula. [8 marks (ii) Notice the above formula is for integrating a function over ( 1, 1). Transform this formula to apply to integrating a function over the general interval (a, b). That is, determine the formula that applies to b a f(x) dx. (iii) Consider the integral 1 x m dx. (a) For which values of m is the two-point Gauss Quadrature rule is exact? (b) Evaluate the exact integral. For the values of m = 3, 4, approximate the integral using the Gauss quadrature rule and determine the error. [7 marks MTHE712B PLEASE TURN OVER Version: 2

- 4-3. We seek a difference formula for the first derivative of a function f(x) at x = of the form such that Q(h) = 1 h ( ( α f h ) ) + α 1 f() + α 2 f(h) 2 f () Q(h) = O(h 2 ). (3) (i) Give the first four terms for the Taylor expansions of f( h ), f(), f(h) around 2 zero. (ii) Use the results from (i) and Equation (3) to show that the coefficients α, α 1 and α 2 satisfy the system 1 1 1 1/2 1 1/8 1/2 α α 1 α 2 = 1 and that the solution is therefore α = 4 3, α 1 = 1, α 2 = 1 3. [6 marks (iii) Use the information in Table 1 along with Richardson s method which assumes that the form of the error is f () Q(h) = Kh 2 to give an estimate of the error f () Q(1/5) and determine the constant, K. [9 marks x -.4 -.3 -.2 -.1.1.2.3.4 f(x) -.9511 -.89 -.5878 -.39.32.5878.89.9511 Table 1: The values of a function, f(x), for a given x. MTHE712B Version: 2

- 5-4. Suppose that we are given the nonlinear equation f(x) =. (i) Let p be a fixed point of a function f(x) such that f has a continuous derivative. Consider the fixed point iteration p k+1 = g(p k ) = p k f(p k) α, α R. Show that this always converges to a fixed point of f(x) if < f (p) < α and p sufficiently close to p by first stating the Convergence theorem. [15 marks (ii) Consider the Newton-Raphson method p n+1 = p n f(p n) f (p n ). (a) Determine p 1 using the Newton-Raphson method for f(x) = x 2 2x 2 with p = 1. (b) Can p = 1 be used as the beginning value? Why or why not? MTHE712B PLEASE TURN OVER Version: 2

- 6-5. For the numerical integration of the first order differential equation y = f(t, y), y() = y, we use the modified Euler method 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)), (4) where h denotes the timestep and w n represents the numerical solution at time t n. (i) By using the general form of the equation, y = f(t, y), show that the local truncation error is of order O(h 2 ). [1 marks (ii) Consider the initial value problem d dt [ x1 x 2 [ x1 x 2 [ 1 = 3 4 = [ 1 2. [ x1 x 2 [ + cos(t), Calculate one step with the modified Euler method, in which h = 1 1 and t = using the given initial conditions. (iii) Determine the amplification factor. MTHE712B Version: 2

- 7-6. For the numerical solution of the differential equation y = f(t, y) with y() = y, we use the fourth order Runge-Kutta method (RK4): k 1 = hf(t n, w n ), k 3 = hf(t n +.5h, w n +.5k 2 ), k 2 = hf(t n +.5h, w n +.5k 1 ), k 4 = hf(t n + h, w n + k 3 ), w n+1 = w n + 1 6 (k 1 + 2(k 2 + k 3 ) + k 4 ). and consider the equation [ [ d x1 = dt x 2 1 251 1 [ x1 x 2 [ + cos(t). (5) Figure 1: The stability region for RK4. (i) Find the eigenvalues of the matrix in Equation (5). (ii) Use the illustration in Figure 1 to give an approximate stability condition. (iii) Derive the amplification factor for RK4. (iv) Use the fact that y(t n+1 ) = e hλ y(t n ) holds for the exact solution of y = λy to show that the RK4 method solves the homogeneous test equation with a local truncation error of O(h 4 ). MTHE712B PLEASE TURN OVER Version: 2

- 8 - END OF PAPER MTHE712B Version: 2

MTHE612B/MTHE712B Exam Feedback Overall students did well on the exams, especially students that performed all coursework and laboratory exercises during the semester. Q1: This question was overall done well. The difficulties were: MTHE712B: The definition of conservative scheme and why a finite volume approximation is needed appeared to be lacking. MTHE612B: Overall students did well on this problem, but some had difficulty obtaining an error bound. Q2: The majority of the students did well. The only difficulty seemed to be in evaluating the integral and determining for which values of m the quadrature rule is exact. Q3: The majority of the students did well. However, some had difficulty in deriving the equations that determine the coefficients. Q4: Those that chose to do this problem did well. Q5: The difficulties encountered on this question were: (i) not performing the correct expansion for the modified Euler method; and (ii) neglecting to apply the method to the system of equations. Q5: The main difficulty of this question was not identifying the stability region of the 4th order Runge-Kutta method to be 2.8 λ. 1