Energy-Preserving Runge-Kutta methods
|
|
- June O’Connor’
- 5 years ago
- Views:
Transcription
1 Energy-Preserving Runge-Kutta methods Fasma Diele, Brigida Pace Istituto per le Applicazioni del Calcolo M. Picone, CNR, Via Amendola 122, Bari, Italy SDS2010, Monopoli, June 8 11, 2010 Fasma Diele, Brigida Pace (IAC-CNR) Energy-Preserving RK methods 11/06/ / 28
2 OUTLINE Definition of the problem and motivations s-stage trapezoidal methods Conservation of Hamiltonian function of polynomial type High order conservative methods Energy-Preserving Near-DIRK methods Numerical tests Conclusions Fasma Diele, Brigida Pace (IAC-CNR) Energy-Preserving RK methods 11/06/ / 28
3 DEFINITION OF THE PROBLEM We consider the numerical integration of Hamiltonian systems ( ) 0 I ẏ = J H(y), J =, I 0 where the Hamiltonian function H(y) is a polynomial. AIM: Define RK methods that exactly conserve the above Hamiltonian function: H(y n+1 ) = H(y n ) for all n and h > 0 Fasma Diele, Brigida Pace (IAC-CNR) Energy-Preserving RK methods 11/06/ / 28
4 MOTIVATIONS (1/2) Many interesting Hamiltonian systems arising from different fields of study are defined by polynomial Hamiltonian functions. Furthermore any nonlinear Hamiltonian function may be in general well approximated by a polynomial. It is well known that symplectic RK methods only conserve quadratic Hamiltonian functions: H(y) = 1 2 y T Cy but, in general, fail to yield conservation for higher degree. So do symmetric methods. Fasma Diele, Brigida Pace (IAC-CNR) Energy-Preserving RK methods 11/06/ / 28
5 MOTIVATIONS (2/2) A few years ago, the unfruitful attempts to devise energy-preserving RK methods culminated in the general feeling that they could not exist even in the simpler case of polynomial Hamiltonians (A. Iserles and A. Zanna, Preserving algebraic invariants with Runge-Kutta methods, J. Comput. Appl. Math., 125, 2000, 69 81). Fasma Diele, Brigida Pace (IAC-CNR) Energy-Preserving RK methods 11/06/ / 28
6 EXAMPLES Energy function evaluated over the numerical solution obtained by solving the quartic pendulum equation H(p, q) = 1 2 p q q4. by the Lobatto IIIA method of order four (left picture) and Gauss method of order six (right picture). Fasma Diele, Brigida Pace (IAC-CNR) Energy-Preserving RK methods 11/06/ / 28
7 APPROACH (1/2) Classically, a numerical method in a given class (RK, multistep methods, etc.) is defined by selecting the coefficients in such a way that the order is maximized and a given number of extra conditions are satisfied. Depending on the kind of continuous problem that is to be solved, such extra conditions confer the method specific features, for example: a good conditioning, good linear stability properties, more efficiency in solving the nonlinear systems involved, etc. Fasma Diele, Brigida Pace (IAC-CNR) Energy-Preserving RK methods 11/06/ / 28
8 APPROACH (2/2) Accordingly, we wonder whether some parameters defining the method may be selected not to improve the order but to guarantee the conservation of the Hamiltonian function for the discrete solution y n. More specifically, we refer to the class of RK methods. QUESTION: Can we modify a given Runge Kutta formula by adding a number of internal stages in such a way that the resulting formula applied to our problem be conservative? Fasma Diele, Brigida Pace (IAC-CNR) Energy-Preserving RK methods 11/06/ / 28
9 SKETCH OF THE IDEA: quadratic Hamiltonian (1/2) We consider one of the simplest RK methods: the trapezoidal method: y n+1 y n = 1 2 J ( H(y n) + H(y n+1 )) Multiplication of both sides by ( H(y n ) + H(y n+1 )) T yields ( H(y n ) + H(y n+1 )) T (y n+1 y n ) = 0 For quadratic Hamiltonian function this is equivalent to the conservation law: H(y n+1 ) = H(y n ), for all times t n Fasma Diele, Brigida Pace (IAC-CNR) Energy-Preserving RK methods 11/06/ / 28
10 SKETCH OF THE IDEA: quadratic Hamiltonian (2/2) In fact we consider the segment σ n joining y n to y n+1 σ n (c) = (1 c)y n + cy n+1, with c [0, 1]. and the line integral H(y n+1 ) H(y n ) = H(y)dy = y n y n σ n(c) T H(σ n (c)) dc 1 =(y n+1 y n ) T H(σ n (c)) dc 0 = 1 2 (y n+1 y n ) T ( H(y n ) + H(y n+1 )) =0 H(y) being linear. Fasma Diele, Brigida Pace (IAC-CNR) Energy-Preserving RK methods 11/06/ / 28
11 s-stage TRAPEZOIDAL METHODS The s-stage trapezoidal method is defined as y n+1 = y n + h s b i f (K i ). i=1 where K 0 = y n, K s = y n+1 and, for i = 2,..., s 1, K i are internal stages that are located over the segment σ n (c) = (1 c)y n + cy n+1. In the simplest case they are equally distributed: K i = σ n (c i ), i = 1,..., s, with c i = (i 1)h/(s 1). Fasma Diele, Brigida Pace (IAC-CNR) Energy-Preserving RK methods 11/06/ / 28
12 SOME EXAMPLES When s = 2 we obtain the trapezoidal method; for s = 3 and s = 5 we obtain respectively the methods: y n+1 = y n + h ( 6 f (y n ) + 4f ( y n + y n+1 ) + f (y n+1 ) 2 ) and y n+1 = y n + h 90 ( 7f (y n ) + 32f ( 3y n + y n f ( y n + 3y n+1 ) + 7f (y n+1 ) 4 ) + 12f ( y n + y n+1 ) ) 2 When applied to y = f (t), these become the Newton-Cotes quadrature formulae of order 4 and 6 respectively. On the other hand, when applied to general ODE problems their order reduces to two. Fasma Diele, Brigida Pace (IAC-CNR) Energy-Preserving RK methods 11/06/ / 28
13 BUTCHER ARRAY FORMULATION Written as a Runge-Kutta method, an s-stage trapezoidal method is defined by the following Butcher array: c 1 c 1 b 1 c 1 b c 1 b s c 2. c 2 b 1. c 2 b c 2 b s. c s 1 c s 1 b 1 c s 1 b c s 1 b s c s b 1 b b s b 1 b b s It is easily seen that each method under consideration is symmetric. Fasma Diele, Brigida Pace (IAC-CNR) Energy-Preserving RK methods 11/06/ / 28
14 CONSERVATION OF ENERGY (1/2) As done for the trapezoidal method, starting from y n+1 = y n + hj s b i H(K i ), i=1 we obtain ( s b i H(K i ) T ) (y n+1 y n ) = 0. i=1 that will represent our conservation law. In fact assume that H(y) is a polynomial... Fasma Diele, Brigida Pace (IAC-CNR) Energy-Preserving RK methods 11/06/ / 28
15 CONSERVATION OF ENERGY (2/2) 1 H(y n+1 ) H(y n ) =(y n+1 y n ) T H(σ n (c)) dc Suppose the number of the internal stages K i be enough to guarantee that the underlying quadrature formula is exact when applied to the polynomial H(σ n (c)). Then ) H(y n+1 ) H(y n ) =(y n+1 y n ) T ( s i=1 =0 0 b i H(K i ) Fasma Diele, Brigida Pace (IAC-CNR) Energy-Preserving RK methods 11/06/ / 28
16 NUMERICAL TEST: Polynomial pendulum (1/2) We consider the pendulum equation defined by H(p, q) = 1/2p cos q and retain a finite number of terms in the Taylor expansion of the cosine. In particular we consider: - H(p, q) = 1 2 p q q4, (quartic pendulum oscillator); - H(p, q) = 1 2 p q q q6, (pendulum oscillator of degree six); - H(p, q) = 1 2 p q q q q8, (pendulum oscillator of degree eight). Fasma Diele, Brigida Pace (IAC-CNR) Energy-Preserving RK methods 11/06/ / 28
17 NUMERICAL TEST: Polynomial pendulum (2/2) 3-stage (first row), 5-stage (second row) and 7-stage (third row) trapezoidal methods applied to the three pendulum problems. Fasma Diele, Brigida Pace (IAC-CNR) Energy-Preserving RK methods 11/06/ / 28
18 HIGH ORDER CONSERVATIVE METHODS (1/2) We introduce some example of methods of order four and six that exactly preserve the Hamiltonian function of separable Hamiltonian system, in the case where such function is a polynomial of degree at most three. These methods are symmetric and are defined as where... y n+1 = y n + h s b i f (K i ). i=1 Fasma Diele, Brigida Pace (IAC-CNR) Energy-Preserving RK methods 11/06/ / 28
19 HIGH ORDER CONSERVATIVE METHODS (2/2) K 0 = y n, K s = y n+1 and, for i = 2,..., s 1, K i are internal stages that are located over quadratic curve of the phase space: σ n (c) = y n +2(K 2 y n )c +2(y n+1 2K 2 +y n )(c 1 2 )c, to get methods of order four, cubic curve of the phase space: σ n (c) = y n + 3(K 2 y n )c (K 3 2K 2 + y n )(c 1 3 )c (y n+1 3K 3 + 3K 2 y n )(c 1 3 )(c 2 3 )c, to get methods of order six. Fasma Diele, Brigida Pace (IAC-CNR) Energy-Preserving RK methods 11/06/ / 28
20 NUMERICAL TEST Methods of order four (first row) and of order six (second row), applied to cubic Hamiltonian (first column) and to quartic Hamiltonian (second column). Stepsize h = 1; number of points n = Fasma Diele, Brigida Pace (IAC-CNR) Energy-Preserving RK methods 11/06/ / 28
21 NOTES (1/2) The class of s-stage Trapezoidal Methods represents the first instance (and the first existence proof) of RK methods capable of providing a precise conservation of the energy, in the case where the Hamiltonian function is of polynomial type. See for example: F. Iavernaro, B. Pace. s-stage Trapezoidal Methods for the Conservation of Hamiltonian Functions of Polynomial Type. AIP Conf. Proc. 936, pp , F. Iavernaro, B. Pace. Conservative Block-Boundary Value Methods for the Solution of Polynomial Hamiltonian Systems. AIP Conf. Proc. 1048, pp , B. Pace. Symmetric schemes for the solution of Hamiltonian problems, PhD thesis, University of Bari (Italy), F. Iavernaro, D. Trigiante. High-order symmetric schemes for the energy conservation of polynomial Hamiltonian problems. JNAIAM, vol. 4, n. 1 2, pp , Fasma Diele, Brigida Pace (IAC-CNR) Energy-Preserving RK methods 11/06/ / 28
22 NOTES (2/2) An alternative approach based on B-series and average vector fields methods has been recently provided in E. Celledoni, Robert I. McLachlan, D.I. McLaren, B. Owren, G. Reinout, W. Quispel and W.M. Wright. Energy-preserving Runge-Kutta Methods, ESAIM: M2AN 43 (2009) A modification of collocation methods extending the averaged vector field method of high order has been developed by E. Hairer in Energy-preserving variant of collocation methods, to appear in JNAIAM, These methods are connected to the methods studied by Iavernaro and Trigiante (JNAIAM 2009) when particular quadrature formulas are chosen. Fasma Diele, Brigida Pace (IAC-CNR) Energy-Preserving RK methods 11/06/ / 28
23 ENERGY-PRESERVING NEAR-DIRK METHODS: first results No explicit RK method can be energy-preserving for polynomial Hamiltonians of degree higher than two and all the energy-preserving RK methods provided in literature are fully implicit. QUESTION: Can we define energy-preserving near-diagonally implicit (i.e. with sparse Butcher array) RK symmetric methods that exactly conserve polynomial Hamiltonian function? Fasma Diele, Brigida Pace (IAC-CNR) Energy-Preserving RK methods 11/06/ / 28
24 METHOD OF ORDER /3 1/12 1/ /3 1/8 3/8 1/8 3/24 1 1/8 3/8 3/8 1/8 1/8 3/8 3/8 1/8 Near-DIRK second order method applied to the cubic Hamiltonian (first row) and to quartic Hamiltonian (second row). Stepsize h = 1; number of points n = Fasma Diele, Brigida Pace (IAC-CNR) Energy-Preserving RK methods 11/06/ / 28
25 METHOD OF ORDER /4 1/24 1/6 1/ /2 1/12 1/3 1/ /4 1/12 1/3 1/8 1/6 1/24 1 1/12 1/3 1/6 1/3 1/12 1/12 1/3 1/6 1/3 1/12 Near-DIRK second order method applied to the cubic Hamiltonian (first row), to quartic Hamiltonian (second row) and to Hamiltonian of degree five (third row). Stepsize h = 1; number of points n = Fasma Diele, Brigida Pace (IAC-CNR) Energy-Preserving RK methods 11/06/ / 28
26 SKETCH OF THE IDEA We consider γ n joining y n to y n+1 γ n (c) = σn(c) 1 = (1 2c)y n + 2cy n+ 1, with c [0, ] σ 2 n(c) = (1 2c)y n+ 1 2 and the line integral H(y n+1 ) H(y n ) = H(y)dy = = 1/2 0 =... = 0 y n y n+1 σ 1 n (c) T H(σ 1 n(c)) dc + + 2cy n+1, with c [ 1 2, 1] /2 γ n(c) T H(σ n (c)) dc σ 2 n (c) T H(σ 2 n(c)) dc Fasma Diele, Brigida Pace (IAC-CNR) Energy-Preserving RK methods 11/06/ / 28
27 METHOD OF ORDER 4 Near-DIRK fourth order methods applied to the cubic Hamiltonian (first column) and to quartic Hamiltonian (second column). Stepsize h = 1; number of points n = Fasma Diele, Brigida Pace (IAC-CNR) Energy-Preserving RK methods 11/06/ / 28
28 CONCLUSIONS The class of s-stage Trapezoidal Methods represents the first instance of RK methods capable of providing a precise conservation of the energy, in the case where the Hamiltonian function is of polynomial type.these are methods of order two that generalize the classical trapezoidal method. After that, the underlying idea, has permitted the construction of energy-preserving RK methods of orders 4 and 6 and has leaded to the discovery of arbitrary high order implicit energy preserving RK methods. The research of energy-preserving near-diagonally implicit RK formulae has being the subject of the current research. Fasma Diele, Brigida Pace (IAC-CNR) Energy-Preserving RK methods 11/06/ / 28
High-order symmetric schemes for the energy conservation of polynomial Hamiltonian problems.
High-order symmetric schemes for the energy conservation of polynomial Hamiltonian problems. Felice Iavernaro and Donato Trigiante Abstract We define a class of arbitrary high order symmetric one-step
More informationHigh-order Symmetric Schemes for the Energy Conservation of Polynomial Hamiltonian Problems 1 2
European Society of Computational Methods in Sciences and Engineering (ESCMSE) Journal of Numerical Analysis, Industrial and Applied Mathematics (JNAIAM) vol 4, no -2, 29, pp 87- ISSN 79 84 High-order
More informationENERGY PRESERVING METHODS FOR VOLTERRA LATTICE EQUATION
TWMS J. App. Eng. Math. V., N.,, pp. 9- ENERGY PRESERVING METHODS FOR VOLTERRA LATTICE EQUATION B. KARASÖZEN, Ö. ERDEM, Abstract. We investigate linear energy preserving methods for the Volterra lattice
More informationSYMMETRIC PROJECTION METHODS FOR DIFFERENTIAL EQUATIONS ON MANIFOLDS
BIT 0006-3835/00/4004-0726 $15.00 2000, Vol. 40, No. 4, pp. 726 734 c Swets & Zeitlinger SYMMETRIC PROJECTION METHODS FOR DIFFERENTIAL EQUATIONS ON MANIFOLDS E. HAIRER Section de mathématiques, Université
More informationMultiple invariants conserving Runge-Kutta type methods for Hamiltonian problems
Multiple invariants conserving Runge-Kutta type methods for Hamiltonian problems arxiv:132.1678v2 [math.na] 6 Sep 213 Luigi Brugnano Yajuan Sun Warmly dedicated to celebrate the 8-th birthday of John Butcher
More informationMultistage Methods I: Runge-Kutta Methods
Multistage Methods I: Runge-Kutta Methods Varun Shankar January, 0 Introduction Previously, we saw that explicit multistep methods (AB methods) have shrinking stability regions as their orders are increased.
More information1. Introduction. We consider canonical Hamiltonian systems in the form 0 I y(t 0 ) = y 0 R 2m J = I 0
ENERGY AND QUADRATIC INVARIANTS PRESERVING INTEGRATORS BASED UPON GAUSS COLLOCATION FORMULAE LUIGI BRUGNANO, FELICE IAVERNARO, AND DONATO TRIGIANTE Abstract. We introduce a new family of symplectic integrators
More informationRunge-Kutta Theory and Constraint Programming Julien Alexandre dit Sandretto Alexandre Chapoutot. Department U2IS ENSTA ParisTech SCAN Uppsala
Runge-Kutta Theory and Constraint Programming Julien Alexandre dit Sandretto Alexandre Chapoutot Department U2IS ENSTA ParisTech SCAN 2016 - Uppsala Contents Numerical integration Runge-Kutta with interval
More informationENERGY PRESERVATION (DISSIPATION) IN NUMERICAL ODEs and PDEs
ENERGY PRESERVATION (DISSIPATION) IN NUMERICAL ODEs and PDEs E. CELLEDONI Department of Mathematical Sciences, NTNU 749 Trondheim, Norway. email: elenac@math.ntnu.no Abstract This note considers energy-preservation
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 informationValidated Explicit and Implicit Runge-Kutta Methods
Validated Explicit and Implicit Runge-Kutta Methods Alexandre Chapoutot joint work with Julien Alexandre dit Sandretto and Olivier Mullier U2IS, ENSTA ParisTech 8th Small Workshop on Interval Methods,
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 informationImproved Starting Methods for Two-Step Runge Kutta Methods of Stage-Order p 3
Improved Starting Methods for Two-Step Runge Kutta Methods of Stage-Order p 3 J.H. Verner August 3, 2004 Abstract. In [5], Jackiewicz and Verner derived formulas for, and tested the implementation of two-step
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 informationSymplectic integration with Runge-Kutta methods, AARMS summer school 2015
Symplectic integration with Runge-Kutta methods, AARMS summer school 2015 Elena Celledoni July 13, 2015 1 Hamiltonian systems and their properties We consider a Hamiltonian system in the form ẏ = J H(y)
More informationEfficiency of Runge-Kutta Methods in Solving Simple Harmonic Oscillators
MATEMATIKA, 8, Volume 3, Number, c Penerbit UTM Press. All rights reserved Efficiency of Runge-Kutta Methods in Solving Simple Harmonic Oscillators Annie Gorgey and Nor Azian Aini Mat Department of Mathematics,
More informationGeometric Numerical Integration
Geometric Numerical Integration (Ernst Hairer, TU München, winter 2009/10) Development of numerical ordinary differential equations Nonstiff differential equations (since about 1850), see [4, 2, 1] Adams
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 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 informationReview. Numerical Methods Lecture 22. Prof. Jinbo Bi CSE, UConn
Review Taylor Series and Error Analysis Roots of Equations Linear Algebraic Equations Optimization Numerical Differentiation and Integration Ordinary Differential Equations Partial Differential Equations
More informationImplicit-explicit exponential integrators
Implicit-explicit exponential integrators Bawfeh Kingsley Kometa joint work with Elena Celledoni MaGIC 2011 Finse, March 1-4 1 Introduction Motivation 2 semi-lagrangian Runge-Kutta exponential integrators
More informationInverse Eigenvalue Problems: Theory and Applications
Inverse Eigenvalue Problems: Theory and Applications A Series of Lectures to be Presented at IRMA, CNR, Bari, Italy Moody T. Chu (Joint with Gene Golub) Department of Mathematics North Carolina State University
More informationCHAPTER 10: Numerical Methods for DAEs
CHAPTER 10: Numerical Methods for DAEs Numerical approaches for the solution of DAEs divide roughly into two classes: 1. direct discretization 2. reformulation (index reduction) plus discretization Direct
More informationNumerical Methods for ODEs. Lectures for PSU Summer Programs Xiantao Li
Numerical Methods for ODEs Lectures for PSU Summer Programs Xiantao Li Outline Introduction Some Challenges Numerical methods for ODEs Stiff ODEs Accuracy Constrained dynamics Stability Coarse-graining
More informationMATHEMATICAL METHODS INTERPOLATION
MATHEMATICAL METHODS INTERPOLATION I YEAR BTech By Mr Y Prabhaker Reddy Asst Professor of Mathematics Guru Nanak Engineering College Ibrahimpatnam, Hyderabad SYLLABUS OF MATHEMATICAL METHODS (as per JNTU
More informationAbout the numerical conservation of first integral by a class of symmetric methods
ÁÈ ÊÌÁÅ ÆÌÇ Á Å Ì Å ÌÁ Ö Ò Ó Ö Ó ÈÇÄÁÌ ÆÁ Ç Á ÅÁÄ ÆÇ ÓÙØ Ø ÒÙÑ Ö Ð ÓÒ ÖÚ Ø ÓÒ Ó Ö Ø ÒØ Ö Ð Ý Ð Ó ÝÑÑ ØÖ Ñ Ø Ó Ê «ÐÐ È Ú Ò ÓÐÐ Þ ÓÒ ÉÙ ÖÒ Ô ÖØ Ñ ÒØÓ ÒÙÑ ÖÓ É ÁÒ Ö ØÓ Ò Ð Ö Ú Ø Ð Ô ÖØ Ñ ÒØÓ Ò Ø ¹½½¹¾¼½¼
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 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 informationReducing round-off errors in symmetric multistep methods
Reducing round-off errors in symmetric multistep methods Paola Console a, Ernst Hairer a a Section de Mathématiques, Université de Genève, 2-4 rue du Lièvre, CH-1211 Genève 4, Switzerland. (Paola.Console@unige.ch,
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 informationApplied Numerical Analysis
Applied Numerical Analysis Using MATLAB Second Edition Laurene V. Fausett Texas A&M University-Commerce PEARSON Prentice Hall Upper Saddle River, NJ 07458 Contents Preface xi 1 Foundations 1 1.1 Introductory
More informationA family of A-stable Runge Kutta collocation methods of higher order for initial-value problems
IMA Journal of Numerical Analysis Advance Access published January 3, 2007 IMA Journal of Numerical Analysis Pageof20 doi:0.093/imanum/drl00 A family of A-stable Runge Kutta collocation methods of higher
More informationTwo Optimized Runge-Kutta Methods for the Solution of the Schrödinger Equation
MATCH Communications in Mathematical and in Computer Chemistry MATCH Commun. Math. Comput. Chem. (8) 7-77 ISSN - Two Optimized Runge-Kutta Methods for the Solution of the Schrödinger Equation T.V. Triantafyllidis,
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 ANALYSIS 2 - FINAL EXAM Summer Term 2006 Matrikelnummer:
Prof. Dr. O. Junge, T. März Scientific Computing - M3 Center for Mathematical Sciences Munich University of Technology Name: NUMERICAL ANALYSIS 2 - FINAL EXAM Summer Term 2006 Matrikelnummer: I agree to
More informationApplication of Geometric Integration to some Mechanical Problems
Application of Geometric Integration to some Mechanical Problems Kenth Engø y and Arne Marthinsen z Department of Informatics, University of Bergen, N-5 Bergen, Norway Department of Mathematical Sciences,
More informationStarting Methods for Two-Step Runge Kutta Methods of Stage-Order 3 and Order 6
Cambridge International Science Publishing Cambridge CB1 6AZ Great Britain Journal of Computational Methods in Sciences and Engineering vol. 2, no. 3, 2, pp. 1 3 ISSN 1472 7978 Starting Methods for Two-Step
More informationThe collocation method for ODEs: an introduction
058065 - Collocation Methods for Volterra Integral Related Functional Differential The collocation method for ODEs: an introduction A collocation solution u h to a functional equation for example an ordinary
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 information8.3 Numerical Quadrature, Continued
8.3 Numerical Quadrature, Continued Ulrich Hoensch Friday, October 31, 008 Newton-Cotes Quadrature General Idea: to approximate the integral I (f ) of a function f : [a, b] R, use equally spaced nodes
More informationENERGY PRESERVING INTEGRATION OF BI-HAMILTONIAN PARTIAL DIFFERENTIAL EQUATIONS
TWMS J. App. Eng. Math. V., N.,, pp. 75-86 ENERGY PRESERVING INTEGRATION OF BI-HAMILTONIAN PARTIAL DIFFERENTIAL EQUATIONS B. KARASÖZEN, G. ŞİMŞEK Abstract. The energy preserving average vector field (AVF
More informationCopyright is owned by the Author of the thesis. Permission is given for a copy to be downloaded by an individual for the purpose of research and
Copyright is owned by the Author of the thesis. Permission is given for a copy to be downloaded by an individual for the purpose of research and private study only. The thesis may not be reproduced elsewhere
More informationSemi-implicit Krylov Deferred Correction Methods for Ordinary Differential Equations
Semi-implicit Krylov Deferred Correction Methods for Ordinary Differential Equations Sunyoung Bu University of North Carolina Department of Mathematics CB # 325, Chapel Hill USA agatha@email.unc.edu Jingfang
More informationPARTIAL DIFFERENTIAL EQUATIONS
MATHEMATICAL METHODS PARTIAL DIFFERENTIAL EQUATIONS I YEAR B.Tech By Mr. Y. Prabhaker Reddy Asst. Professor of Mathematics Guru Nanak Engineering College Ibrahimpatnam, Hyderabad. SYLLABUS OF MATHEMATICAL
More informationDiscontinuous Collocation Methods for DAEs in Mechanics
Discontinuous Collocation Methods for DAEs in Mechanics Scott Small Laurent O. Jay The University of Iowa Iowa City, Iowa, USA July 11, 2011 Outline 1 Introduction of the DAEs 2 SPARK and EMPRK Methods
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 informationNumerical Methods for Engineers. and Scientists. Applications using MATLAB. An Introduction with. Vish- Subramaniam. Third Edition. Amos Gilat.
Numerical Methods for Engineers An Introduction with and Scientists Applications using MATLAB Third Edition Amos Gilat Vish- Subramaniam Department of Mechanical Engineering The Ohio State University Wiley
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 informationSymplectic Runge-Kutta methods satisfying effective order conditions
/30 Symplectic Runge-Kutta methods satisfying effective order conditions Gulshad Imran John Butcher (supervisor) University of Auckland 5 July, 20 International Conference on Scientific Computation and
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 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 informationA SIXTH ORDER AVERAGED VECTOR FIELD METHOD *
Journal of Computational Mathematics Vol.34, No.5, 6, 479 498. http://www.global-sci.org/jcm doi:.48/jcm.6-m5-65 A SIXTH ORDER AVERAGED VECTOR FIELD METHOD * Haochen Li Jiangsu Key Laboratory for NSLSCS,
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 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 informationParallel Methods for ODEs
Parallel Methods for ODEs Levels of parallelism There are a number of levels of parallelism that are possible within a program to numerically solve ODEs. An obvious place to start is with manual code restructuring
More informationSOLVING ODE s NUMERICALLY WHILE PRESERVING ALL FIRST INTEGRALS
SOLVING ODE s NUMERICALLY WHILE PRESERVING ALL FIRST INTEGRALS G.R.W. QUISPEL 1,2 and H.W. CAPEL 3 Abstract. Using Discrete Gradient Methods (Quispel & Turner, J. Phys. A29 (1996) L341-L349) we construct
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 informationEXTENSIONS OF THE HHT-α METHOD TO DIFFERENTIAL-ALGEBRAIC EQUATIONS IN MECHANICS
EXTENSIONS OF THE HHT-α METHOD TO DIFFERENTIAL-ALGEBRAIC EQUATIONS IN MECHANICS LAURENT O. JAY AND DAN NEGRUT Abstract. We present second-order extensions of the Hilber-Hughes-Taylor-α HHT-α) method for
More informationRunge-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 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 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 informationAM205: Assignment 3 (due 5 PM, October 20)
AM25: Assignment 3 (due 5 PM, October 2) For this assignment, first complete problems 1, 2, 3, and 4, and then complete either problem 5 (on theory) or problem 6 (on an application). If you submit answers
More informationSANGRADO PAGINA 17CMX24CM. PhD Thesis. Splitting methods for autonomous and non-autonomous perturbed equations LOMO A AJUSTAR (AHORA 4CM)
SANGRADO A3 PAGINA 17CMX24CM LOMO A AJUSTAR (AHORA 4CM) We have considered the numerical integration of non-autonomous separable parabolic equations using high order splitting methods with complex coefficients.
More informationQuadratic SDIRK pair for treating chemical reaction problems.
Quadratic SDIRK pair for treating chemical reaction problems. Ch. Tsitouras TEI of Chalkis, Dept. of Applied Sciences, GR 34400 Psahna, Greece. I. Th. Famelis TEI of Athens, Dept. of Mathematics, GR 12210
More informationExam in TMA4215 December 7th 2012
Norwegian University of Science and Technology Department of Mathematical Sciences Page of 9 Contact during the exam: Elena Celledoni, tlf. 7359354, cell phone 48238584 Exam in TMA425 December 7th 22 Allowed
More information(f(x) P 3 (x)) dx. (a) The Lagrange formula for the error is given by
1. QUESTION (a) Given a nth degree Taylor polynomial P n (x) of a function f(x), expanded about x = x 0, write down the Lagrange formula for the truncation error, carefully defining all its elements. How
More informationSolving Orthogonal Matrix Differential Systems in Mathematica
Solving Orthogonal Matrix Differential Systems in Mathematica Mark Sofroniou 1 and Giulia Spaletta 2 1 Wolfram Research, Champaign, Illinois, USA. marks@wolfram.com 2 Mathematics Department, Bologna University,
More informationIntegration. Topic: Trapezoidal Rule. Major: General Engineering. Author: Autar Kaw, Charlie Barker.
Integration Topic: Trapezoidal Rule Major: General Engineering Author: Autar Kaw, Charlie Barker 1 What is Integration Integration: The process of measuring the area under a function plotted on a graph.
More informationUnique expansions with digits in ternary alphabets
Unique expansions with digits in ternary alphabets Anna Chiara Lai Istituto per le Applicazioni del Calcolo Mauro Picone, CNR June 9, 2010 Anna Chiara Lai (IAC) June 9, 2010 1 / 18 Outline Introduction:
More informationMTH 452/552 Homework 3
MTH 452/552 Homework 3 Do either 1 or 2. 1. (40 points) [Use of ode113 and ode45] This problem can be solved by a modifying the m-files odesample.m and odesampletest.m available from the author s webpage.
More 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 informationArbitrary order trigonometric Fourier collocation methods for multi-frequency oscillatory systems
Arbitrary order trigonometric Fourier collocation methods for multi-frequency oscillatory systems Bin Wang a, Arieh Iserles b, and Xinyuan Wu a a Department of Mathematics, Nanjing University, State Key
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 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 informationNumerical Methods for Engineers
Numerical Methods for Engineers SEVENTH EDITION Steven C Chopra Berger Chair in Computing and Engineering Tufts University Raymond P. Canal Professor Emeritus of Civil Engineering of Michiaan University
More informationOn the construction of discrete gradients
On the construction of discrete gradients Elizabeth L. Mansfield School of Mathematics, Statistics and Actuarial Science, University of Kent, Canterbury, CT2 7NF, U.K. G. Reinout W. Quispel Department
More informationSixth-Order and Fourth-Order Hybrid Boundary Value Methods for Systems of Boundary Value Problems
Sith-Order and Fourth-Order Hybrid Boundary Value Methods for Systems of Boundary Value Problems GRACE O. AKILABI Department of Mathematics Covenant University, Canaanland, Ota, Ogun State IGERIA grace.akinlabi@covenantuniversity.edu.ng
More informationPartitioned Runge-Kutta Methods for Semi-explicit Differential-Algebraic Systems of Index 2
Partitioned Runge-Kutta Methods for Semi-explicit Differential-Algebraic Systems of Index 2 A. Murua Konputazio Zientziak eta A. A. Saila, EHU/UPV, Donostia-San Sebastián email ander@si.ehu.es December
More informationAdvanced methods for ODEs and DAEs
Lecture : Implicit Runge Kutta method Bojana Roić, 9. April 7 What you need to know before thi lecture numerical integration: Lecture from ODE iterative olver: Lecture 5-8 from ODE 9. April 7 Bojana Roić
More informationSuboptimal feedback control of PDEs by solving Hamilton-Jacobi Bellman equations on sparse grids
Suboptimal feedback control of PDEs by solving Hamilton-Jacobi Bellman equations on sparse grids Jochen Garcke joint work with Axel Kröner, INRIA Saclay and CMAP, Ecole Polytechnique Ilja Kalmykov, Universität
More informationEnergy-preserving variant of collocation methods 1
European Society of Computational Metods in Sciences and Engineering (ESCMSE) Journal of Numerical Analysis, Industrial and Applied Matematics (JNAIAM) vol.?, no.?, 21, pp. 1-12 ISSN 179 814 Energy-preserving
More informationA SYMBOLIC-NUMERIC APPROACH TO THE SOLUTION OF THE BUTCHER EQUATIONS
CANADIAN APPLIED MATHEMATICS QUARTERLY Volume 17, Number 3, Fall 2009 A SYMBOLIC-NUMERIC APPROACH TO THE SOLUTION OF THE BUTCHER EQUATIONS SERGEY KHASHIN ABSTRACT. A new approach based on the use of new
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 Mathematics
Alfio Quarteroni Riccardo Sacco Fausto Saleri Numerical Mathematics Second Edition With 135 Figures and 45 Tables 421 Springer Contents Part I Getting Started 1 Foundations of Matrix Analysis 3 1.1 Vector
More informationAn Overly Simplified and Brief Review of Differential Equation Solution Methods. 1. Some Common Exact Solution Methods for Differential Equations
An Overly Simplified and Brief Review of Differential Equation Solution Methods We will be dealing with initial or boundary value problems. A typical initial value problem has the form y y 0 y(0) 1 A typical
More informationFourth-order symplectic exponentially-fitted modified Runge-Kutta methods of the Gauss type: a review
Fourth-order symplectic exponentially-fitted modified Runge-Kutta methods of the Gauss type: a review G. Vanden Berghe and M. Van Daele Vakgroep Toegepaste Wiskunde en Informatica, Universiteit Gent, Krijgslaan
More informationENO and WENO schemes. Further topics and time Integration
ENO and WENO schemes. Further topics and time Integration Tefa Kaisara CASA Seminar 29 November, 2006 Outline 1 Short review ENO/WENO 2 Further topics Subcell resolution Other building blocks 3 Time Integration
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 informationEfficient implementation of Radau collocation methods
Efficient implementation of Radau collocation methods Luigi Brugnano Felice Iavernaro Cecilia Magherini arxiv:1302.1037v1 [math.na] 5 Feb 2013 December 29, 2012 Abstract In this paper we define an efficient
More informationVariable Step Runge-Kutta-Nyström Methods for the Numerical Solution of Reversible Systems
Variable Step Runge-Kutta-Nyström Methods for the Numerical Solution of Reversible Systems J. R. Cash and S. Girdlestone Department of Mathematics, Imperial College London South Kensington London SW7 2AZ,
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 informationReview 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 informationNEW NUMERICAL INTEGRATORS BASED ON SOLVABILITY AND SPLITTING Fernando Casas Universitat Jaume I, Castellón, Spain Fernando.Casas@uji.es (on sabbatical leave at DAMTP, University of Cambridge) Edinburgh,
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 informationAccuracy Enhancement Using Spectral Postprocessing for Differential Equations and Integral Equations
COMMUICATIOS I COMPUTATIOAL PHYSICS Vol. 5, o. -4, pp. 779-79 Commun. Comput. Phys. February 009 Accuracy Enhancement Using Spectral Postprocessing for Differential Equations and Integral Equations Tao
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 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 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 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 informationThe Milne error estimator for stiff problems
13 R. Tshelametse / SAJPAM. Volume 4 (2009) 13-28 The Milne error estimator for stiff problems Ronald Tshelametse Department of Mathematics University of Botswana Private Bag 0022 Gaborone, Botswana. E-mail
More information