Jan Verwer Convergence and Component Splitting for the Crank-Nicolson Leap-Frog Scheme Hairer-60 Conference, Geneva, June 2009 TexPoint fonts used in EMF.

Slides:



Advertisements
Similar presentations
Finite Difference Discretization of Elliptic Equations: 1D Problem Lectures 2 and 3.
Advertisements

Discrete variational derivative methods: Geometric Integration methods for PDEs Chris Budd (Bath), Takaharu Yaguchi (Tokyo), Daisuke Furihata (Osaka)
Formal Computational Skills
4 th order Embedded Boundary FDTD algorithm for Maxwell Equations Lingling Wu, Stony Brook University Roman Samulyak, BNL Tianshi Lu, BNL Application collaborators:
Rules of Matrix Arithmetic
1 of 16 NORM - CONTROLLABILITY, or How a Nonlinear System Responds to Large Inputs Daniel Liberzon Univ. of Illinois at Urbana-Champaign, U.S.A. NOLCOS.
Reduction of Temporal Discretization Error in an Atmospheric General Circulation Model (AGCM) Daisuke Hotta Advisor: Prof. Eugenia Kalnay.
Chapter 8 Elliptic Equation.
Uniform Treatment of Numerical Time-Integrations of the Maxwell Equations R. Horváth TU/e, Philips Research Eindhoven TU/e Eindhoven, 27th June, 2002 Scientific.
Ordinary Differential Equations
Numerical Uncertainty Assessment Reference: P.J. Roache, Verification and Validation in Computational Science and Engineering, Hermosa Press, Albuquerque.
EARS1160 – Numerical Methods notes by G. Houseman
ME 595M J.Murthy1 ME 595M: Computational Methods for Nanoscale Thermal Transport Lecture 9: Introduction to the Finite Volume Method for the Gray BTE J.
1cs542g-term Notes  Even if you’re not registered (not handing in assignment 1) send me an to be added to a class list.
Total Recall Math, Part 2 Ordinary diff. equations First order ODE, one boundary/initial condition: Second order ODE.
Course SD Heat transfer by conduction in a 2D metallic plate
Convergent and Correct Message Passing Algorithms Nicholas Ruozzi and Sekhar Tatikonda Yale University TexPoint fonts used in EMF. Read the TexPoint manual.
Interactive Animation of Structured Deformable Objects Mathieu Desbrun Peter Schroder Alan Barr.
Computer-Aided Analysis on Energy and Thermofluid Sciences Y.C. Shih Fall 2011 Chapter 6: Basics of Finite Difference Chapter 6 Basics of Finite Difference.
Introduction to Numerical Methods I
Ordinary Differential Equations (ODEs) 1Daniel Baur / Numerical Methods for Chemical Engineers / Implicit ODE Solvers Daniel Baur ETH Zurich, Institut.
Numerical Methods Marisa Villano, Tom Fagan, Dave Fairburn, Chris Savino, David Goldberg, Daniel Rave.
Ordinary Differential Equations (ODEs)
1 of 12 COMMUTATORS, ROBUSTNESS, and STABILITY of SWITCHED LINEAR SYSTEMS SIAM Conference on Control & its Applications, Paris, July 2015 Daniel Liberzon.
Numerical Methods for Partial Differential Equations CAAM 452 Spring 2005 Lecture 6 Various Finite Difference Discretizations for the Advection Equations.
Ch 8.1 Numerical Methods: The Euler or Tangent Line Method
ME451 Kinematics and Dynamics of Machine Systems
Using Partitioning in the Numerical Treatment of ODE Systems with Applications to Atmospheric Modelling Zahari Zlatev National Environmental Research Institute.
1 Spring 2003 Prof. Tim Warburton MA557/MA578/CS557 Lecture 5a.
Lecture 3.
1 EEE 431 Computational Methods in Electrodynamics Lecture 4 By Dr. Rasime Uyguroglu
IMEX Methods for Advection-Diffusion-Reaction Equations Eindhoven 2008 Speaker : Volha Shchetnikava Adviser: dr.ir.J.H.M. ten Thije Boonkkamp.
Efficient Integration of Large Stiff Systems of ODEs Using Exponential Integrators M. Tokman, M. Tokman, University of California, Merced 2 hrs 1.5 hrs.
Integration of 3-body encounter. Figure taken from
Discontinuous Galerkin Methods Li, Yang FerienAkademie 2008.
1 Computational Methods II (Elliptic) Dr. Farzad Ismail School of Aerospace and Mechanical Engineering Universiti Sains Malaysia Nibong Tebal Pulau.
Programming assignment #2 Solving a parabolic PDE using finite differences Numerical Methods for PDEs Spring 2007 Jim E. Jones.
1 Chien-Hong Cho ( 卓建宏 ) (National Chung Cheng University)( 中正大學 ) 2010/11/11 in NCKU On the finite difference approximation for hyperbolic blow-up problems.
7. Introduction to the numerical integration of PDE. As an example, we consider the following PDE with one variable; Finite difference method is one of.
Rieben IMA Poster, 05/11/ UC Davis /LLNL/ ISCR High Order Symplectic Integration Methods for Finite Element Solutions to Time Dependent Maxwell Equations.
CIS888.11V/EE894R/ME894V A Case Study in Computational Science & Engineering We will apply several numerical methods to find a steady state solution of.
16.920J/SMA 5212 Numerical Methods for PDEs Lecture 5 Finite Differences: Parabolic Problems B. C. Khoo Thanks to Franklin Tan SMA-HPC ©2002 NUS.
Data Modeling Patrice Koehl Department of Biological Sciences National University of Singapore
AUTOMATIC CONTROL THEORY II Slovak University of Technology Faculty of Material Science and Technology in Trnava.
1 Spring 2003 Prof. Tim Warburton MA557/MA578/CS557 Lecture 24.
Lecture 21-22: Sound Waves in Fluids Sound in ideal fluid Sound in real fluid. Attenuation of the sound waves 1.
Exact Differentiable Exterior Penalty for Linear Programming Olvi Mangasarian UW Madison & UCSD La Jolla Edward Wild UW Madison December 20, 2015 TexPoint.
Numerical Analysis – Differential Equation
Lecture 21 MA471 Fall 03. Recall Jacobi Smoothing We recall that the relaxed Jacobi scheme: Smooths out the highest frequency modes fastest.
Lec 7. Higher Order Systems, Stability, and Routh Stability Criteria Higher order systems Stability Routh Stability Criterion Reading: 5-4; 5-5, 5.6 (skip.
Advanced Engineering Mathematics, 7 th Edition Peter V. O’Neil © 2012 Cengage Learning Engineering. All Rights Reserved. CHAPTER 4 Series Solutions.
Ordinary Differential Equations
Finite Element Method. History Application Consider the two point boundary value problem.
1 Spring 2003 Prof. Tim Warburton MA557/MA578/CS557 Lecture 25.
1 Spring 2003 Prof. Tim Warburton MA557/MA578/CS557 Lecture 32.
1 Spring 2003 Prof. Tim Warburton MA557/MA578/CS557 Lecture 28.
Higher Order Runge-Kutta Methods for Fluid Mechanics Problems Abhishek Mishra Graduate Student, Aerospace Engineering Course Presentation MATH 6646.
Colorado Center for Astrodynamics Research The University of Colorado 1 STATISTICAL ORBIT DETERMINATION Statistical Interpretation of Least Squares ASEN.
1 Week 11 Numerical methods for ODEs 1.The basics: finite differences, meshes 2.The Euler method.
EEE 431 Computational Methods in Electrodynamics
Reporter: Prudence Chien
Lecture 4: Numerical Stability
Introduction to Numerical Methods I
Finite Volume Method for Unsteady Flows
POLYNOMIAL INTERPOLATION
5.3 Higher-Order Taylor Methods
MATH 175: Numerical Analysis II
6th Lecture : Numerical Methods
Generalized Finite Element Methods
Presentation transcript:

Jan Verwer Convergence and Component Splitting for the Crank-Nicolson Leap-Frog Scheme Hairer-60 Conference, Geneva, June 2009 TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: AAAA A

Crank-Nicolson Leap-Frog (CNLF) non-stiffstiff given Usually IMEX-Euler for CNLF:

Contents of this talk - A splitting (convergence) condition justifying a wider class of splittings than normally seen in CFD - As an example, component splitting for 1 st order Maxwell-type wave equations - Two numerical illustrations of component splitting CNLF is a two-step IMEX scheme. Used for PDEs in CFD (method of lines). Non-stiff term then represents convection and the stiff term diffusion + reactions. This talk is about an alternative use of CNLF:

Consistency of CNLF We always think of semi-discrete systems are always supposed to be derived and valid for but suppress for convenience the spatial mesh size Further, order terms like

Consistency of CNLF Just for convenience we neglect spatial errors.. Then the local truncation of CNLF satisfies if In CFD applications this splitting (convergence) condition is mostly satisfied! Denote

Consistency of CNLF For the IMEX-Euler scheme the splitting (convergence) condition features in the same way. That is, if then uniformly in the spatial mesh size

Convergence of CNLF Hence, if and assuming stability, CNLF with Euler start will converge with order two uniformly in the spatial mesh width! Q: is this common splitting (convergence) condition also necessary for 2 nd – order convergence?

(i) The common splitting condition is not necessary for 2 nd order CNLF convergence. What is the right condition? (ii) But why only 1 st order when IMEX-Euler is used to start up? Numerical counter example Semi-discrete 1 st -order wave equation, with a splitting such that is violated (splitting details later). -o- : Exact (or CN) start -*- : IMEX-Euler start 1 st order 2 nd order We let

A new splitting (convergence) condition First the linear case: Proofs rest on local error cancellation of terms that cause order reduction if is violated. The cancellation fails at the first CNLF step when IMEX-Euler is used to compute. (n) Thm. Assume stability and condition (n). Then, uniformly in h, (i)IMEX-Euler is 1st-order convergent (ii)CNLF with IMEX-Euler start is 1 st -order convergent (iii)CNLF with “exact start” is 2 nd -order convergent

A new splitting (convergence) condition The non-linear case: The new condition reads

Component splitting Discussed for linear, semi-discrete 1 st order wave equations CNLF: where with S a diagonal matrix satisfying the general ansatz

The splitting condition - However - The common splitting condition requires - The new splitting condition is to be interpreted as a discrete spatial integration which “removes” the factor Hence fails

Stability - All we can say is that - Stability analysis of IMEX methods normally requires commuting operators. However, which is not true! which regarding stability is necessary for the LF part and sufficient for the CN part in CNLF - Experience: runs are stable for the maximal stable step size for the LF part

Numerical illustration I The component splitting matrix S is chosen in the form

Illustration I (piecewise uniform grid) Splitting matrix S such that LF is applied at the coarse grid and CN at the fine grid. Factor 10 between coarse & fine grid!

Illustration I (the splitting conditions) Plots for time t = 0 1/h

Illustration I (global errors) --- : 2 nd - order -o- : CNLF with CN start -*- : CNLF with IMEX-Euler start -+- : CN Maximal step size τ = h with h the coarse grid size Global errors at t = /h CNLF with CN start gives 2 nd order The IMEX-Euler start causes order reduction !!! 1 st order

Illustration I (uniform grid, random S) --- : 2 nd order -o- : CNLF with CN start -*- : CNLF with IMEX-Euler start -+- : CN Step size τ = h Uniform grid and S randomly chosen as Results are in line with those on the non-uniform grid Global errors at t = 0.25

Illustration II 2D Maxwell type problem on unit square U(x,y,t = 0) U(x,y,t = 1)

Illustration II Strongly peaked 0.95 < d(x,y) ≤ 100. Through component splitting, we use CN near the peak (d ≥ 1) and LF else- where, to avoid the step size limitation for LF near the peak A uniform staggered grid and 2 nd order differencing with grid size h requires for LF The following results at t = 1 are obtained with CNLF for using only a very small amount of implicitly treated points

Illustration II CNLF is as accurate as CN

Illustration II nnz: number of nonzeros in linear system matrix (sparsity indicator)

Conclusions -- Component splitting tests confirm the new CNLF convergence condition -- Component splitting can be set up in the same way for 3D Maxwell -- But, how practical this is for real applications, I don’t know yet