Scientific Computing II
|
|
- Ross Russell
- 5 years ago
- Views:
Transcription
1 Scientific Computing II Molecular Dynamics Numerics Michael Bader SCCS Technical University of Munich Summer 018
2 Recall: Molecular Dynamics System of ODEs resulting force acting on a molecule: F i = j i acceleration of a molecule (Newton s nd law): F r i = i j i F ij = m i m i or, with acceleration a i := 1 m i Fi : r i = a i, = F ij U( r i, r j ) j i r ij m i where F i and a i depend on all positions r i transfer to dn coupled ordinary differential equations of 1st order: m i r i = p i or r i = v i p i = F i vi = F i /m i = a i Michael Bader SCCS Scientific Computing II Molecular Dynamics Numerics Summer 018
3 Euler Time Stepping for MD Explicit Euler Method: Taylor series expansion of the positions in time: (ṙ, r, r (i) : derivatives) r(t + t) = r(t) + t r(t) + 1 t r(t) + t i i! r (i) (t) +... (1) neglecting terms of higher order of t, and analogous formulation of v(t) := r(t) with a(t) := v(t) = r(t) = F (t) m leads to the explicit Euler method: v(t + t). = v(t) + t a(t) r(t + t). = r(t) + t v(t) Michael Bader SCCS Scientific Computing II Molecular Dynamics Numerics Summer 018 3
4 Euler Time Stepping for MD (cont.) explicit Euler method: v(t + t). = v(t) + t a(t) r(t + t). = r(t) + t v(t) (a) (b) similar for implicit Euler method derivatives at the time step end: v(t + t). = v(t) + t a(t + t) r(t + t). = r(t) + t v(t + t) (3a) (3b) disadvantage for both schemes: do not conserve critical properties; lead to wrong long-term solutions (compare tutorial on circular motion); plus: low accuracy Michael Bader SCCS Scientific Computing II Molecular Dynamics Numerics Summer 018 4
5 Classical Störmer Verlet Method the Taylor series expansion in (1) can also be performed for t: r(t t) = r(t) t r(t) + 1 t r(t) + ( t)i r (i) (t) +... (4) i! from (1) and (4) the classical Verlet algorithm can be derived: r(t + t) = r(t) r(t t) + t r(t) + O( t 4 ) r(t) r(t t) + t a(t) (5) note: direct calculation of r(t + t) from r(t) and F(t) velocity can be estimated via v(t) = r(t). = r(t + t) r(t t) t disadvantage: needs to store two previous time steps (6) Michael Bader SCCS Scientific Computing II Molecular Dynamics Numerics Summer 018 5
6 Crank Nicolson Method explicit approximation (7a) for half step [t, t + t ] inserted into implicit approximation (7b) for half step [t + t, t + t] v(t + t t ) = v(t) + a(t) (7a) v(t + t) = v(t + t ) + t a(t + t) (7b) leads to Crank-Nicolson scheme for v: v(t + t) = v(t) + t ( a(t) + a(t + t) ) (8) key disadvantage: implicit scheme, as a(t + t) depends on r(t + t); needs to solve non-linear system of equations Michael Bader SCCS Scientific Computing II Molecular Dynamics Numerics Summer 018 6
7 Velocity Störmer Verlet Method The Velocity Störmer Verlet method is a composition of a Taylor series expansion of nd order for the positions, as in Eq. (1) and a Crank Nicolson method for the velocities, as in Eq. (8) r(t + t) = r(t) + t v(t) + t a(t) (9a) ( v(t + t) = v(t) + t a(t) + a(t + t) ) (9b) Forward Euler r Force calculation Crank-Nicolson v r v F t- t t t+ t t- t t t+ t t- t t t+ t t- t t t+ t Memory requirement: (3 + 1) 3N (3+1 vector fields) update of v(t + t) requires v(t), r(t + t) and F (t + t), but also F (t) Michael Bader SCCS Scientific Computing II Molecular Dynamics Numerics Summer 018 7
8 Velocity Störmer Verlet Implementation reformulate equation for positions r: r(t + t) = r(t) + t v(t) + t a(t) ( = r(t) + t v(t) + t ) a(t) contains half an Euler time step for v similar for the velocities v: v(t + t) = v(t) + t ( a(t) + a(t + t) ) ( = v(t) + t ) a(t) + t a(t + t) reuses the result of the half Euler time step for v Michael Bader SCCS Scientific Computing II Molecular Dynamics Numerics Summer 018 8
9 Velocity Störmer Verlet Implementation () 1. compute half an Euler time step for v v(t + t ) = v(t) t + a(t). update positions r: r(t + t) = r(t) + t v(t + t ) 3. calculate forces a(t + t) from positions r(t + t) 4. update the velocities v: v(t + t) = v(t + t ) + t a(t + t) Note: memory requirements: 3 3N (3 vector fields) vectors v and r, as well as forces/accelerations a may be updated in-place in each time step Michael Bader SCCS Scientific Computing II Molecular Dynamics Numerics Summer 018 9
10 Leapfrog Method combine steps 4 (from previous time step) and 1 to a single step velocity calculation thus shifted by a half time step: v(t + t ) = v(t t ) + t a(t) (10a) r(t + t) = r(t) + t v(t + t ) (10b) r v F t- t/ t+ t/ t- t/ t+ t/ t- t/ t+ t/ t- t/ t+ t/ t- t t t+ t t- t t t+ t t- t t t+ t t- t t t+ t exact arithmetic: Störmer Verlet, Velocity Störmer Verlet and Leapfrog Scheme are equivalent the latter two are more robust w.r.t. roundoff errors Michael Bader SCCS Scientific Computing II Molecular Dynamics Numerics Summer
11 Dimensionless Velocity Störmer Verlet remember dimensionless formulation: ( r := σ r, v := σ v t, t := σ m ɛ t, r = 1 m F := 1 ɛ m σ F ) insert into Velocity Störmer Verlet Method to get:. r (t + t) = r (t) + v (t) + v (t + t) = v (t) + t t F (t) + F (t) t F (t + t) (11a) (11b) Forward Euler r ½ Forward Euler v Force calculation ½ Backward Euler v r v F t- t t t+ t t- t t t+ t t- t t t+ t t- t t t+ t t- t t t+ t Michael Bader SCCS Scientific Computing II Molecular Dynamics Numerics Summer
12 Dimensionless Velocity Störmer Verlet () Forward Euler r ½ Forward Euler v Force calculation ½ Backward Euler v r v F t- t t t+ t t- t t t+ t t- t t t+ t t- t t t+ t t- t t t+ t Procedure: 1. calculate new positions (11a), partial velocity update: + t F (t) in (11b). calculate new forces, accelerations (computationally intensive!) 3. calculate new velocities: + t F (t + t) in (11b) memory requirements: 3 3N Michael Bader SCCS Scientific Computing II Molecular Dynamics Numerics Summer 018 1
13 Outlook: Leapfrog Method with Thermostat Leapfrog method: v(t + t ) = v(t t ) + t a(t) r(t + t) = r(t) + t v(t + t ) r v F Thermostat t- t t+ t t+ t t- t t+ t t- t t t+ t t- t t t+ t t- t t t+ t t- t t t+ t t- t t t+ t intermediate ( step may be introduced for the thermostat v(t) := 1 v(t + t ) + v(t t )) to synchronize velocity: v act (t) = v(t t ) + t a(t) (13a) v(t + t ) = (β 1) v act(t) + t a(t) (13b) Michael Bader SCCS Scientific Computing II Molecular Dynamics Numerics Summer
14 Evaluation of Time Integration Methods Evaluation criteria: accuracy (often not of great importance for exact particle positions) stability conservation of phase space density (symplectic) of energy of momentum (especially with PBC Periodic Boundary Conditions) reversibility of time use of resources: computational effort (number of force evaluations) maximum time step size memory usage Michael Bader SCCS Scientific Computing II Molecular Dynamics Numerics Summer
15 Reversibility of Time time reversal for a closed system means a turnaround of the velocities and also momentums; positions at the inversion point stay constant traverse of a trajectory back in the direction of the origin demand for symmetry for time integration methods + satisfied by Verlet method, e.g. not satisfied by, e.g., Euler method, Predictor Corrector methods (also not by standard Runge-Kutta methods) contradiction with the H-theorem (increase of entropy, irreversible processes)? (Loschmidt s paradox) the second theorem of thermodynamics? reversibility in theory only for a very short time Lyapunov instability Kolmogorov entropy Michael Bader SCCS Scientific Computing II Molecular Dynamics Numerics Summer
16 Lyapunov Instability Basic question: how does a model behave with slightly disturbed initial condition? Example of a simple system: stable case: jumping ball on a plane with slightly disturbed initial horizontal velocity linear increase of the disturbance instable case: jumping ball on a sphere with slightly disturbed initial horizontal velocity exponential increase of the disturbance (Lyapunov exponent) for the instable case, small disturbances result in large changes: chaotic behaviour (butterfly leading to a hurricane?) non-linear differential equations are often dynamically instable Michael Bader SCCS Scientific Computing II Molecular Dynamics Numerics Summer
17 Lyapunov Instability: A Numerical Experiment setup of 4000 fcc atoms for a second setup, the position of a single atom was displaced by this atom is traced in both setups tracing a Molecule (with initial displacement) Molecule 5, run1 Molecule 5, run colours indicate velocity Michael Bader SCCS Scientific Computing II Molecular Dynamics Numerics Summer
18 Lyapunov Instability: A Numerical Experiment Calculation of the trajectories badly conditioned problem: a small change of the initial position of a molecule may result in a distance to the comparable original position, after some time, in the magnitude of the whole domain! Thus: do not target at simulation of individual trajectories numerical simulation of the behaviour of the system is wanted! tracing a Molecule (with initial displacement) Molecule 5, run1 Molecule 5, run Molecule deviation (with initial displacement) Michael Bader SCCS Scientific Computing II Molecular Dynamics Numerics Summer
Lecture 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 informationLecture V: The game-engine loop & Time Integration
Lecture V: The game-engine loop & Time Integration The Basic Game-Engine Loop Previous state: " #, %(#) ( #, )(#) Forces -(#) Integrate velocities and positions Resolve Interpenetrations Per-body change
More informationOrdinary Differential Equations II
Ordinary Differential Equations II CS 205A: Mathematical Methods for Robotics, Vision, and Graphics Justin Solomon CS 205A: Mathematical Methods Ordinary Differential Equations II 1 / 29 Almost Done! No
More informationOrdinary Differential Equations II
Ordinary Differential Equations II CS 205A: Mathematical Methods for Robotics, Vision, and Graphics Justin Solomon CS 205A: Mathematical Methods Ordinary Differential Equations II 1 / 33 Almost Done! Last
More informationRunga-Kutta Schemes. Exact evolution over a small time step: Expand both sides in a small time increment: d(δt) F (x(t + δt),t+ δt) Ft + FF x ( t)
Runga-Kutta Schemes Exact evolution over a small time step: x(t + t) =x(t)+ t 0 d(δt) F (x(t + δt),t+ δt) Expand both sides in a small time increment: x(t + t) =x(t)+x (t) t + 1 2 x (t)( t) 2 + 1 6 x (t)+
More informationPhysics 115/242 The leapfrog method and other symplectic algorithms for integrating Newton s laws of motion
Physics 115/242 The leapfrog method and other symplectic algorithms for integrating Newton s laws of motion Peter Young (Dated: April 14, 2009) I. INTRODUCTION One frequently obtains detailed dynamical
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 information1 Ordinary differential equations
Numerical Analysis Seminar Frühjahrssemester 08 Lecturers: Prof. M. Torrilhon, Prof. D. Kressner The Störmer-Verlet method F. Crivelli (flcrivel@student.ethz.ch May 8, 2008 Introduction During this talk
More informationQUESTIONS FOR THE TESTS-ECI 146
QUESTIONS FOR THE TESTS-ECI 46 IMPORTANT: Please note that the questions in the exams WILL BE DIFFERENT than these. (These questions are valid for the midterm and for the final exam) Remember: A) both
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 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 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 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 informationWhat is Classical Molecular Dynamics?
What is Classical Molecular Dynamics? Simulation of explicit particles (atoms, ions,... ) Particles interact via relatively simple analytical potential functions Newton s equations of motion are integrated
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 informationEuler s Method applied to the control of switched systems
Euler s Method applied to the control of switched systems FORMATS 2017 - Berlin Laurent Fribourg 1 September 6, 2017 1 LSV - CNRS & ENS Cachan L. Fribourg Euler s method and switched systems September
More informationDraft TAYLOR SERIES METHOD FOR SYSTEM OF PARTICLES INTERACTING VIA LENNARD-JONES POTENTIAL. Nikolai Shegunov, Ivan Hristov
TAYLOR SERIES METHOD FOR SYSTEM OF PARTICLES INTERACTING VIA LENNARD-JONES POTENTIAL Nikolai Shegunov, Ivan Hristov March 9, Seminar in IMI,BAS,Soa 1/25 Mathematical model We consider the Hamiltonian :
More informationChap. 20: Initial-Value Problems
Chap. 20: Initial-Value Problems Ordinary Differential Equations Goal: to solve differential equations of the form: dy dt f t, y The methods in this chapter are all one-step methods and have the general
More informationAlgorithms of Scientific Computing II
Technische Universität München WS 01/013 Institut für Informatik Prof. Dr. Hans-Joachim Bungartz Alexander Heinecke, M.Sc., M.Sc.w.H. Algorithms of Scientific Computing II Exercise 3 - Discretization,
More informationA Brief Introduction to Numerical Methods for Differential Equations
A Brief Introduction to Numerical Methods for Differential Equations January 10, 2011 This tutorial introduces some basic numerical computation techniques that are useful for the simulation and analysis
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 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 informationDifferential Equations
Differential Equations Definitions Finite Differences Taylor Series based Methods: Euler Method Runge-Kutta Methods Improved Euler, Midpoint methods Runge Kutta (2nd, 4th order) methods Predictor-Corrector
More 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 informationFinite Difference and Finite Element Methods
Finite Difference and Finite Element Methods Georgy Gimel farb COMPSCI 369 Computational Science 1 / 39 1 Finite Differences Difference Equations 3 Finite Difference Methods: Euler FDMs 4 Finite Element
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 informationScientific Computing II
Scientific Computing II Molecular Dynamics Simulation Michael Bader SCCS Summer Term 2015 Molecular Dynamics Simulation, Summer Term 2015 1 Continuum Mechanics for Fluid Mechanics? Molecular Dynamics the
More informationOrdinary Differential Equations
Chapter 13 Ordinary Differential Equations We motivated the problem of interpolation in Chapter 11 by transitioning from analzying to finding functions. That is, in problems like interpolation and regression,
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 informationAM 205 Final Project The N-Body Problem
AM 205 Final Project The N-Body Problem Leah Birch Elizabeth Finn Karen Yu December 14, 2012 Abstract The N-Body Problem can be solved using a variety of numeric integrators. Newton s Law of Universal
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 informationPhysics 115/242 The leapfrog method and other symplectic algorithms for integrating Newton s laws of motion
Physics 115/242 The leapfrog method and other symplectic algorithms for integrating Newton s laws of motion Peter Young (Dated: April 17, 23) I. INTRODUCTION One frequently obtains detailed dynamical information
More informationBioengineering 215. An Introduction to Molecular Dynamics for Biomolecules
Bioengineering 215 An Introduction to Molecular Dynamics for Biomolecules David Parker May 18, 2007 ntroduction A principal tool to study biological molecules is molecular dynamics simulations (MD). MD
More informationECE 422/522 Power System Operations & Planning/Power Systems Analysis II : 7 - Transient Stability
ECE 4/5 Power System Operations & Planning/Power Systems Analysis II : 7 - Transient Stability Spring 014 Instructor: Kai Sun 1 Transient Stability The ability of the power system to maintain synchronism
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 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 informationName of the Student: Unit I (Solution of Equations and Eigenvalue Problems)
Engineering Mathematics 8 SUBJECT NAME : Numerical Methods SUBJECT CODE : MA6459 MATERIAL NAME : University Questions REGULATION : R3 UPDATED ON : November 7 (Upto N/D 7 Q.P) (Scan the above Q.R code for
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 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 informationMODELING OF CONCRETE MATERIALS AND STRUCTURES. Kaspar Willam. Class Meeting #5: Integration of Constitutive Equations
MODELING OF CONCRETE MATERIALS AND STRUCTURES Kaspar Willam University of Colorado at Boulder Class Meeting #5: Integration of Constitutive Equations Structural Equilibrium: Incremental Tangent Stiffness
More informationChapter 8. Numerical Solution of Ordinary Differential Equations. Module No. 2. Predictor-Corrector Methods
Numerical Analysis by Dr. Anita Pal Assistant Professor Department of Matematics National Institute of Tecnology Durgapur Durgapur-7109 email: anita.buie@gmail.com 1 . Capter 8 Numerical Solution of Ordinary
More informationTime stepping methods
Time stepping methods ATHENS course: Introduction into Finite Elements Delft Institute of Applied Mathematics, TU Delft Matthias Möller (m.moller@tudelft.nl) 19 November 2014 M. Möller (DIAM@TUDelft) Time
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 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 informationIdentification Methods for Structural Systems. Prof. Dr. Eleni Chatzi Lecture March, 2016
Prof. Dr. Eleni Chatzi Lecture 4-09. March, 2016 Fundamentals Overview Multiple DOF Systems State-space Formulation Eigenvalue Analysis The Mode Superposition Method The effect of Damping on Structural
More informationPh 22.1 Return of the ODEs: higher-order methods
Ph 22.1 Return of the ODEs: higher-order methods -v20130111- Introduction This week we are going to build on the experience that you gathered in the Ph20, and program more advanced (and accurate!) solvers
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 informationME Computational Fluid Mechanics Lecture 5
ME - 733 Computational Fluid Mechanics Lecture 5 Dr./ Ahmed Nagib Elmekawy Dec. 20, 2018 Elliptic PDEs: Finite Difference Formulation Using central difference formulation, the so called five-point formula
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 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 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 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 informationMolecular Dynamics. What to choose in an integrator The Verlet algorithm Boundary Conditions in Space and time Reading Assignment: F&S Chapter 4
Molecular Dynamics What to choose in an integrator The Verlet algorithm Boundary Conditions in Space and time Reading Assignment: F&S Chapter 4 MSE485/PHY466/CSE485 1 The Molecular Dynamics (MD) method
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 informationParallel-in-time integrators for Hamiltonian systems
Parallel-in-time integrators for Hamiltonian systems Claude Le Bris ENPC and INRIA Visiting Professor, The University of Chicago joint work with X. Dai (Paris 6 and Chinese Academy of Sciences), F. Legoll
More informationChaotic motion. Phys 750 Lecture 9
Chaotic motion Phys 750 Lecture 9 Finite-difference equations Finite difference equation approximates a differential equation as an iterative map (x n+1,v n+1 )=M[(x n,v n )] Evolution from time t =0to
More informationGear methods I + 1/18
Gear methods I + 1/18 Predictor-corrector type: knowledge of history is used to predict an approximate solution, which is made more accurate in the following step we do not want (otherwise good) methods
More informationEntropy and irreversibility in gas dynamics. Joint work with T. Bodineau, I. Gallagher and S. Simonella
Entropy and irreversibility in gas dynamics Joint work with T. Bodineau, I. Gallagher and S. Simonella Kinetic description for a gas of hard spheres Hard sphere dynamics The system evolves under the combined
More informationDynamics and Time Integration. Computer Graphics CMU /15-662, Fall 2016
Dynamics and Time Integration Computer Graphics CMU 15-462/15-662, Fall 2016 Last Quiz: IK (and demo) Last few classes Keyframing and motion capture - Q: what can one NOT do with these techniques? The
More informationENGI9496 Lecture Notes State-Space Equation Generation
ENGI9496 Lecture Notes State-Space Equation Generation. State Equations and Variables - Definitions The end goal of model formulation is to simulate a system s behaviour on a computer. A set of coherent
More informationON THE INTEGRATION OF EQUATIONS OF MOTION: FEM AND MOLECULAR DYNAMICS PROBLEMS
8th International Congress on Computational Mechanics, Volos, 1-15 July 015 ON THE INTEGRATION OF EQUATIONS OF MOTION: FEM AND MOLECULAR DYNAMICS PROBLEMS E.G. Kakouris, V.K. Koumousis Institute of Structural
More informationLinear Multistep Methods I: Adams and BDF Methods
Linear Multistep Methods I: Adams and BDF Methods Varun Shankar January 1, 016 1 Introduction In our review of 5610 material, we have discussed polynomial interpolation and its application to generating
More informationCHAPTER 1 INTRODUCTION TO NUMERICAL METHOD
CHAPTER 1 INTRODUCTION TO NUMERICAL METHOD Presenter: Dr. Zalilah Sharer 2018 School of Chemical and Energy Engineering Universiti Teknologi Malaysia 16 September 2018 Chemical Engineering, Computer &
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 informationNumerical Methods. Scientists. Engineers
Third Edition Numerical Methods for Scientists and Engineers K. Sankara Rao Numerical Methods for Scientists and Engineers Numerical Methods for Scientists and Engineers Third Edition K. SANKARA RAO Formerly,
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 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 informationParticle-based Fluids
Particle-based Fluids Particle Fluids Spatial Discretization Fluid is discretized using particles 3 Particles = Molecules? Particle approaches: Molecular Dynamics: relates each particle to one molecule
More informationCOMBINED EXPLICIT-IMPLICIT TAYLOR SERIES METHODS
COMBINED EXPLICIT-IMPLICIT TAYLOR SERIES METHODS S.N. Dimova 1, I.G. Hristov 1, a, R.D. Hristova 1, I V. Puzynin 2, T.P. Puzynina 2, Z.A. Sharipov 2, b, N.G. Shegunov 1, Z.K. Tukhliev 2 1 Sofia University,
More informationChapter 6 - Ordinary Differential Equations
Chapter 6 - Ordinary Differential Equations 7.1 Solving Initial-Value Problems In this chapter, we will be interested in the solution of ordinary differential equations. Ordinary differential equations
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 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 informationClassical Equations of Motion
3 Classical Equations of Motion Several formulations are in use Newtonian Lagrangian Hamiltonian Advantages of non-newtonian formulations more general, no need for fictitious forces better suited for multiparticle
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 information2.29 Numerical Fluid Mechanics Fall 2011 Lecture 20
2.29 Numerical Fluid Mechanics Fall 2011 Lecture 20 REVIEW Lecture 19: Finite Volume Methods Review: Basic elements of a FV scheme and steps to step-up a FV scheme One Dimensional examples d x j x j 1/2
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 informationOptimising the Computational Simulation of Mechanical Models: Designing a Real-Time Mass-Aggregate Physics Engine
Optimising the Computational Simulation of Mechanical Models: Designing a Real-Time Mass-Aggregate Physics Engine Jordan Spoooner July 16, 2015 What is a Physics Engine? Engine: Computer software that
More informationChaotic motion. Phys 420/580 Lecture 10
Chaotic motion Phys 420/580 Lecture 10 Finite-difference equations Finite difference equation approximates a differential equation as an iterative map (x n+1,v n+1 )=M[(x n,v n )] Evolution from time t
More informationNUMERICAL METHODS FOR ENGINEERING APPLICATION
NUMERICAL METHODS FOR ENGINEERING APPLICATION Second Edition JOEL H. FERZIGER A Wiley-Interscience Publication JOHN WILEY & SONS, INC. New York / Chichester / Weinheim / Brisbane / Singapore / Toronto
More informationX i t react. ~min i max i. R ij smallest. X j. Physical processes by characteristic timescale. largest. t diff ~ L2 D. t sound. ~ L a. t flow.
Physical processes by characteristic timescale Diffusive timescale t diff ~ L2 D largest Sound crossing timescale t sound ~ L a Flow timescale t flow ~ L u Free fall timescale Cooling timescale Reaction
More informationA Nobel Prize for Molecular Dynamics and QM/MM What is Classical Molecular Dynamics? Simulation of explicit particles (atoms, ions,... ) Particles interact via relatively simple analytical potential
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 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 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 informationVirtual Reality & Physically-Based Simulation
Virtual Reality & Physically-Based Simulation Mass-Spring-Systems G. Zachmann University of Bremen, Germany cgvr.cs.uni-bremen.de Definition: A mass-spring system is a system consisting of: 1. A set of
More informationScientific Computing II
Technische Universität München ST 008 Institut für Informatik Dr. Miriam Mehl Scientific Computing II Final Exam, July, 008 Iterative Solvers (3 pts + 4 extra pts, 60 min) a) Steepest Descent and Conjugate
More informationAb initio molecular dynamics and nuclear quantum effects
Ab initio molecular dynamics and nuclear quantum effects Luca M. Ghiringhelli Fritz Haber Institute Hands on workshop density functional theory and beyond: First principles simulations of molecules and
More informationThe Finite Element Method for the Analysis of Non-Linear and Dynamic Systems. Prof. Dr. Eleni Chatzi Lecture 6-5 November, 2015
The Finite Element Method for the Analysis of Non-Linear and Dynamic Systems Prof. Dr. Eleni Chatzi Lecture 6-5 November, 015 Institute of Structural Engineering Method of Finite Elements II 1 Introduction
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 informationLecture 17: Ordinary Differential Equation II. First Order (continued)
Lecture 17: Ordinary Differential Equation II. First Order (continued) 1. Key points Maple commands dsolve dsolve[interactive] dsolve(numeric) 2. Linear first order ODE: y' = q(x) - p(x) y In general,
More informationHigh performance computing and numerical modeling
High performance computing and numerical modeling Volker Springel Plan for my lectures Lecture 1: Collisional and collisionless N-body dynamics Lecture 2: Gravitational force calculation Lecture 3: Basic
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 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 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 informationNumerical methods for the Navier- Stokes equations
Numerical methods for the Navier- Stokes equations Hans Petter Langtangen 1,2 1 Center for Biomedical Computing, Simula Research Laboratory 2 Department of Informatics, University of Oslo Dec 6, 2012 Note:
More informationUnit I (Testing of Hypothesis)
SUBJECT NAME : Statistics and Numerical Methods SUBJECT CODE : MA645 MATERIAL NAME : Part A questions REGULATION : R03 UPDATED ON : November 07 (Upto N/D 07 Q.P) Unit I (Testing of Hypothesis). State level
More informationSystems of Ordinary Differential Equations
Systems of Ordinary Differential Equations Systems of ordinary differential equations Last two lectures we have studied models of the form y (t) F (y), y(0) y0 (1) this is an scalar ordinary differential
More informationChapter 2 Finite-Difference Discretization of the Advection-Diffusion Equation
Chapter Finite-Difference Discretization of the Advection-Diffusion Equation. Introduction Finite-difference methods are numerical methods that find solutions to differential equations using approximate
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 information