New Third Order Runge Kutta Based on Contraharmonic Mean for Stiff Problems
|
|
- Kelly Higgins
- 5 years ago
- Views:
Transcription
1 Applied Mathematical Sciences, Vol., 2009, no. 8, New Third Order Runge Kutta Based on Contraharmonic Mean for Stiff Problems Osama Yusuf Ababneh 1 and Rokiah Rozita School of Mathematical Sciences Faculty of Science and Technology Universiti Kebangsaan Malaysia Abstract In this paper we introduce an explicit one step method that can be used for solving stiff problems. This method can be viewed as a modification of the explicit third order runge-kutta method using the contraharmonic mean (C o M) that allows rducing the stiffiness in some sense. The stability of the method is analyzed and numerical results shown to verify the conclusions.numerical examples indicate that this method is superior compared to some existing methods including the third and fourth order contraharmonic mean methods,abm method, classical third order Runge-Kutta, and Wazwaz method. Mathematics Subject Classifications: 51N20, 62J05, 70F99 Keywords: ODE solver; Runge-Kutta method; contraharmonic mean; stiff problems 1 Introduction It has been suggested that The problem of stiffness is very difficult to be solved by explicit methods but recently many explicit methods were introduced and developed to solve the stiff problems like 1 ]. In this paper we introduced a Runge-Kutta like explicit method can be used to solve stiff problems and give a good accuracy butter than wide of an explicit methods. Theorm 1.1 ]: If an p stage explicit Runge-Kutta contraharmonic mean(c 0 M) method has order N where N then p N. 1 ababneh@math.com
2 66 O. Y. Ababneh and R. Rozita As a 2 stage formula of second order the contraharmonic mean( C 0 M ) method is k 2 y n+1 = y n + h 1 + k2 2 ] k 1 + k 2 where k 1 = f(x n,y n ), k 2 = f(x n + h, y n + hk 1 ). A rd -order method for -stages of the ( C 0 M ) method are given in the form where, y n+1 = y n + h 2 k k 2 2 k 1 + k 2 + k2 2 + k2 k 2 + k k 1 = f(x n,y n ), k 2 = f(x n + h 2,y n + h 2 k 1), k = f(x n + h 2,y n + h 2 k 2). The fourth order contraharmonic mean ( C 0 M ) method can be expressed in the form y n+1 = y n + h k 2 ] 1 +k2 2 k 1 +k 2 + k2 2 +k2 k 2 +k + k2 +k2 k +k where k 1 = f(x n,y n ), k 2 = f(x n + h 2,y n + h 2 k 1), k = f(x n + h 2,y n hk hk 2). k = f(x n + h, y n + 1 hk 1 hk k ). 2 Modified C 0 M Weights Runge-Kutta Method (MCHW-RK) It is possible to establish a three-stage Runge-Kutta formula based on the contraharmonic mean using the mean in the main formula which can be presented as follows: ] y n+1 = y n + h w 1 k k2 2 k 1 + k 2 + w 2 k k2 k 2 + k ] (1)
3 Third order Runge Kutta based on contraharmonic mean 67 where k 1 = f(x n,y n )=f, k 2 = f(x n + ha 1,y n + ha 1 k 1 ), k = f(x n + h(a 2 + a ),y n + h(a 2 k 1 + a k 2 ). w 1 and w 2 are the weights chosen in such a way so that a 1 and a 2 are parameters to be determined and k2 i +k2 i+1 k i +k i+1 is defined as the contraharmonic mean. Notice that for simplicity of the algebra f have been considered as a function of y only, without loss of generality. This will considerably reduce the Taylor series expansions of k i i =1, 2,, to the following k 1 = f (2) k 2 = f + ha 1 ff y f 2 a 2 1 h2 f yy f h a 1 f yyy +... () k = f + h(a 2 + a )ff y + h 2 (a 1 a ff 2 y (a 2 + a ) 2 f 2 f yy )+ () h ( 1 2 a2 1 a f 2 f y f yy + a 1 a (a 2 + a )f 2 f y f yy (a 2 + a ) f f yyy )+... Traditionally, the equations (2)-() would be substituted to obtain an expression of y n+1 in terms of the function together with the parameters a i, i =2, and its derivatives. Since the algebra involved is the division of two series, k 2 i + k 2 i+1 k i + k i+1,i= 1(1) (5) direct substitution cannot be done. These problems are alleviated by multiplying the terms across with the common denominator(k 1 + k 2 )(k 2 + k )and can be written as y n+1 = y n + upper (6) lower with and upper = h(w 1 (k k2 2 )(k 2 + k )+w 2 (k k2 )(k 1 + k 2 )) lower =(k 1 + k 2 )(k 2 + k )
4 68 O. Y. Ababneh and R. Rozita Taylor series expansion of y(x n+1 ) may be written as Taylor = y n + hf h2 ff y h (ff 2 y + f 2 f yy )+ (7) h (f f yyy +f 2 f y f yy + ff y )+.. Since the error of the method can be measured using the expression thus, we get Error = y(x n+1 ) y n+1 Error = Taylor upper lower which could be written as Error lower = Taylor lower upper (8) Comparing the coefficients of the same terms in(8) up to the term h,the following equations of conditions were obtained: f 2 h : w 1 w 2 + = 0 (9) h 2 f f y : 6a 1 w 1 6a 1 w 2 2a 2 w 1 a 2 w 2 (10) 2a w 1 a w 2 +2+a 1 +2a 2 +2a =0 h f f 2 y : a 2 1w 1 a 2 1w 2 2a 1 a 2 w 1 2a 1 a 2 w 2 2a 2 2w 2 a 1 a w 1 (11) 6w 2 a 1 a 6w 2 a 1 a w 2 a 2 a h f f yy : a 2 1 w 1 a 2 1 w 2 a 2 2 w 1 2a 2 2 w 2 2a 2 a w 1 a 2 a w 2 (12) a 2 w 1 2w 2 a (2 + 6a2 1 +a a 2 a +a 2 )=0 Solving equations (9)-(12) using MATHEMATICA 5] we obtained a set of parameters and weights a shown below. w 2 =,w 1 = 1,a = 21 ( + 2)
5 Third order Runge Kutta based on contraharmonic mean 69 a 2 =0,a 1 = 1 7 ( 2) The third order contraharmonic mean.rk formula MCHW-RK can be represented by k 1 = f(x n,y n ), k 2 = f(x n + h 2,y n + h 2 k 1), k = f(x n + h 21 ( + 2),y n + h 21 ( + 2)k 2 ). y n+1 = y n + h 1 k1 2 + k2 2 + k2 2 + k 2 ] k 1 + k 2 k 2 + k (1) (1) Stability Analysis To check on the stability, the equations in(1) and(1) are substituted into the simple test equation proposed by Dahlquist6] is used y = λy and it yields k 1 = f(x n,y n )=λy n (15) k 2 = f(x n + h 1 7 ( 2),y n + h 1 7 ( 2)hλy n ) (16) = λ(y n ( 2)hλy n )=λy n ( ( 2)hλ) k = f(x n + h 21 ( + 2),y n + h 21 ( + 2)λy n ( ( 2)hλ)) (17) = λ(y n + h 21 ( + 2)λy n ( ( 2)hλ)) = λy n (1 + h 21 ( + 2)λ( ( 2)hλ)) Substituting (15), (16) and (17) in (1), and letting z = hλ, we obtain the simplified equation y n+1 = y n + h ( λ 2 y 2 n 1 λ 2 yn( z 2 7 2z z2 8 2z2 9 ) λy n(1+( ( 2)z) 2z z z z 2 +( )z ) z λy n(( ( 2)z)+(1+ 21 (+ 2)z( ( 2)z))) z )
6 70 O. Y. Ababneh and R. Rozita y n+1 = y n + h 1 λy n ( z λy n( z 2 7 2z z2 8 2z2 9 ) (1+( ( 2)z) 2z z (( ( 2)z)+(1+ + 2z 2 +( )z z (+ 2)z( ( 2)z))) z ) y n+1 = y n + zy n ( z ( z 2 7 2z z2 8 2z2 9 ) (1+( ( 2)z) 2z z (( ( 2)z)+(1+ which yield the stability polynomial: 1 (2+ y n+1 = y n (1 + z 8 7 z z 2 +( )z z (+ 2)z( ( 2)z))) 2z z2 8 2z2 9 ) (1+( ( 2)z) ( z z z (( ( 2)z)+(1+ or in more simplified form, where R(z) =1+z 1 ( z z ) 2z 2 +( )z ) z y n+1 = y n R(z) ( z 2 7 2z z2 8 2z2 9 ) (1+( ( 2)z)) 2z z (( ( 2)z)+(1+ 21 (+ 2)z( ( 2)z))) z ) 2z 2 +( )z z (+ 2)z( ( 2)z))) z ) The stability region for the above formula is illustrated in the graphs below: Stiff problem ] ).1 Definition8]: if a numerical method is forced to use, in an interval of integration, a stepsize is forced to be excessively small relative to dominant time-scale of the solution to get a smooth approximation of the exact solution in that interval,then the problem is said to be stiff in that interval. According to Definition.1, in order to get a smooth approximation of the solution need to use very small stepsize for stiff problems. In practice use large stepsize to reduce computational costs.
7 Third order Runge Kutta based on contraharmonic mean 71 5 Numerical Experiments The MCHW RK is tested on two examples of ordinary differential equations which are stiff problems to check on the accuracy of this method,we will comparing the new method by some existing methods with defrrent h and n,including the third and fourth order contraharmonic mean (C 0 M) methods],adam Bashforth Moulton method method(abm), classical third order Runge-Kutta,Nystrom method and Waswas method7], where the third order classical Runge-Kutta method uses the formula where k 1 = f(x n,y n ), k 2 = f(x n + h 2,y n + h 2 k 1), k = f(x n + h, y n hk 1 +2hk 2 ). y n+1 = y n + h 6 k 1 +k 2 + k ] Example 1: Consider the stiff ordinary differential equation with the exact solution y (t) = 100y(t)+e 2t ; y(0) = 0 y(t) = e 100t ( 1+e 98t ) was considered over the range 0 t 1 using a stepsize h =, and h = Discussion and Conclusion The research done in this paper shows the possibility of constructing method out of the various forms of explicit three-stage third order contraharmonic mean Runge-Kutta formula to solve stiff problem. With the purpose of verifying the accuracy, the example used is solved using the MCHW-RK method and some existing methods.figures 1, 2 and demonstrate the stability for the new method, the results show excellent accuracy of the MCHW RK method using tow step sizes,h= and h=0.02 which are better than all the methods results unless classical RK method,nevertheless classical RK method shows a better results when h= compared to h=0.02 which shows that this method requires more iteration to obtain a better accuracy and same thing for the third order CH-RK,but the new method gives abetter accuracy than calssical RK
8 72 O. Y. Ababneh and R. Rozita and CH-RK when h=0.02 Table 1 shows the numerical solutions and the absolute errors of the example for the methods when h= whilst Table 2 when h=0.02. The results of using the MCHW RK method and the other methods for solving this stiff problem on the interval 0,1] are presented in Figures,5,6,7,8,9 and 10. Figures 6 and 7 show that the classical RK and RK methods definitely seems to have difficulty of the aproximation when h=0.02 but without difficulties with h=.however, the MCHW RK method performs perfectly well, even for h= and h=0.02 as shown in Figure (a) and (b).in Figures 7 10 the computed solutions of this problem with h=0.02 using the third and fourth order contraharmonic mean (C 0 M) methods(ch-rk and CH-RK),Adam Bashforth Moulton method(abm) and Waswas methed are performed poorly. from this discussion it is clearly confirmed that the MCHW RK method is appropriate for stiff problems. References 1] P. Novati, An Explicit One-Step Method for Stiff Problems,Springer Journal, Volume 71, Number 2 / October, ] Xin-Yuan Wu,A Sixth-Order A-Stable Explicit One-Step Method for Stiff Systems, Computers Math. Applic. Volume 5, No.9,pp. 59-6, ] R. R. Ahmad and N.Yaacob,Third-order composite Runge-Kutta method for stiff problems, International Journal of Computer Mathematics Vol. 82, No. 10, October 2005, ] A.R.Yaakub and D.J.Evans, A fourt order Runge Kutta RK(,) method with error control,international Journal of Computer Mathematics Vol. 71, October 1999, 811 5] Wolfram S Mathematica : A System For Doing Mathematics By Computer. 2nd Ed. Addison-Wesley Publishing Company. 6] G.Dahlquist and A.Bjorck.,Numerical Methods,Prentice Hall Inc., ] Wazwaz A. M., A Modified Third Order Runge-Kutta method. Appl. Math Letter. Vol () ] Shirley Jun Ying Huang. implementation of Genral Linear Methods for Stiff Ordinary Differential Equations. PHD thesis.the university of Auckland p 28, 2005 Received: July, 2008
9 Third order Runge Kutta based on contraharmonic mean 7 Table 1: the absolute error of the Explicit MCHW-RK method, h= on the equations y = -100y(t)+exp(-2t) compared to the RK,RK,C 0 M,C 0 M, ABM and WAZWAZ methods Y EXACT MCHW RK RK C 0 M C 0 M ABM WAZWAZ E E-08.10E-08.1E E-08.0E-05.18E E E-07.67E E-08.2E-07.8E E E E E-08.96E E-07.16E E E E E-08.88E E E E E E E-08.00E E E E E E E-08.27E E-07.00E E E E E E E E E E E-08.00E E E E E E-08.E E E E E E E-08.55E E E E E E-05 Table 2: the absolute error of the Explicit MCHW-RK method, h =0.02 on the equations y = -100y(t)+(-2t) compared to the RK,RK,C 0 M,C 0 M, ABM and WAZWAZ methods Y EXACT MCHW RK RK C 0 M C 0 M ABM WAZWAZ E-07.07E-05.98E E E E E E E E E E E E E E E E E+0 1.9E-02.07E E-0 9.9E E E E E-02 6.E E E E-07.8E+00.8E E E E E E-07.96E+00.96E+00.76E E E E E E E E E E-08.2E-07.22E E E E+02.69E E-08.5E-07.5E E E+00.8E E E E E E E E E+00
10 7 O. Y. Ababneh and R. Rozita Figure 1: The stability region of the MCHW-RK method in 2D Q z Im z Re z Figure 2: The stability region of the MCHW-RK method in D.
11 Third order Runge Kutta based on contraharmonic mean 75 Figure : Analytical solution of Example 1 Figure : The MCHW-RK method used to solve the stiff problem for(a) h = and (b) h=0.02. Figure 5: The RK method used to solve the stiff problem for(a) h = and (b) h=0.02. Figure 6: The RK method used to solve the stiff problem for (a) h = and (b) h=0.02.
12 76 O. Y. Ababneh and R. Rozita Figure 7: The (C o M) method used to solve the stiff problem for(a)h = and(b) h= Figure 8: he (C o M) method used to solve the stiff problem for(a)h = and(b)h=0.02. Figure 9: The ABM method used to solve the stiff problem for(a) h=and (b)h= Figure 10: The WAZWAZ method used to solve the stiff problem for(a) h =and(b)h=0.02.
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 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 informationResearch 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 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 informationNumerical Methods - Initial Value Problems for ODEs
Numerical Methods - Initial Value Problems for ODEs Y. K. Goh Universiti Tunku Abdul Rahman 2013 Y. K. Goh (UTAR) Numerical Methods - Initial Value Problems for ODEs 2013 1 / 43 Outline 1 Initial Value
More informationNumerical Differential Equations: IVP
Chapter 11 Numerical Differential Equations: IVP **** 4/16/13 EC (Incomplete) 11.1 Initial Value Problem for Ordinary Differential Equations We consider the problem of numerically solving a differential
More 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 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 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 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 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 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 informationFifth-Order Improved Runge-Kutta Method With Reduced Number of Function Evaluations
Australian Journal of Basic and Applied Sciences, 6(3): 9-5, 22 ISSN 99-88 Fifth-Order Improved Runge-Kutta Method With Reduced Number of Function Evaluations Faranak Rabiei, Fudziah Ismail Department
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 information16.7 Multistep, Multivalue, and Predictor-Corrector Methods
740 Chapter 16. Integration of Ordinary Differential Equations 16.7 Multistep, Multivalue, and Predictor-Corrector Methods The terms multistepand multivaluedescribe two different ways of implementing essentially
More informationModeling & 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 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 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 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 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 informationODE Runge-Kutta methods
ODE Runge-Kutta methods The theory (very short excerpts from lectures) First-order initial value problem We want to approximate the solution Y(x) of a system of first-order ordinary differential equations
More 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 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 informationMath Numerical Analysis Homework #4 Due End of term. y = 2y t 3y2 t 3, 1 t 2, y(1) = 1. n=(b-a)/h+1; % the number of steps we need to take
Math 32 - Numerical Analysis Homework #4 Due End of term Note: In the following y i is approximation of y(t i ) and f i is f(t i,y i ).. Consider the initial value problem, y = 2y t 3y2 t 3, t 2, y() =.
More informationImproved Extended Runge-Kutta-like Method for Solving First Order IVPs
Indian Journal of Science and Technology, Vol 9(48), DOI: 0.7485/ijst/06/v9i48/0938, December 06 ISSN (Print) : 0974-6846 ISSN (Online) : 0974-5645 Improved Extended Runge-Kutta-like Method for Solving
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 informationA New Block Method and Their Application to Numerical Solution of Ordinary Differential Equations
A New Block Method and Their Application to Numerical Solution of Ordinary Differential Equations Rei-Wei Song and Ming-Gong Lee* d09440@chu.edu.tw, mglee@chu.edu.tw * Department of Applied Mathematics/
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 informationCOSC 3361 Numerical Analysis I Ordinary Differential Equations (II) - Multistep methods
COSC 336 Numerical Analysis I Ordinary Differential Equations (II) - Multistep methods Fall 2005 Repetition from the last lecture (I) Initial value problems: dy = f ( t, y) dt y ( a) = y 0 a t b Goal:
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 information+ h4. + h5. 6! f (5) i. (C.3) Since., it yields
Appendix C. Derivation of the Numerical Integration Formulae C.1. Derivation of the Numerical Integration of dy(x) / dx = f (x) For a given analytical or taulated function f (x), the left column in Tale
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 informationLecture Notes on Numerical Differential Equations: IVP
Lecture Notes on Numerical Differential Equations: IVP Professor Biswa Nath Datta Department of Mathematical Sciences Northern Illinois University DeKalb, IL. 60115 USA E mail: dattab@math.niu.edu URL:
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 informationInitial-Value Problems for ODEs. Introduction to Linear Multistep Methods
Initial-Value Problems for ODEs Introduction to Linear Multistep Methods Numerical Analysis (9th Edition) R L Burden & J D Faires Beamer Presentation Slides prepared by John Carroll Dublin City University
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 informationCHAPTER 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 informationOrdinary Differential Equations (ODEs)
Ordinary Differential Equations (ODEs) NRiC Chapter 16. ODEs involve derivatives wrt one independent variable, e.g. time t. ODEs can always be reduced to a set of firstorder equations (involving only first
More informationScientific 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 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 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 informationOrdinary Differential Equations. Monday, October 10, 11
Ordinary Differential Equations Monday, October 10, 11 Problems involving ODEs can always be reduced to a set of first order differential equations. For example, By introducing a new variable z, this can
More informationNUMERICAL 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 informationInitial 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 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 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 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 information4.4 Computing π, ln 2 and e
252 4.4 Computing π, ln 2 and e The approximations π 3.1415927, ln 2 0.69314718, e 2.7182818 can be obtained by numerical methods applied to the following initial value problems: (1) y = 4, 1 + x2 y(0)
More informationmultistep 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 informationNotes for Numerical Analysis Math 5466 by S. Adjerid Virginia Polytechnic Institute and State University (A Rough Draft) Contents Numerical Methods for ODEs 5. Introduction............................
More informationSolving Ordinary Differential equations
Solving Ordinary Differential equations Taylor methods can be used to build explicit methods with higher order of convergence than Euler s method. The main difficult of these methods is the computation
More informationYou 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 informationNumerical 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 informationPowerPoints organized by Dr. Michael R. Gustafson II, Duke University
Part 6 Chapter 20 Initial-Value Problems PowerPoints organized by Dr. Michael R. Gustafson II, Duke University All images copyright The McGraw-Hill Companies, Inc. Permission required for reproduction
More informationComputational Methods CMSC/AMSC/MAPL 460. Ordinary differential equations
Computational Methods CMSC/AMSC/MAPL 460 Ordinar differential equations Ramani Duraiswami, Dept. of Computer Science Several slides adapted from Prof. ERIC SANDT, TAMU ODE: Previous class Standard form
More informationMultistep 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 informationPart IB Numerical Analysis
Part IB Numerical Analysis Definitions Based on lectures by G. Moore Notes taken by Dexter Chua Lent 206 These notes are not endorsed by the lecturers, and I have modified them (often significantly) after
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 informationBindel, Fall 2011 Intro to Scientific Computing (CS 3220) Week 12: Monday, Apr 18. HW 7 is posted, and will be due in class on 4/25.
Logistics Week 12: Monday, Apr 18 HW 6 is due at 11:59 tonight. HW 7 is posted, and will be due in class on 4/25. The prelim is graded. An analysis and rubric are on CMS. Problem du jour For implicit methods
More informationSolving Delay Differential Equations (DDEs) using Nakashima s 2 Stages 4 th Order Pseudo-Runge-Kutta Method
World Applied Sciences Journal (Special Issue of Applied Math): 8-86, 3 ISSN 88-495; IDOSI Publications, 3 DOI:.589/idosi.wasj.3..am.43 Solving Delay Differential Equations (DDEs) using Naashima s Stages
More informationA Numerical Method for Solving ODE by Rational Approximation
Applied Mathematical Sciences, Vol. 7, 213, no. 23, 1119-113 HIKARI Ltd, www.m-hikari.com A Numerical Method for Solving ODE by Rational Approximation M. Gadella Departamento de FTAO, University of Valladolid,
More informationEXAMPLE OF ONE-STEP METHOD
EXAMPLE OF ONE-STEP METHOD Consider solving y = y cos x, y(0) = 1 Imagine writing a Taylor series for the solution Y (x), say initially about x = 0. Then Y (h) = Y (0) + hy (0) + h2 2 Y (0) + h3 6 Y (0)
More information9.6 Predictor-Corrector Methods
SEC. 9.6 PREDICTOR-CORRECTOR METHODS 505 Adams-Bashforth-Moulton Method 9.6 Predictor-Corrector Methods The methods of Euler, Heun, Taylor, and Runge-Kutta are called single-step methods because they use
More informationNumerical Solution of Differential Equations
1 Numerical Solution of Differential Equations A differential equation (or "DE") contains derivatives or differentials. In a differential equation the unknown is a function, and the differential equation
More informationJim 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 informationExponentially Fitted Error Correction Methods for Solving Initial Value Problems
KYUNGPOOK Math. J. 52(2012), 167-177 http://dx.doi.org/10.5666/kmj.2012.52.2.167 Exponentially Fitted Error Correction Methods for Solving Initial Value Problems Sangdong Kim and Philsu Kim Department
More informationExtended Runge Kutta-like formulae
Applied Numerical Mathematics 56 006 584 605 www.elsevier.com/locate/apnum Extended Runge Kutta-like formulae Xinyuan Wu a Jianlin Xia b a State Key Laboratory for Novel Software Technology Department
More informationNumerical Methods for Initial Value Problems; Harmonic Oscillators
1 Numerical Methods for Initial Value Problems; Harmonic Oscillators Lab Objective: Implement several basic numerical methods for initial value problems (IVPs), and use them to study harmonic oscillators.
More informationSection 7.4 Runge-Kutta Methods
Section 7.4 Runge-Kutta Methods Key terms: Taylor methods Taylor series Runge-Kutta; methods linear combinations of function values at intermediate points Alternatives to second order Taylor methods Fourth
More 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 informationModule 6: Implicit Runge-Kutta Methods Lecture 17: Derivation of Implicit Runge-Kutta Methods(Contd.) The Lecture Contains:
The Lecture Contains: We continue with the details about the derivation of the two stage implicit Runge- Kutta methods. A brief description of semi-explicit Runge-Kutta methods is also given. Finally,
More informationA Study on Linear and Nonlinear Stiff Problems. Using Single-Term Haar Wavelet Series Technique
Int. Journal of Math. Analysis, Vol. 7, 3, no. 53, 65-636 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/.988/ijma.3.3894 A Study on Linear and Nonlinear Stiff Problems Using Single-Term Haar Wavelet Series
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 informationThe 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 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 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 informationLecture 10: Linear Multistep Methods (LMMs)
Lecture 10: Linear Multistep Methods (LMMs) 2nd-order Adams-Bashforth Method The approximation for the 2nd-order Adams-Bashforth method is given by equation (10.10) in the lecture note for week 10, as
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 informationIntegrating ODE's in the Complex Plane-Pole Vaulting
MATHEMATICS OF COMPUTATION, VOLUME 35, NUMBER 152 OCTOBER 1980, PAGES 1181-1189 Integrating ODE's in the Complex Plane-Pole Vaulting By George F. Corliss Abstract. Most existing algorithms for solving
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 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 informationNumerical solution of stiff ODEs using second derivative general linear methods
Numerical solution of stiff ODEs using second derivative general linear methods A. Abdi and G. Hojjati University of Tabriz, Tabriz, Iran SciCADE 2011, Toronto 0 5 10 15 20 25 30 35 40 1 Contents 1 Introduction
More informationExponentially Fitted Symplectic Runge-Kutta-Nyström methods
Appl. Math. Inf. Sci. 7, No. 1, 81-85 (2013) 81 Applied Mathematics & Information Sciences An International Journal Exponentially Fitted Symplectic Runge-Kutta-Nyström methods Th. Monovasilis 1, Z. Kalogiratou
More information16.7 Multistep, Multivalue, and Predictor-Corrector Methods
16.7 Multistep, Multivalue, and Predictor-Corrector Methods 747 } free_vector(ysav,1,nv); free_vector(yerr,1,nv); free_vector(x,1,kmaxx); free_vector(err,1,kmaxx); free_matrix(dfdy,1,nv,1,nv); free_vector(dfdx,1,nv);
More informationModule 4: Numerical Methods for ODE. Michael Bader. Winter 2007/2008
Outlines Module 4: for ODE Part I: Basic Part II: Advanced Lehrstuhl Informatik V Winter 2007/2008 Part I: Basic 1 Direction Fields 2 Euler s Method Outlines Part I: Basic Part II: Advanced 3 Discretized
More informationHigher Order Taylor Methods
Higher Order Taylor Methods Marcelo Julio Alvisio & Lisa Marie Danz May 6, 2007 Introduction Differential equations are one of the building blocks in science or engineering. Scientists aim to obtain numerical
More informationA Note on Trapezoidal Methods for the Solution of Initial Value Problems. By A. R. Gourlay*
MATHEMATICS OF COMPUTATION, VOLUME 24, NUMBER 111, JULY, 1970 A Note on Trapezoidal Methods for the Solution of Initial Value Problems By A. R. Gourlay* Abstract. The trapezoidal rule for the numerical
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 informationComputational Techniques Prof. Dr. Niket Kaisare Department of Chemical Engineering Indian Institute of Technology, Madras
Computational Techniques Prof. Dr. Niket Kaisare Department of Chemical Engineering Indian Institute of Technology, Madras Module No. # 07 Lecture No. # 04 Ordinary Differential Equations (Initial Value
More informationComputational Methods CMSC/AMSC/MAPL 460. Ordinary differential equations
/0/0 Computational Methods CMSC/AMSC/MAPL 460 Ordinar differential equations Ramani Duraiswami Dept. of Computer Science Several slides adapted from Profs. Dianne O Lear and Eric Sandt TAMU Higher Order
More informationSYMMETRY REDUCTION AND NUMERICAL SOLUTION OF A THIRD-ORDER ODE FROM THIN FILM FLOW
Mathematical and Computational Applications,Vol. 15, No. 4, pp. 709-719, 2010. c Association for Scientific Research SYMMETRY REDUCTION AND NUMERICAL SOLUTION OF A THIRD-ORDER ODE FROM THIN FILM FLOW E.
More informationBackward 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 informationFour Point Gauss Quadrature Runge Kuta Method Of Order 8 For Ordinary Differential Equations
International journal of scientific and technical research in engineering (IJSTRE) www.ijstre.com Volume Issue ǁ July 206. Four Point Gauss Quadrature Runge Kuta Method Of Order 8 For Ordinary Differential
More informationCS520: 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 informationPowerPoints organized by Dr. Michael R. Gustafson II, Duke University
Part 6 Chapter 20 Initial-Value Problems PowerPoints organized by Dr. Michael R. Gustafson II, Duke University All images copyright The McGraw-Hill Companies, Inc. Permission required for reproduction
More information5.6 Multistep Methods
5.6 Multistep Methods 1 Motivation: Consider IVP: yy = ff(tt, yy), aa tt bb, yy(aa) = αα. To compute solution at tt ii+1, approximate solutions at mesh points tt 0, tt 1, tt 2, tt ii are already obtained.
More informationNumerical Methods for Initial Value Problems; Harmonic Oscillators
Lab 1 Numerical Methods for Initial Value Problems; Harmonic Oscillators Lab Objective: Implement several basic numerical methods for initial value problems (IVPs), and use them to study harmonic oscillators.
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 information369 Nigerian Research Journal of Engineering and Environmental Sciences 2(2) 2017 pp
369 Nigerian Research Journal of Engineering and Environmental Sciences 2(2) 27 pp. 369-374 Original Research Article THIRD DERIVATIVE MULTISTEP METHODS WITH OPTIMIZED REGIONS OF ABSOLUTE STABILITY FOR
More informationA three point formula for finding roots of equations by the method of least squares
Journal of Applied Mathematics and Bioinformatics, vol.2, no. 3, 2012, 213-233 ISSN: 1792-6602(print), 1792-6939(online) Scienpress Ltd, 2012 A three point formula for finding roots of equations by the
More information