DELFT UNIVERSITY OF TECHNOLOGY Faculty of Electrical Engineering, Mathematics and Computer Science
|
|
- Dorcas Jennings
- 6 years ago
- Views:
Transcription
1 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 05, 8:30-:30. [a] The test equation is given by y = λy, and we bear in mind that the amplification factor is defined by w n+ = Q(hλ)w n. () Then for the Trapezoidal Rule, we get w n+ = w n + h (λwn + λw n+ ) = w n + hλ (wn + w n+ ). () The above equation is rewritten as w n+ ( hλ ) = wn ( + hλ ). (3) Then, using the definition of the amplification factor, we immediately have Q T (hλ) = + hλ hλ The Modified Euler Method is treated analogously, to get. (4) ŵ n+ = w n + hλw n, w n+ = w n + h (λwn + λŵ n+ ), Combining the predictor and corrector, gives predictor corrector. (5) w n+ = w n + hλ (wn + w n + hλw n ) = w n ( + hλ + (hλ) ). (6) Finally, the definition of the amplification factor implies that [b] The local truncation error is defined by Q ME (hλ) = + hλ + (hλ). (7) τ n+ (h) = yn+ z n+, (8) h
2 where y n+ and z n+, respectively, denote the exact solution and the numerical approximation at time t n+ under using y n. Since, we use the test equation to estimate the local truncation error, we get z n+ = Q(hλ)y n. (9) The exact solution to the test equation at time t n+ is expressed in terms of y n by y n+ = y n e λh. (0) Substitution into the definition of the local truncation error, gives τ n+ (h) = yn h (ehλ Q(hλ)) = yn (hλ) ( + hλ + h + (hλ)3 3! + O(h 4 ) Q(hλ)), () where we used the Taylor expansion of the exponential around 0. For the Trapezoidal Rule, we have Q T (hλ) = + hλ hλ + hλ + (hλ) = ( + hλ )( + hλ + (hλ ) + ( hλ )3 + O(h 4 )) = + (hλ)3 4 + O(h 4 ). Using equation (), we get after some rearrangements () τ n+ (h) = yn λ 3 h + O(h 3 ) = O(h ). (3) The Modified Euler Method is treated similarly with to give via equation () Q ME (hλ) = + hλ + (hλ), (4) τ n+ (h) = yn λ 3 h + O(h 3 ) = O(h ). (5) 6 [c] Let y = y and let y = y, then y = y = y. Hence we have y = y, y = 4y + t. (6) The two equations are linear and therewith, one can rewrite this system using a matrix representation: ( ) ( ) ( ) ( ) y 0 y 0 = +, (7) 4 0 t y y
3 Further, we have y (0) = y(0) = and y (0) = y (0) = 0. [d] We use h =, and let A = ( ) ( ) 0 w, w = 4 0 w, w 0 = ( ), (8) 0 where the subscript stands for the component, whereas the superscript denotes the time index. The Trapezoidal Rule gives w = w 0 + h ( ) 0 (Aw0 + Aw + ). (9) This gives (I h A)w = (I + h A)w0 + h ( ) 0. (0) Substitution of h =, gives the following linear system ( ) ( ) 4 w = 3. () 4 This system is solved by w = ( ) Next, we treat the Modified Euler Method. First, we carry out the prediction step ( ) ŵ = w 0 + haw 0 = + ( ) 0 =. (3) 0 4 Subsequently, we perform the corrector step Using h =, gives w = w = w 0 + h ( ) + (( ) ( Aw 0 + Aŵ + ( ) + 4 () ( )) 0. (4) ( )) 0 = 3 4 [e] The local truncation errors for both methods are approximated by. (5) τn+(h) T = yn λ 3 h, τn+ EM (h) = yn λ 3 h. (6) 6 3
4 From these equations, it can be seen that the errors have the same order, although the error from the Trapezoidal Rule is about twice as small as the one from the Modified Euler Method in the limit for h 0. With regard to stability, the eigenvalues of A in the present initial value problem, are given by λ = ±i. Herewith, the following amplification factors are obtained: This gives the following moduli Q T (h) = + ±ih ±ih, Q ME(h) = ± ih h. (7) Q T (h) =, Q ME (h) = ( h ) + 4h = + 4h 4 >. (8) Hence the Trapezoidal Rule is neutrally stable, whereas the Modified Euler Method is unstable. The workload is smaller for the Modified Euler Method, since no linear system needs to be solved. Although the solution of the linear system may require considerable computation time if A is a very large matrix, the issue is not very important for the present case. Therefore, the Trapezoidal Rule is to be preferred for the present system since the system is just a two-by-two set of equations. Furthermore the Modified Euler Method is instable.. (a) Consider y(x) = x, then y (x) = x and y (x) =, substitution into the differential equation yields y (x) + xy = + xx = x 3, (9) hence y(x) = x satisfies the differential equation. Next, we check the boundary conditions: y (0) = 0 = 0 and y() = = which proves that the boundary conditions are also satisfied. Hence, y(x) = x is a solution of the boundary value problem. (b) Using central differences for the second order derivative at a node x j = jh, gives y (x j ) y j+ y j + y j h =: Q(h). (30) Here y j := y(x j ). Next, we will prove that this approximation is second order accurate, that is y (x j ) Q(h) = O(h ). Using Taylor s Theorem around x = x j, gives y j+ = y(x j + h) = y(x j ) + hy (x j ) + h y (x j ) + h3 3! y (x j ) + h4 4! y (η + ), y j = y(x j h) = y(x j ) hy (x j ) + h y (x j ) h3 3! y (x j ) + h4 4! y (η ). (3) 4
5 Here, η + and η are numbers within the intervals (x j, x j+ ) and (x j, x j ), respectively. Substitution of these expressions into Q(h) gives y (x j ) Q(h) = O(h ). This leads to the following discretization formula for internal grid nodes: w j + w j w j+ h + x j w j = x 3 j. (3) Here, w j represents the numerical approximation of the solution y j. To deal with the boundary x = 0, we use a virtual node at x = h, and we define y := y( h). Then, using central differences at x = 0 gives Using Taylor s Theorem, gives 0 = y (0) y y h =: Q b (h). (33) Q b (h) = y(0) + hy (0) + h y (0) + h3 3! y (η + ) (y(0) hy (0) + h y (0) h3 3! y (η )) h = y (0) + O(h ). Again, we get an error of O(h ). (c) With respect to the numerical approximation at the virtual node, we get (34) w w h The discretization at x = 0 is given by = 0 w = w. (35) w + w 0 w h =. (36) Substitution of equation (35) into the above equation, yields w 0 w h =. (37) Subsequently, we consider the boundary x =. To this extent, we consider its neighboring point x n, here substitution of the boundary condition w n = y() = y n = into equation (3), gives w n + w n h + x n w n = x 3 n + h = ( h)3 + h. (38) This concludes our discretization of the boundary conditions. In order to get a symmetric discretization matrix, one divides equation (37) by. 5
6 Next, we use h = /3, then, from equations (3, 37, 38), one obtains the following system 9w 0 9w = 9w w 9w = 53 7 (39) 9w w = (d) The truncation errors from the virtual grid point and internal points contain a third- and fourth order derivative, respectively (see part b). Since the exact solution is given by y(x) = x, the third and fourth order derivatives are zero. Hence, the error is zero at all grid points. Therefore, the numerical solution is given by w 0 = y 0 = 0, w = y = /9 and w = y = 4/9. Remark: This numerical solution can also be obtained from the solution of system (39). (e) Consider an interval of integration [x j, x j ], then the Rectangle Rule reads The composed integration rule is derived by I R j = hf(x j ), h = x j x j. (40) I R = h(i R + I R I R n ) = h(f(x 0 ) f(x n )), (4) which yields I R = 3 (0 + ( 3 ) + ( 3 ) ) = 5 7. (4) (f) For the interval of integration [x j, x j ] the Trapezoidal Rule is The composed integration rule is derived by I T = h(i T + I T I T n ) = h( f(x 0) I T j = h (f(x j ) + f(x j )). (43) + f(x ) f(x n ) + f(x n) ), (44) which leads to I T = 3 (0 + ( 3 ) + ( 3 ) + ) = (45) (g) For a general number of subintervals, say n, the magnitude of the composed Rectangle- and Trapezoidal Rules, is bounded from above by ε R h max x [0,] y (x) h = n, ε T h max x [0,] y (x) h 6 = 6n. (46) 6
7 Here, the exact solution y(x) = x was used. Hence, the error from the Trapezoidal Rule is much smaller. Furthermore, from the composed Rules, it is easy to see that the number of function evaluations for the composed Rectangle- and Trapezoidal Rules is given by n and n +, respectively. Since n + lim n n =, (47) it follows that the amount of work for the Trapezoidal Rule is not significantly higher than it is for the Rectangle Rule. Hence, it is more attractive to use the Trapezoidal Rule. 7
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 informationLecture 5: Single Step Methods
Lecture 5: Single Step Methods J.K. Ryan@tudelft.nl WI3097TU Delft Institute of Applied Mathematics Delft University of Technology 1 October 2012 () Single Step Methods 1 October 2012 1 / 44 Outline 1
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 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 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 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 informationTS Method Summary. T k (x,y j 1 ) f(x j 1,y j 1 )+ 2 f (x j 1,y j 1 ) + k 1
TS Method Summary Let T k (x,y j 1 ) denote the first k +1 terms of the Taylor series expanded about the discrete approximation, (x j 1,y j 1 ), and ẑ k,j (x) be the polynomial approximation (to y(x))
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 informationReview 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 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 informationNumerical 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 informationDELFT 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 informationAN 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 information4 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 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 informationApplied 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 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 MTHE712B Time allowed: 3 Hours Attempt QUESTIONS 1 and 2, and THREE other questions.
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 informationMathematics 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 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 informationThe 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 information2.1 NUMERICAL SOLUTION OF SIMULTANEOUS FIRST ORDER ORDINARY DIFFERENTIAL EQUATIONS. differential equations with the initial values y(x 0. ; l.
Numerical Methods II UNIT.1 NUMERICAL SOLUTION OF SIMULTANEOUS FIRST ORDER ORDINARY DIFFERENTIAL EQUATIONS.1.1 Runge-Kutta Method of Fourth Order 1. Let = f x,y,z, = gx,y,z be the simultaneous first order
More informationBindel, Spring 2012 Intro to Scientific Computing (CS 3220) Week 12: Monday, Apr 16. f(x) dx,
Panel integration Week 12: Monday, Apr 16 Suppose we want to compute the integral b a f(x) dx In estimating a derivative, it makes sense to use a locally accurate approximation to the function around the
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 informationNumerical Solutions to Partial Differential Equations
Numerical Solutions to Partial Differential Equations Zhiping Li LMAM and School of Mathematical Sciences Peking University A Model Problem and Its Difference Approximations 1-D Initial Boundary Value
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 information8.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 informationNumerical 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 informationTHE TRAPEZOIDAL QUADRATURE RULE
y 1 Computing area under y=1/(1+x^2) 0.9 0.8 0.7 0.6 0.5 0.4 0.3 0.2 0.1 0 0 0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 1 Trapezoidal rule x THE TRAPEZOIDAL QUADRATURE RULE From Chapter 5, we have the quadrature
More informationInitial 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 informationScientific 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 informationFinite 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 informationCS 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 informationNumerical Solution of Second Order Singularly Perturbed Differential Difference Equation with Negative Shift. 1 Introduction
ISSN 749-3889 print), 749-3897 online) International Journal of Nonlinear Science Vol.8204) No.3,pp.200-209 Numerical Solution of Second Order Singularly Perturbed Differential Difference Equation with
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 informationNumerical 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 informationLecture 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 informationNumerical 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 informationOrdinary 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 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 informationChapter 8. Numerical Solution of Ordinary Differential Equations. Module No. 1. Runge-Kutta Methods
Numerical Analysis by Dr. Anita Pal Assistant Professor Department of Mathematics National Institute of Technology Durgapur Durgapur-71309 email: anita.buie@gmail.com 1 . Chapter 8 Numerical Solution of
More informationNumerical Methods in Physics and Astrophysics
Kostas Kokkotas 2 November 6, 2007 2 kostas.kokkotas@uni-tuebingen.de http://www.tat.physik.uni-tuebingen.de/kokkotas Kostas Kokkotas 3 Error Analysis Definition : Suppose that x is an approximation to
More informationHIGHER ORDER METHODS. There are two principal means to derive higher order methods. b j f(x n j,y n j )
HIGHER ORDER METHODS There are two principal means to derive higher order methods y n+1 = p j=0 a j y n j + h p j= 1 b j f(x n j,y n j ) (a) Method of Undetermined Coefficients (b) Numerical Integration
More information1 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 informationOrdinary 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 informationOrdinary 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 informationNotes on floating point number, numerical computations and pitfalls
Notes on floating point number, numerical computations and pitfalls November 6, 212 1 Floating point numbers An n-digit floating point number in base β has the form x = ±(.d 1 d 2 d n ) β β e where.d 1
More informationx n+1 = x n f(x n) f (x n ), n 0.
1. Nonlinear Equations Given scalar equation, f(x) = 0, (a) Describe I) Newtons Method, II) Secant Method for approximating the solution. (b) State sufficient conditions for Newton and Secant to converge.
More informationExamination paper for TMA4215 Numerical Mathematics
Department of Mathematical Sciences Examination paper for TMA425 Numerical Mathematics Academic contact during examination: Trond Kvamsdal Phone: 93058702 Examination date: 6th of December 207 Examination
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 informationContinuous Block Hybrid-Predictor-Corrector method for the solution of y = f (x, y, y )
International Journal of Mathematics and Soft Computing Vol., No. 0), 5-4. ISSN 49-8 Continuous Block Hybrid-Predictor-Corrector method for the solution of y = f x, y, y ) A.O. Adesanya, M.R. Odekunle
More informationResearch Computing with Python, Lecture 7, Numerical Integration and Solving Ordinary Differential Equations
Research Computing with Python, Lecture 7, Numerical Integration and Solving Ordinary Differential Equations Ramses van Zon SciNet HPC Consortium November 25, 2014 Ramses van Zon (SciNet HPC Consortium)Research
More informationSolving PDEs with PGI CUDA Fortran Part 4: Initial value problems for ordinary differential equations
Solving PDEs with PGI CUDA Fortran Part 4: Initial value problems for ordinary differential equations Outline ODEs and initial conditions. Explicit and implicit Euler methods. Runge-Kutta methods. Multistep
More informationSolutions Preliminary Examination in Numerical Analysis January, 2017
Solutions Preliminary Examination in Numerical Analysis January, 07 Root Finding The roots are -,0, a) First consider x 0 > Let x n+ = + ε and x n = + δ with δ > 0 The iteration gives 0 < ε δ < 3, which
More informationVirtual University of Pakistan
Virtual University of Pakistan File Version v.0.0 Prepared For: Final Term Note: Use Table Of Content to view the Topics, In PDF(Portable Document Format) format, you can check Bookmarks menu Disclaimer:
More informationComputation Fluid Dynamics
Computation Fluid Dynamics CFD I Jitesh Gajjar Maths Dept Manchester University Computation Fluid Dynamics p.1/189 Garbage In, Garbage Out We will begin with a discussion of errors. Useful to understand
More informationDifferential 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 informationNumerical Solutions to Partial Differential Equations
Numerical Solutions to Partial Differential Equations Zhiping Li LMAM and School of Mathematical Sciences Peking University The Implicit Schemes for the Model Problem The Crank-Nicolson scheme and θ-scheme
More informationLecture 6. Numerical Solution of Differential Equations B21/B1. Lecture 6. Lecture 6. Initial value problem. Initial value problem
Lecture 6 Numerical Solution of Differential Equations B2/B Initial value problem y = f(x,y), x [x,x M ] y(x ) = y Professor Endre Süli Numerical Solution of Differential Equations p./45 Numerical Solution
More informationMini project ODE, TANA22
Mini project ODE, TANA22 Filip Berglund (filbe882) Linh Nguyen (linng299) Amanda Åkesson (amaak531) October 2018 1 1 Introduction Carl David Tohmé Runge (1856 1927) was a German mathematician and a prominent
More informationInitial Value Problems
Numerical Analysis, lecture 13: Initial Value Problems (textbook sections 10.1-4, 10.7) differential equations standard form existence & uniqueness y 0 y 2 solution methods x 0 x 1 h h x 2 y1 Euler, Heun,
More informationEquations with regular-singular points (Sect. 5.5).
Equations with regular-singular points (Sect. 5.5). Equations with regular-singular points. s: Equations with regular-singular points. Method to find solutions. : Method to find solutions. Recall: The
More informationNAME: MA Sample Final Exam. Record all your answers on the answer sheet provided. The answer sheet is the only thing that will be graded.
NAME: MA 300 Sample Final Exam PUID: INSTRUCTIONS There are 5 problems on 4 pages. Record all your answers on the answer sheet provided. The answer sheet is the only thing that will be graded. No books
More informationNumerical 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 informationSolving 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 informationEAD 115. Numerical Solution of Engineering and Scientific Problems. David M. Rocke Department of Applied Science
EAD 115 Numerical Solution of Engineering and Scientific Problems David M. Rocke Department of Applied Science Multidimensional Unconstrained Optimization Suppose we have a function f() of more than one
More informationA Survey of Numerical Methods in Fractional Calculus
A Survey of Numerical Methods in Fractional Calculus Fractional Derivatives in Mechanics: State of the Art CNAM Paris, 17 November 2006 Kai Diethelm diethelm@gns-mbh.com, k.diethelm@tu-bs.de Gesellschaft
More informationPrinciples of Scientific Computing Local Analysis
Principles of Scientific Computing Local Analysis David Bindel and Jonathan Goodman last revised January 2009, printed February 25, 2009 1 Among the most common computational tasks are differentiation,
More informationIntroduction to the Numerical Solution of IVP for ODE
Introduction to the Numerical Solution of IVP for ODE 45 Introduction to the Numerical Solution of IVP for ODE Consider the IVP: DE x = f(t, x), IC x(a) = x a. For simplicity, we will assume here that
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 information12 The Heat equation in one spatial dimension: Simple explicit method and Stability analysis
ATH 337, by T. Lakoba, University of Vermont 113 12 The Heat equation in one spatial dimension: Simple explicit method and Stability analysis 12.1 Formulation of the IBVP and the minimax property of its
More information2tdt 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 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 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 informationJim Lambers MAT 460/560 Fall Semester Practice Final Exam
Jim Lambers MAT 460/560 Fall Semester 2009-10 Practice Final Exam 1. Let f(x) = sin 2x + cos 2x. (a) Write down the 2nd Taylor polynomial P 2 (x) of f(x) centered around x 0 = 0. (b) Write down the corresponding
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 informationLecture 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 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 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 Analysis Preliminary Exam 10.00am 1.00pm, January 19, 2018
Numerical Analysis Preliminary Exam 0.00am.00pm, January 9, 208 Instructions. You have three hours to complete this exam. Submit solutions to four (and no more) of the following six problems. Please start
More informationNumerical Methods in Physics and Astrophysics
Kostas Kokkotas 2 October 17, 2017 2 http://www.tat.physik.uni-tuebingen.de/ kokkotas Kostas Kokkotas 3 TOPICS 1. Solving nonlinear equations 2. Solving linear systems of equations 3. Interpolation, approximation
More informationDepartment of Applied Mathematics Preliminary Examination in Numerical Analysis August, 2013
Department of Applied Mathematics Preliminary Examination in Numerical Analysis August, 013 August 8, 013 Solutions: 1 Root Finding (a) Let the root be x = α We subtract α from both sides of x n+1 = x
More informationOne-Step Hybrid Block Method with One Generalized Off-Step Points for Direct Solution of Second Order Ordinary Differential Equations
Applied Mathematical Sciences, Vol. 10, 2016, no. 29, 142-142 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ams.2016.6127 One-Step Hybrid Block Method with One Generalized Off-Step Points for
More informationExponential and. Logarithmic Functions. Exponential Functions. Logarithmic Functions
Chapter Five Exponential and Logarithmic Functions Exponential Functions Logarithmic Functions Properties of Logarithms Exponential Equations Exponential Situations Logarithmic Equations Exponential Functions
More informationAn Exponentially Fitted Non Symmetric Finite Difference Method for Singular Perturbation Problems
An Exponentially Fitted Non Symmetric Finite Difference Method for Singular Perturbation Problems GBSL SOUJANYA National Institute of Technology Department of Mathematics Warangal INDIA gbslsoujanya@gmail.com
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 informationMath 20B Supplement. Bill Helton. September 23, 2004
Math 0B Supplement Bill Helton September 3, 004 1 Supplement to Appendix G Supplement to Appendix G and Chapters 7 and 9 of Stewart Calculus Edition 5: August 003 Contents 1 Complex Exponentials: For Appendix
More informationNotation 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 informationMath 20B Supplement. Bill Helton. August 3, 2003
Math 0B Supplement Bill Helton August 3, 003 Supplement to Appendix G Supplement to Appendix G and Chapters 7 and 9 of Stewart Calculus Edition 4: August 003 Contents Complex Exponentials: For Appendix
More informationMB4018 Differential equations
MB4018 Differential equations Part II http://www.staff.ul.ie/natalia/mb4018.html Prof. Natalia Kopteva Spring 2015 MB4018 (Spring 2015) Differential equations Part II 0 / 69 Section 1 Second-Order Linear
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 informationExplicit One-Step Methods
Chapter 1 Explicit One-Step Methods Remark 11 Contents This class presents methods for the numerical solution of explicit systems of initial value problems for ordinary differential equations of first
More information16.1 Runge-Kutta Method
704 Chapter 6. Integration of Ordinary Differential Equations CITED REFERENCES AND FURTHER READING: Gear, C.W. 97, Numerical Initial Value Problems in Ordinary Differential Equations (Englewood Cliffs,
More informationM.SC. PHYSICS - II YEAR
MANONMANIAM SUNDARANAR UNIVERSITY DIRECTORATE OF DISTANCE & CONTINUING EDUCATION TIRUNELVELI 627012, TAMIL NADU M.SC. PHYSICS - II YEAR DKP26 - NUMERICAL METHODS (From the academic year 2016-17) Most Student
More informationLecture 38. Almost Linear Systems
Math 245 - Mathematics of Physics and Engineering I Lecture 38. Almost Linear Systems April 20, 2012 Konstantin Zuev (USC) Math 245, Lecture 38 April 20, 2012 1 / 11 Agenda Stability Properties of Linear
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 informationLinear Multistep Methods
Linear Multistep Methods Linear Multistep Methods (LMM) A LMM has the form α j x i+j = h β j f i+j, α k = 1 i 0 for the approximate solution of the IVP x = f (t, x), x(a) = x a. We approximate x(t) on
More informationVariational Methods & Optimal Control
Variational Methods & Optimal Control lecture 12 Matthew Roughan Discipline of Applied Mathematics School of Mathematical Sciences University of Adelaide April 14, 216
More informationNonlinear Autonomous Systems of Differential
Chapter 4 Nonlinear Autonomous Systems of Differential Equations 4.0 The Phase Plane: Linear Systems 4.0.1 Introduction Consider a system of the form x = A(x), (4.0.1) where A is independent of t. Such
More informationMath 660 Lecture 4: FDM for evolutionary equations: ODE solvers
Math 660 Lecture 4: FDM for evolutionary equations: ODE solvers Consider the ODE u (t) = f(t, u(t)), u(0) = u 0, where u could be a vector valued function. Any ODE can be reduced to a first order system,
More information