Trees and Order Conditions

Similar documents
Transfer Functions. Convenient representation of a linear, dynamic model. A transfer function (TF) relates one input and one output: ( ) system

Numerical Solution of Ordinary Differential Equations

Difference Equations

A new Approach for Solving Linear Ordinary Differential Equations

NUMERICAL DIFFERENTIATION

Marginal Effects in Probit Models: Interpretation and Testing. 1. Interpreting Probit Coefficients

Report on Image warping

Bernoulli Numbers and Polynomials

From Biot-Savart Law to Divergence of B (1)

The Geometry of Logit and Probit

Implicit Integration Henyey Method

Effects of Ignoring Correlations When Computing Sample Chi-Square. John W. Fowler February 26, 2012

Special Relativity and Riemannian Geometry. Department of Mathematical Sciences

Key Words: Hamiltonian systems, canonical integrators, symplectic integrators, Runge-Kutta-Nyström methods.

Linear Approximation with Regularization and Moving Least Squares

Lecture 13 APPROXIMATION OF SECOMD ORDER DERIVATIVES

1 Matrix representations of canonical matrices

Consistency & Convergence

Numerical Heat and Mass Transfer

One-sided finite-difference approximations suitable for use with Richardson extrapolation

For now, let us focus on a specific model of neurons. These are simplified from reality but can achieve remarkable results.

= z 20 z n. (k 20) + 4 z k = 4

Structure and Drive Paul A. Jensen Copyright July 20, 2003

Lecture 10 Support Vector Machines II

Lecture 2: Numerical Methods for Differentiations and Integrations

Tensor Analysis. For orthogonal curvilinear coordinates, ˆ ˆ (98) Expanding the derivative, we have, ˆ. h q. . h q h q

Chapter 5. Solution of System of Linear Equations. Module No. 6. Solution of Inconsistent and Ill Conditioned Systems

6.3.4 Modified Euler s method of integration

Formal solvers of the RT equation

Modelli Clamfim Equazione del Calore Lezione ottobre 2014

Open Systems: Chemical Potential and Partial Molar Quantities Chemical Potential

PHYS 705: Classical Mechanics. Calculus of Variations II

9 Characteristic classes

2 Finite difference basics

Economics 101. Lecture 4 - Equilibrium and Efficiency

Lecture 12: Discrete Laplacian

Causal Diamonds. M. Aghili, L. Bombelli, B. Pilgrim

A New Refinement of Jacobi Method for Solution of Linear System Equations AX=b

Srednicki Chapter 34

Using T.O.M to Estimate Parameter of distributions that have not Single Exponential Family

PHYS 705: Classical Mechanics. Canonical Transformation II

Gaussian Conditional Random Field Network for Semantic Segmentation - Supplementary Material

Chapter 12. Ordinary Differential Equation Boundary Value (BV) Problems

7. Products and matrix elements

Affine and Riemannian Connections

Physics 5153 Classical Mechanics. D Alembert s Principle and The Lagrangian-1

Optimal Marketing Strategies for a Customer Data Intermediary. Technical Appendix

Salmon: Lectures on partial differential equations. Consider the general linear, second-order PDE in the form. ,x 2

Asymptotics of the Solution of a Boundary Value. Problem for One-Characteristic Differential. Equation Degenerating into a Parabolic Equation

n α j x j = 0 j=1 has a nontrivial solution. Here A is the n k matrix whose jth column is the vector for all t j=0

INTRODUCTION TO DYNARE

EEE 241: Linear Systems

ME 501A Seminar in Engineering Analysis Page 1

A Functionally Fitted 3-stage ESDIRK Method Kazufumi Ozawa Akita Prefectural University Honjo Akita , Japan

Normally, in one phase reservoir simulation we would deal with one of the following fluid systems:

Inner Product. Euclidean Space. Orthonormal Basis. Orthogonal

Maximum Likelihood Estimation of Binary Dependent Variables Models: Probit and Logit. 1. General Formulation of Binary Dependent Variables Models

ELASTIC WAVE PROPAGATION IN A CONTINUOUS MEDIUM

Convexity preserving interpolation by splines of arbitrary degree

A Hybrid Variational Iteration Method for Blasius Equation

Lecture 21: Numerical methods for pricing American type derivatives

Workshop: Approximating energies and wave functions Quantum aspects of physical chemistry

Differentiating Gaussian Processes

Homework Notes Week 7

