Exponential Integrators
|
|
- Hubert O’Brien’
- 6 years ago
- Views:
Transcription
1 Exponential Integrators John C. Bowman and Malcolm Roberts (University of Alberta) June 11, bowman/talks 1
2 Outline Exponential Integrators Exponential Euler History Generalizations Stationary Green Function Higher-Order Vector Case Lagrangian Discretizations Charged Particle in Electromagnetic Fields Embedded Exponential Runge Kutta (3,2) Pair Conclusions 2
3 Exponential Integrators Typical stiff nonlinear initial value problem: dy dt + η y = f(t,y), y(0) = y 0. Stiff: Nonlinearity f varies slowly in t compared with the value of the linear coefficient η: 1 df f dt η Goal: Solve on the linear time scale exactly; avoid the linear time-step restriction ητ 1. In the presence of nonlinearity, straightforward integrating factor methods (cf. Lawson 1967) do not remove the explicit restriction on the linear time step τ. 3
4 Instead, discretize the perturbed problem with a scheme that is exact on the time scale of the solvable part. 4
5 Exponential Euler Algorithm Express exact evolution of y in terms of P(t) = e ηt : ( ) y(t) = P 1 (t) y 0 + t 0 fp d t. Change variables: P d t = η 1 dp ( P(t) y(t) = P 1 (t) y 0 + η 1 1 f dp ). Rectangular approximation of integral Exponential Euler: ( y i+1 = P 1 y i + P 1 ) f i, η where P = e ητ and τ is the time step. The discretization is now with respect to P instead of t. 5
6 Exponential Euler Algorithm (E-Euler) y i+1 = e ητ y i + 1 e ητ η f(y i ), Also called Exponentially Fitted Euler, ETD Euler, filtered Euler, Lie Euler. As τ 0 the Euler method is recovered: y i+1 = y i + τf(y i ). If E-Euler has a fixed point, it must satisfy y = f(y) ; this is η then a fixed point of the ODE. In contrast, the popular Integrating Factor method (I-Euler). y i+1 = e ητ (y i + τf i ) can at best have an incorrect fixed point: y = τf(y) e ητ 1. 6
7 Comparison of Euler Integrators dy dt + y = cos y, y(0) = 1. 0 error euler i euler e euler t 7
8 History Certaine [1960]: Exponential Adams-Moulton Nørsett [1969]: Exponential Adams-Bashforth Verwer [1977] and van der Houwen [1977]: Exponential linear multistep method Friedli [1978]: Exponential Runge-Kutta Hochbruck et al. [1998]: Exponential integrators up to order 4 Beylkin et al. [1998]: Exact Linear Part (ELP) Cox & Matthews [2002]: ETDRK3, ETDRK4; worst case: stiff order 2 Lu [2003]: Efficient Matrix Exponential 8
9 Hochbruck & Ostermann [2005a], Hochbruck & Ostermann [2005b]: Explicit Exponential Runge-Kutta; stiff order conditions. 9
10 Generalization Let L be a linear operator with a stationary Green s function G(t,t ) = G(t t ): G(t,t ) t + LG(t,t ) = δ(t t ). Let f be a continuous function of y. Then the ODE has the formal solution dy dt + Ly = f(y), y(0) = y 0, y(t) = e t 0 Ldt y 0 + t 0 G(t t )f(y(t )) dt. 10
11 Letting s = t t : y(t) = e t 0 Ldt y 0 + t 0 G(s)f(y(t s)) ds. Change integration variable to h = H(s) = s 0 G( s) d s: y(t) = e t 0 Ldt y 0 + H(t) 1 f ( y(t H 1 (h)) ) dh. Rectangular rule Predictor (Euler): Trapezoidal rule Corrector: ỹ(t) e t 0 Ldt y 0 + f(y(0))h(t). y(t) e t 0 Ldt y 0 + f(y(0)) + f(ỹ(t)) H(t). 2 11
12 Other Generalizations Higher-order exponential integrators: Hochbruck et al. [1998], Cox & Matthews [2002], Hochbruck & Ostermann [2005a], Bowman et al. [2006]. Vector case (matrix exponential P = e ηt ). Exponential versions of Conservative Integrators [Bowman et al. 1997], [Shadwick et al. 1999], [Kotovych & Bowman 2002]. Lagrangian discretizations of advection equations are also exponential integrators: u t + v x u = f(x,t,u), u(x, 0) = u 0(x). η now represents the linear operator v x P 1 u = e tv x u corresponds to the Taylor series of u(x vt). 12
13 Higher-Order Integrators General s-stage Runge Kutta scheme: y i = y 0 + τ i 1 j=0 a ij f(y j,t + b j τ), (i = 1,...,s). Butcher Tableau (s=4): b 0 a 10 b 1 a 20 a 21 b 2 a 30 a 31 a 32 b 3 a 40 a 41 a 42 a 43 13
14 Higher-Order Exponential Integrators dy dt + η y = f(t,y), y(0) = y 0. Let x = e ηt, u = xy. Then dx/dt = ηx, so that du dx = d(xy) dx = y + xdt dy dx dt = y + 1 η (f ηy) = f η Apply conventional integrator to du dx = f η. When y is evolved from t = 0 to t = τ, the new independent variable goes from x = 1 to x = e ητ. 14
15 Vector Case When y is a vector, ν is typically a matrix: dy + νy = f(y). dt Let z = ντ. Discretization involves ϕ 1 (z) = z 1 (e z 1). Higher-order exponential integrators require ) j 1 ϕ j (z) = z (e j z z k. k! k=0 Exercise care when z has an eigenvalue near zero! Although a variable time step requires re-evaluation of the matrix exponential, this is not an issue for problems where the evaluation of the nonlinear term dominates the computation. Pseudospectral turbulence codes: diagonal matrix exponential. 15
16 Charged Particle in Electromagnetic Fields Lorentz force: mdv q dt = 1 v B + E. c Efficiently compute the matrix exponential exp(ω), where Ω = q mc τ 0 B z B y B z 0 B x. B y B x 0 Requires 2 trigonometric functions, 1 division, 1 square root, and 35 additions or multiplications. The other necessary matrix factor, Ω 1 [exp(ω) 1] requires care, since Ω is singular. Evaluate it as lim [(Ω + λ 0 λ1) 1 (e Ω 1)]. 16
17 Motion Under Lorentz Force Exact, PC, E-PC trajectories of a particle under Lorentz force. 17
18 Bogacki Shampine (3,2) Pair Embedded 4-stage pair [Bogacki & Shampine 1989]: rd order nd order Since f(y 3 ) is just f at the initial y 0 for the next time step, no additional source evaluation is required to compute y 4 [FSAL]. 18
19 An Embedded 4-Stage (3,2) Exponential Pair Letting z = ντ and b 4 = 1: y i = e b iντ y 0 + τ i 1 j=0 a 10 = 1 ( ) 1 2 ϕ 1 2 z, a 20 = 3 ( ) 3 4 ϕ 1 4 z a 21, a 21 = 9 8 ϕ 2 a ij f(y j,t + b j τ), ( ) 3 4 z ϕ 2 (i = 1,...,s). ( ) 1 2 z, a 30 =ϕ 1 (z) a 31 a 32, a 31 = 1 3 ϕ 1(z),a 32 = 4 3 ϕ 2(z) 2 9 ϕ 1(z), a 40 =ϕ 1 (z) ϕ 2(z), a 41 = 1 2 ϕ 2(z), a 42 = 2 3 ϕ 2(z), a 43 = 1 4 ϕ 2(z). y 3 has stiff order 3 [Hochbruck and Ostermann 2005] (order is preserved even when ν is a general unbounded linear operator). y 4 provides a second-order estimate for adjusting the time step. ν 0: reduces to [3,2] Bogacki Shampine Runge Kutta pair. 19
20 Application to GOY Turbulence Shell Model E(k) k 20
21 Conclusions Exponential integrators are explicit schemes for ODEs with a stiff linearity. When the nonlinear source is constant, the time-stepping algorithm is precisely the analytical solution to the corresponding first-order linear ODE. Unlike integrating factor methods, exponential integrators have the correct fixed point behaviour. We present an efficient adaptive embedded 4-stage (3,2) exponential pair. A similar embedded 6-stage (5,4) exponential pair also exists. Care must be exercised when evaluating ϕ j near 0. Accurate optimized double precision routines for evaluating these functions are available at bowman/phi.h 21
22 Asymptote: 2D & 3D Vector Graphics Language Andy Hammerlindl, John C. Bowman, Tom Prince (freely available under the GNU public license) 22
23 Asymptote Lifts TEX to 3D Acknowledgements: Orest Shardt (U. Alberta) 23
24 References [Beylkin et al. 1998] G. Beylkin, J. M. Keiser, & L. Vozovoi, J. Comp. Phys., 147:362, [Bogacki & Shampine 1989] P. Bogacki & L. F. Shampine, Appl. Math. Letters, 2:1, [Bowman et al. 1997] [Bowman et al. 2006] J. C. Bowman, B. A. Shadwick, & P. J. Morrison, Exactly conservative integrators, in 15th IMACS World Congress on Scientific Computation, Modelling and Applied Mathematics, edited by A. Sydow, volume 2, pp , Berlin, 1997, Wissenschaft & Technik. J. C. Bowman, C. R. Doering, B. Eckhardt, J. Davoudi, M. Roberts, & J. Schumacher, Physica D, 218:1, [Certaine 1960] J. Certaine, Math. Meth. Dig. Comp., p. 129, [Cox & Matthews 2002] S. Cox & P. Matthews, J. Comp. Phys., 176:430, [Friedli 1978] A. Friedli, Lecture Notes in Mathematics, 631:214, [Hochbruck & Ostermann 2005a] M. Hochbruck & A. Ostermann, SIAM J. Numer. Anal., 43:1069, [Hochbruck & Ostermann 2005b] M. Hochbruck & A. Ostermann, Appl. Numer. Math., 53:323, [Hochbruck et al. 1998] M. Hochbruck, C. Lubich, & H. Selfhofer, SIAM J. Sci. Comput., 19:1552, [Kotovych & Bowman 2002] O. Kotovych & J. C. Bowman, J. Phys. A.: Math. Gen., 35:7849, [Lu 2003] Y. Y. Lu, J. Comput. Appl. Math., 161:203, [Nørsett 1969] S. Nørsett, Lecture Notes in Mathematics, 109:214, [Shadwick et al. 1999] B. A. Shadwick, J. C. Bowman, & P. J. Morrison, SIAM J. Appl. Math., 59:1112, [van der Houwen 1977] P. J. van der Houwen, Construction of integration formulas for initial value problems, North- Holland Publishing Co., Amsterdam, 1977, North-Holland Series in Applied Mathematics and Mechanics, Vol. 19. [Verwer 1977] J. Verwer, Numer. Math., 27:143, 1977.
Exponential Integrators
Exponential Integrators John C. Bowman (University of Alberta) May 22, 2007 www.math.ualberta.ca/ bowman/talks 1 Exponential Integrators Outline Exponential Euler History Generalizations Stationary Green
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 informationLecture 4: Numerical solution of ordinary differential equations
Lecture 4: Numerical solution of ordinary differential equations Department of Mathematics, ETH Zürich General explicit one-step method: Consistency; Stability; Convergence. High-order methods: Taylor
More 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 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 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 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 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 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 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 informationCo-sponsored School/Workshop on Integrable Systems and Scientific Computing June Exponential integrators for stiff systems
2042-2 Co-sponsored School/Workshop on Integrable Systems and Scientific Computing 15-20 June 2009 Exponential integrators for stiff systems Paul Matthews University of Nottingham U.K. e-mail: Paul.Matthews@nottingham.ac.uk
More informationExponential integrators and functions of the matrix exponential
Exponential integrators and functions of the matrix exponential Paul Matthews, Stephen Cox, Hala Ashi and Linda Cummings School of Mathematical Sciences, University of Nottingham, UK Introduction to exponential
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 informationChapter 5 Exercises. (a) Determine the best possible Lipschitz constant for this function over 2 u <. u (t) = log(u(t)), u(0) = 2.
Chapter 5 Exercises From: Finite Difference Methods for Ordinary and Partial Differential Equations by R. J. LeVeque, SIAM, 2007. http://www.amath.washington.edu/ rjl/fdmbook Exercise 5. (Uniqueness for
More 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 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 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 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 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 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 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 informationRemark on the Sensitivity of Simulated Solutions of the Nonlinear Dynamical System to the Used Numerical Method
International Journal of Mathematical Analysis Vol. 9, 2015, no. 55, 2749-2754 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ijma.2015.59236 Remark on the Sensitivity of Simulated Solutions of
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 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 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 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 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 informationLecture IV: Time Discretization
Lecture IV: Time Discretization Motivation Kinematics: continuous motion in continuous time Computer simulation: Discrete time steps t Discrete Space (mesh particles) Updating Position Force induces acceleration.
More informationDownloaded 12/15/15 to Redistribution subject to SIAM license or copyright; see
SIAM J. NUMER. ANAL. Vol. 40, No. 4, pp. 56 537 c 2002 Society for Industrial and Applied Mathematics PREDICTOR-CORRECTOR METHODS OF RUNGE KUTTA TYPE FOR STOCHASTIC DIFFERENTIAL EQUATIONS KEVIN BURRAGE
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 informationTHE METHOD OF LINES FOR PARABOLIC PARTIAL INTEGRO-DIFFERENTIAL EQUATIONS
JOURNAL OF INTEGRAL EQUATIONS AND APPLICATIONS Volume 4, Number 1, Winter 1992 THE METHOD OF LINES FOR PARABOLIC PARTIAL INTEGRO-DIFFERENTIAL EQUATIONS J.-P. KAUTHEN ABSTRACT. We present a method of lines
More informationNORGES TEKNISK-NATURVITENSKAPELIGE UNIVERSITET. Solving the nonlinear Schödinger equation using exponential integrators PREPRINT NUMERICS NO.
NORGES TEKNISK-NATURVITENSKAPELIGE UNIVERSITET Solving the nonlinear Schödinger equation using exponential integrators by Håvard Berland and Bård Skaflestad PREPRINT NUMERICS NO. 5/2005 NORWEGIAN UNIVERSITY
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 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 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 informationIntroduction to multiscale modeling and simulation. Explicit methods for ODEs : forward Euler. y n+1 = y n + tf(y n ) dy dt = f(y), y(0) = y 0
Introduction to multiscale modeling and simulation Lecture 5 Numerical methods for ODEs, SDEs and PDEs The need for multiscale methods Two generic frameworks for multiscale computation Explicit methods
More informationOn interval predictor-corrector methods
DOI 10.1007/s11075-016-0220-x ORIGINAL PAPER On interval predictor-corrector methods Andrzej Marcinia 1,2 Malgorzata A. Janowsa 3 Tomasz Hoffmann 4 Received: 26 March 2016 / Accepted: 3 October 2016 The
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 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 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 informationExponential integrators for semilinear parabolic problems
Exponential integrators for semilinear parabolic problems Marlis Hochbruck Heinrich-Heine University Düsseldorf Germany Innsbruck, October 2004 p. Outline Exponential integrators general class of methods
More informationWorksheet 8 Sample Solutions
Technische Universität München WS 2016/17 Lehrstuhl für Informatik V Scientific Computing Univ.-Prof. Dr. M. Bader 19.12.2016/21.12.2016 M.Sc. S. Seckler, M.Sc. D. Jarema Worksheet 8 Sample Solutions Ordinary
More informationSouthern Methodist University.
Title: Continuous extensions Name: Lawrence F. Shampine 1, Laurent O. Jay 2 Affil./Addr. 1: Department of Mathematics Southern Methodist University Dallas, TX 75275 USA Phone: +1 (972) 690-8439 E-mail:
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 informationExponential integrators
Acta Numerica (2), pp. 29 286 c Cambridge University Press, 2 doi:.7/s962492948 Printed in the United Kingdom Exponential integrators Marlis Hochbruck Karlsruher Institut für Technologie, Institut für
More informationThe Initial Value Problem for Ordinary Differential Equations
Chapter 5 The Initial Value Problem for Ordinary Differential Equations In this chapter we begin a study of time-dependent differential equations, beginning with the initial value problem (IVP) for a time-dependent
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 informationRunge Kutta Chebyshev methods for parabolic problems
Runge Kutta Chebyshev methods for parabolic problems Xueyu Zhu Division of Appied Mathematics, Brown University December 2, 2009 Xueyu Zhu 1/18 Outline Introdution Consistency condition Stability Properties
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 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 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 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 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 informationAPPLICATIONS OF FD APPROXIMATIONS FOR SOLVING ORDINARY DIFFERENTIAL EQUATIONS
LECTURE 10 APPLICATIONS OF FD APPROXIMATIONS FOR SOLVING ORDINARY DIFFERENTIAL EQUATIONS Ordinary Differential Equations Initial Value Problems For Initial Value problems (IVP s), conditions are specified
More informationExponential multistep methods of Adams-type
Exponential multistep methods of Adams-type Marlis Hochbruck and Alexander Ostermann KARLSRUHE INSTITUTE OF TECHNOLOGY (KIT) 0 KIT University of the State of Baden-Wuerttemberg and National Laboratory
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 informationNumerical Analysis. A Comprehensive Introduction. H. R. Schwarz University of Zürich Switzerland. with a contribution by
Numerical Analysis A Comprehensive Introduction H. R. Schwarz University of Zürich Switzerland with a contribution by J. Waldvogel Swiss Federal Institute of Technology, Zürich JOHN WILEY & SONS Chichester
More informationStepsize Restrictions for Boundedness and Monotonicity of Multistep Methods
Stepsize Restrictions for Boundedness and Monotonicity of Multistep Methods W. Hundsdorfer, A. Mozartova, M.N. Spijker Abstract In this paper nonlinear monotonicity and boundedness properties are analyzed
More informationExponential Almost Runge-Kutta Methods for Semilinear Problems
Exponential Almost Runge-Kutta Methods for Semilinear Problems John Carroll Eóin O Callaghan 9 January 3 Abstract We present a new class of one-step, multi-value Exponential Integrator (EI) methods referred
More informationMath 216 First Midterm 19 October, 2017
Math 6 First Midterm 9 October, 7 This sample exam is provided to serve as one component of your studying for this exam in this course. Please note that it is not guaranteed to cover the material that
More informationStudy of Numerical Accuracy of Runge-Kutta Second, Third and Fourth Order Method
Study of Numerical Accuracy of Runge-Kutta Second, Third and Fourth Order Method Najmuddin Ahmad, Shiv Charan,Vimal Partap Singh Department of Mathematics, Integral University, Lucknow Abstract : We have
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 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 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 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 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 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 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 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 informationOrdinary differential equations. Phys 420/580 Lecture 8
Ordinary differential equations Phys 420/580 Lecture 8 Most physical laws are expressed as differential equations These come in three flavours: initial-value problems boundary-value problems eigenvalue
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 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 informationAstrodynamics (AERO0024)
Astrodynamics (AERO0024) 5. Numerical Methods Gaëtan Kerschen Space Structures & Systems Lab (S3L) Why Different Propagators? Analytic propagation: Better understanding of the perturbing forces. Useful
More informationExponential Runge-Kutta methods for parabolic problems
Exponential Runge-Kutta methods for parabolic problems Marlis Hochbruck a,, Alexander Ostermann b a Mathematisches Institut, Heinrich-Heine Universität Düsseldorf, Universitätsstraße 1, D-4225 Düsseldorf,
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 informationA Composite Runge Kutta Method for the Spectral Solution of Semilinear PDEs
Journal of Computational Physics 8, 57 67 (00) doi:0.006/jcph.00.77 A Composite Runge Kutta Method for the Spectral Solution of Semilinear PDEs Tobin A. Driscoll Department of Mathematical Sciences, University
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 informationEXPLICIT EXPONENTIAL RUNGE-KUTTA METHODS FOR SEMILINEAR PARABOLIC PROBLEMS
EXPLICIT EXPONENTIAL RUNGE-KUTTA METHODS FOR SEMILINEAR PARABOLIC PROBLEMS MARLIS HOCHBRUCK AND ALEXANDER OSTERMANN, Abstract. The aim of this paper is to analyze explicit exponential Runge-Kutta methods
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 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 informationDiscontinuous Galerkin methods for fractional diffusion problems
Discontinuous Galerkin methods for fractional diffusion problems Bill McLean Kassem Mustapha School of Maths and Stats, University of NSW KFUPM, Dhahran Leipzig, 7 October, 2010 Outline Sub-diffusion Equation
More informationMath 128A Spring 2003 Week 11 Solutions Burden & Faires 5.6: 1b, 3b, 7, 9, 12 Burden & Faires 5.7: 1b, 3b, 5 Burden & Faires 5.
Math 128A Spring 2003 Week 11 Solutions Burden & Faires 5.6: 1b, 3b, 7, 9, 12 Burden & Faires 5.7: 1b, 3b, 5 Burden & Faires 5.8: 1b, 3b, 4 Burden & Faires 5.6. Multistep Methods 1. Use all the Adams-Bashforth
More informationNumerical Solution of ODE IVPs
L.G. de Pillis and A.E. Radunskaya July 30, 2002 This work was supported in part by a grant from the W.M. Keck Foundation 0-0 NUMERICAL SOLUTION OF ODE IVPs Overview 1. Quick review of direction fields.
More informationChapter 6 Nonlinear Systems and Phenomena. Friday, November 2, 12
Chapter 6 Nonlinear Systems and Phenomena 6.1 Stability and the Phase Plane We now move to nonlinear systems Begin with the first-order system for x(t) d dt x = f(x,t), x(0) = x 0 In particular, consider
More informationAn Exactly Conservative Integrator for the n-body Problem
An Exactly Conservative Integrator for the n-body Problem Oksana Kotovych and John C. Bowman Department of Mathematical and Statistical Sciences, University of Alberta, Edmonton, Alberta, Canada T6G G1
More informationStability Ordinates of Adams Predictor-Corrector Methods
BIT manuscript No. will be inserted by the editor) Stability Ordinates of Adams Predictor-Corrector Methods Michelle L. Ghrist Bengt Fornberg Jonah A. Reeger Received: date / Accepted: date Abstract How
More informationMath 216 Final Exam 14 December, 2012
Math 216 Final Exam 14 December, 2012 This sample exam is provided to serve as one component of your studying for this exam in this course. Please note that it is not guaranteed to cover the material that
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 informationIntegrating-Factor-Based 2-Additive Runge Kutta methods for Advection-Reaction-Diffusion Equations
Integrating-Factor-Based 2-Additive Runge Kutta methods for Advection-Reaction-Diffusion Equations A Thesis Submitted to the College of Graduate Studies and Research in Partial Fulfillment of the Requirements
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 informationA New Embedded Phase-Fitted Modified Runge-Kutta Method for the Numerical Solution of Oscillatory Problems
Applied Mathematical Sciences, Vol. 1, 16, no. 44, 157-178 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/1.1988/ams.16.64146 A New Embedded Phase-Fitted Modified Runge-Kutta Method for the Numerical Solution
More information1.2. Direction Fields: Graphical Representation of the ODE and its Solution Let us consider a first order differential equation of the form dy
.. Direction Fields: Graphical Representation of the ODE and its Solution Let us consider a first order differential equation of the form dy = f(x, y). In this section we aim to understand the solution
More informationStabilität differential-algebraischer Systeme
Stabilität differential-algebraischer Systeme Caren Tischendorf, Universität zu Köln Elgersburger Arbeitstagung, 11.-14. Februar 2008 Tischendorf (Univ. zu Köln) Stabilität von DAEs Elgersburg, 11.-14.02.2008
More informationSMOOTHNESS PROPERTIES OF SOLUTIONS OF CAPUTO- TYPE FRACTIONAL DIFFERENTIAL EQUATIONS. Kai Diethelm. Abstract
SMOOTHNESS PROPERTIES OF SOLUTIONS OF CAPUTO- TYPE FRACTIONAL DIFFERENTIAL EQUATIONS Kai Diethelm Abstract Dedicated to Prof. Michele Caputo on the occasion of his 8th birthday We consider ordinary fractional
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 informationLecture 8: Calculus and Differential Equations
Lecture 8: Calculus and Differential Equations Dr. Mohammed Hawa Electrical Engineering Department University of Jordan EE201: Computer Applications. See Textbook Chapter 9. Numerical Methods MATLAB provides
More informationLecture 8: Calculus and Differential Equations
Lecture 8: Calculus and Differential Equations Dr. Mohammed Hawa Electrical Engineering Department University of Jordan EE21: Computer Applications. See Textbook Chapter 9. Numerical Methods MATLAB provides
More information5. Ordinary Differential Equations. Indispensable for many technical applications!
Indispensable for many technical applications! Numerisches Programmieren, Hans-Joachim Bungartz page 1 of 30 5.1. Introduction Differential Equations One of the most important fields of application of
More informationAppendix C: Recapitulation of Numerical schemes
Appendix C: Recapitulation of Numerical schemes August 31, 2009) SUMMARY: Certain numerical schemes of general use are regrouped here in order to facilitate implementations of simple models C1 The tridiagonal
More informationA Modified Runge-Kutta-Nyström Method by using Phase Lag Properties for the Numerical Solution of Orbital Problems
Appl. Math. Inf. Sci., No., - () Applied Mathematics & Information Sciences An International Journal A Modified Runge-Kutta-Nyström Method by using Phase Lag Properties for the Numerical Solution of Orbital
More information