Note 10. Modeling and Simulation of Dynamic Systems

Exercises of Chapter 2

Number of cases Number of factors Number of covariates Number of levels of factor i. Value of the dependent variable for case k

Lecture 6/7 (February 10/12, 2014) DIRAC EQUATION. The non-relativistic Schrödinger equation was obtained by noting that the Hamiltonian 2

Queens College, CUNY, Department of Computer Science Numerical Methods CSCI 361 / 761 Spring 2018 Instructor: Dr. Sateesh Mane.

arxiv: v1 [math.co] 12 Sep 2014

THE VIBRATIONS OF MOLECULES II THE CARBON DIOXIDE MOLECULE Student Instructions

C/CS/Phy191 Problem Set 3 Solutions Out: Oct 1, 2008., where ( 00. ), so the overall state of the system is ) ( ( ( ( 00 ± 11 ), Φ ± = 1

An efficient algorithm for multivariate Maclaurin Newton transformation

% & 5.3 PRACTICAL APPLICATIONS. Given system, (49) , determine the Boolean Function, , in such a way that we always have expression: " Y1 = Y2

CHAPTER 14 GENERAL PERTURBATION THEORY

NP-Completeness : Proofs

New Method for Solving Poisson Equation. on Irregular Domains

APPROXIMATE PRICES OF BASKET AND ASIAN OPTIONS DUPONT OLIVIER. Premia 14

arxiv: v1 [math.ho] 18 May 2008

LINEAR REGRESSION ANALYSIS. MODULE IX Lecture Multicollinearity

CHAPTER 5 NUMERICAL EVALUATION OF DYNAMIC RESPONSE

A NUMERICAL COMPARISON OF LANGRANGE AND KANE S METHODS OF AN ARM SEGMENT

763622S ADVANCED QUANTUM MECHANICS Solution Set 1 Spring c n a n. c n 2 = 1.

Calculus of Variations Basics

E Tail Inequalities. E.1 Markov s Inequality. Non-Lecture E: Tail Inequalities

MAE140 - Linear Circuits - Winter 16 Final, March 16, 2016

THE SUMMATION NOTATION Ʃ

IV. Performance Optimization

Canonical transformations

COMPARISON OF SOME RELIABILITY CHARACTERISTICS BETWEEN REDUNDANT SYSTEMS REQUIRING SUPPORTING UNITS FOR THEIR OPERATIONS

Finite Differences, Interpolation, and Numerical Differentiation

First day August 1, Problems and Solutions

1 Convex Optimization

Additional Codes using Finite Difference Method. 1 HJB Equation for Consumption-Saving Problem Without Uncertainty

PART 8. Partial Differential Equations PDEs

x = , so that calculated

LECTURE 9 CANONICAL CORRELATION ANALYSIS

Computation of Higher Order Moments from Two Multinomial Overdispersion Likelihood Models

12. The Hamilton-Jacobi Equation Michael Fowler

MAE140 - Linear Circuits - Fall 10 Midterm, October 28

Transcription:

Trees and Order Condtons Constructon of Runge-Kutta order condtons usng Butcher trees and seres. Paul Tranqull 1 1 Computatonal Scence Laboratory CSL) Department of Computer Scence Vrgna Tech. Trees and Order Condtons. [1/14] Dfferental Equatons group.

The general process for constructng order condtons s to: Construct a truncated Taylor expanson of the exact soluton comng from y = fy). Construct a truncated Taylor expanson of the numercal soluton comng from the general form of the Runge-Kutta ntegrator. Match terms n each expanson up to the specfed order p.. Order Condtons. [2/14] Dfferental Equatons group.

Start wth and y = fy) yt n + h) = yt n ) + hy t n ) + h2 2! y t n ) +... Note that each term s comprsed of a dervatve of y evaluated at t = t n,.e. when h = 0), a power of h, and a constant coeffcent. Snce the power of h and the constant coeffcent are easy to generalze, we wll loo at how to construct the terms whch come from the dervatves of y.. Order Condtons. Exact Soluton [3/14] Dfferental Equatons group.

For the scalar case we have that y = y y = fy) y = f y) y = f f y = f y) y y + f y) f y) y however, n our case y s a vector. So we use the notaton that captal superscrpts represent the ndex of the vector. Moreover, the appearance of a subscrpt represents a dervatve and the letter s the ndex of that dervatve. In ths way f K s the element, K) of the acoban matrx of f, and f KL s element, K, L) of the Hessan. We wll also mae use of ensten notaton, so that repeated ndces are summed over the range of that ndex. So that c x = 3 c x = c 1 x 1 + c 2 x 2 + c 3 x 3 =1. Order Condtons. Exact Soluton [4/14] Dfferental Equatons group.

Now we can construct each of the terms appearng n the taylor expanson of the exact soluton yt n + h) as ) y 0) h=0 ) y 1) h=0 y ) 1) h=0 ) y 2) h=0 y ) 2) h=0 y ) 2) h=0 ) y 3) h=0 y ) 3) h=0 ) y 3) h=0 = y = f y) ) 0) h=0 = f = f y) ) 1) h=0 = fk y) y K) ) 1) h=0 = f K f K = f y) ) 2) h=0 = f ) KL y K 1) ) y L 1) ) ) + f K y K 2) h=0 = f KL f K f L + f K f K L f L. Order Condtons. Exact Soluton [5/14] Dfferental Equatons group.

Collectng only the fnal results we have that up to thrd order, we have that ) y 0) h=0 ) y 1) h=0 ) y 2) h=0 ) y 3) h=0 = y = f = fk f K = fkl f K f L + fk f L Kf L are the terms, along wth the correspondng power of h and Taylor coeffcent, comprsng the Taylor seres expanson of the exact soluton.. Order Condtons. Exact Soluton [6/14] Dfferental Equatons group.

We can now represent the terms n the taylor seres usng labeled trees. l l f b = 1 fk f K b a = 1/2 fkl f K f L b a a l = 1/3 fk f L Kf L b a a l = 1/6 Where the rghtmost column comes from matchng the exact and numercal whch we wll derve later) expansons.. Order Condtons. Exact Soluton [7/14] Dfferental Equatons group.

For the elementary dfferentals superscrpts represent component ndces, and subscrpts represent ndces of varables wth respect to whch partal dervatves are taen. For example, f s the -th component of f, and f K f K = K f / y K f K. A node represents a dervatve of f. The order of the f dervatve equals the number of chldren the node has.. Order Condtons. Exact Soluton [8/14] Dfferental Equatons group.

Numercal Expanson Recall that an s-stage Runge-Kutta method has the general form = hfy n + a ) y n+1 = y n + b We wll construct the ndvdual terms n the expanson of the numercal soluton by expandng each stage value,, and then addng them together n the end. We wll mae heavy use of the formula hφh)) q) h=0 = q φh)) q 1) h=0. Numercal Soluton. [9/14] Dfferental Equatons group.

) 0) ) 1) ) 1) ) 2) ) 2) ) 2) ) 2) = 0 = hf y n + 1) a )) = f = hf y n + 2) a )) = 2f y n + 1) a )) ) 1) = 2fK a = 2 a f K f K h=0 h=0 h=0 h=0. Numercal Soluton. [10/14] Dfferental Equatons group.

) 3) ) 3) ) 3) = 3f y n + 2) a )) h=0 ) 1) = 3fKL a K a ) L 1) ) 2) +3fK a K h=0 = 3 a a fkl f K f L + 6a a fk f L Kf L. Numercal Soluton. [11/14] Dfferental Equatons group.

Note that each dervatve of recurses onto the prevous dervatves. We wll mae use of ths fact to generalze the constructon of the coeffcents from the tree structure. Collectng only the fnal results we have that ) 0) ) 1) ) 2) ) 3) = 0 = f = 2 a fk f K = 3 a a fkl f K f L + 6a a fk f L Kf L. Numercal Soluton. [12/14] Dfferental Equatons group.

We have now constructed the general set of condtons up to order three. l l f b = 1 fk f K b a = 1/2 fkl f K f L b a a l = 1/3 fk f L Kf L b a a l = 1/6 Generalzng to a hgher order requres some extra wor, however.. Numercal Soluton. [13/14] Dfferental Equatons group.

We can now phrase the order condtons n the followng way Theorem A Runge-Kutta method s of order p ff s =1 b φ τ) = 1 γτ) wth 1 f τ = [ ] φ τ) = a,m φ 1 τ 1 )... φ m τ m ) f τ = [τ 1,... τ m ] 1,..., m where [τ 1,..., τ m ] s a tree wth ts root havng chldren as the root of the subtrees τ 1,..., τ m, and γτ) s defned fully n the text.. Numercal Soluton. [14/14] Dfferental Equatons group.