Interval Methods and Taylor Model Methods for ODEs

Size: px
Start display at page:

Download "Interval Methods and Taylor Model Methods for ODEs"

Transcription

1 Interval Methods and Taylor Model Methods for ODEs Markus Neher, Dept. of Mathematics KARLSRUHE INSTITUTE OF TECHNOLOGY (KIT) 0 TM VII, Key West KIT University of the State of Baden-Wuerttemberg and Interval Methods and Taylor Model Methods for ODEs Markus Neher, KIT National Research Center of the Helmholtz Association

2 Validated Methods Also called: Verified Methods, Rigorous Methods, Guaranteed Methods, Enclosure Methods,... Aim: Compute guaranteed bounds for the solution of a problem, including Discretization errors (ODEs, PDEs, optimization) Truncation errors (Newton s method, summation) Roundoff errors Used for Modelling of uncertain data Bounding of roundoff errors 1 TM VII, Key West Interval Methods and Taylor Model Methods for ODEs Markus Neher, KIT

3 Outline 1 Interval arithmetic 2 Interval methods for ODEs 3 Taylor model methods for ODEs 2 TM VII, Key West Interval Methods and Taylor Model Methods for ODEs Markus Neher, KIT

4 Interval Arithmetic 3 TM VII, Key West Interval Methods and Taylor Model Methods for ODEs Markus Neher, KIT

5 Interval Arithmetic Compact real intervals: IR = {x = [x, x] x x} (x, x R). Basic arithmetic operations: x y := {x y x x, y y}, {+,,, /} (0 y for /) x + y = [x + y, x + y] x y = [x y, x y] x y = [min{xy, xy, xy, xy, }, max{xy, xy, xy, xy, }], x / y = x [1 / y, 1 / y] 4 TM VII, Key West Interval Methods and Taylor Model Methods for ODEs Markus Neher, KIT

6 Interval Arithmetic Compact real intervals: IR = {x = [x, x] x x} (x, x R). Basic arithmetic operations: x y := {x y x x, y y}, {+,,, /} (0 y for /) x + y = [x + y, x + y] x y = [x y, x y] [0, 1] [0, 1] = [ 1, 1] x y = [min{xy, xy, xy, xy, }, max{xy, xy, xy, xy, }], x / y = x [1 / y, 1 / y] 4 TM VII, Key West Interval Methods and Taylor Model Methods for ODEs Markus Neher, KIT

7 Interval Arithmetic Compact real intervals: IR = {x = [x, x] x x} (x, x R). Basic arithmetic operations: x y := {x y x x, y y}, {+,,, /} (0 y for /) x + y = [x + y, x + y] FPIA : [ x + y, x + y ] x y = [x y, x y] [0, 1] [0, 1] = [ 1, 1] x y = [min{xy, xy, xy, xy, }, max{xy, xy, xy, xy, }], x / y = x [1 / y, 1 / y] 4 TM VII, Key West Interval Methods and Taylor Model Methods for ODEs Markus Neher, KIT

8 Ranges and Inclusion Functions Range of f : D E: Rg (f, D) := {f (x) x D} Inclusion function F : IR IR of f : D R R: Examples: F(x) Rg (f, x) for all x D x 1 + x, 1 1, are inclusion functions for 1 + x f (x) = x 1 + x = x e x := [e x, e x ] is an inclusion function for e x 5 TM VII, Key West Interval Methods and Taylor Model Methods for ODEs Markus Neher, KIT

9 IA: Dependency f (x) = x 1 + x x 1 + x = 1 1, x = [1, 2]: 1 + x = [1, 2] [2, 3] = [ 1 3, 1] x = 1 1 [2, 3] = 1 [ 1 3, 1 2 ] = [ 1 2, 2 ] = Rg (f, x) 3 Reduced overestimation: centered forms, etc. Mean value form: Rg (f, x) f (c) + F (x)(x c), c = m(x). 6 TM VII, Key West Interval Methods and Taylor Model Methods for ODEs Markus Neher, KIT

10 IA: Wrapping Effect Overestimation: Enclose non-interval shaped sets by intervals 2 Example: f : (x, y) (x + y, y x) (Rotation) 2 Interval evaluation of f on x = ([ 1, 1], [ 1, 1]): y x 7 TM VII, Key West Interval Methods and Taylor Model Methods for ODEs Markus Neher, KIT

11 IA: Wrapping Effect Overestimation: Enclose non-interval shaped sets by intervals 2 Example: f : (x, y) (x + y, y x) (Rotation) 2 Interval evaluation of f on x = ([ 1, 1], [ 1, 1]): y y x x TM VII, Key West Interval Methods and Taylor Model Methods for ODEs Markus Neher, KIT

12 Interval Methods for ODEs 8 TM VII, Key West Interval Methods and Taylor Model Methods for ODEs Markus Neher, KIT

13 Validated Integration of ODEs Interval IVP: u = f (t, u), u(t 0 ) = u 0 u 0, t t = [t 0, t end ] f : R R m R m sufficiently smooth, u 0 IR m, t end > t 0. 9 TM VII, Key West Interval Methods and Taylor Model Methods for ODEs Markus Neher, KIT

14 Validated Integration of ODEs Interval IVP: u = f (t, u), u(t 0 ) = u 0 u 0, t t = [t 0, t end ] f : R R m R m sufficiently smooth, u 0 IR m, t end > t 0. 9 TM VII, Key West Interval Methods and Taylor Model Methods for ODEs Markus Neher, KIT

15 Validated Integration of ODEs Interval IVP: u = f (t, u), u(t 0 ) = u 0 u 0, t t = [t 0, t end ] f : R R m R m sufficiently smooth, u 0 IR m, t end > t 0. 9 TM VII, Key West Interval Methods and Taylor Model Methods for ODEs Markus Neher, KIT

16 Validated Integration of ODEs Interval IVP: u = f (t, u), u(t 0 ) = u 0 u 0, t t = [t 0, t end ] f : R R m R m sufficiently smooth, u 0 IR m, t end > t 0. 9 TM VII, Key West Interval Methods and Taylor Model Methods for ODEs Markus Neher, KIT

17 Validated Integration of ODEs Interval IVP: u = f (t, u), u(t 0 ) = u 0 u 0, t t = [t 0, t end ] f : R R m R m sufficiently smooth, u 0 IR m, t end > t 0. 9 TM VII, Key West Interval Methods and Taylor Model Methods for ODEs Markus Neher, KIT

18 Validated Integration of ODEs Interval IVP: u = f (t, u), u(t 0 ) = u 0 u 0, t t = [t 0, t end ] f : R R m R m sufficiently smooth, u 0 IR m, t end > t 0. 9 TM VII, Key West Interval Methods and Taylor Model Methods for ODEs Markus Neher, KIT

19 Validated Integration of ODEs Interval IVP: u = f (t, u), u(t 0 ) = u 0 u 0, t t = [t 0, t end ] f : R R m R m sufficiently smooth, u 0 IR m, t end > t 0. 9 TM VII, Key West Interval Methods and Taylor Model Methods for ODEs Markus Neher, KIT

20 Validated Integration of ODEs Interval IVP: u = f (t, u), u(t 0 ) = u 0 u 0, t t = [t 0, t end ] f : R R m R m sufficiently smooth, u 0 IR m, t end > t 0. 9 TM VII, Key West Interval Methods and Taylor Model Methods for ODEs Markus Neher, KIT

21 Validated Integration of ODEs Interval IVP: u = f (t, u), u(t 0 ) = u 0 u 0, t t = [t 0, t end ] f : R R m R m sufficiently smooth, u 0 IR m, t end > t 0. 9 TM VII, Key West Interval Methods and Taylor Model Methods for ODEs Markus Neher, KIT

22 Validated Integration of ODEs Interval IVP: u = f (t, u), u(t 0 ) = u 0 u 0, t t = [t 0, t end ] f : R R m R m sufficiently smooth, u 0 IR m, t end > t 0. 9 TM VII, Key West Interval Methods and Taylor Model Methods for ODEs Markus Neher, KIT

23 Validated Integration of ODEs Interval IVP: u = f (t, u), u(t 0 ) = u 0 u 0, t t = [t 0, t end ] f : R R m R m sufficiently smooth, u 0 IR m, t end > t 0. 9 TM VII, Key West Interval Methods and Taylor Model Methods for ODEs Markus Neher, KIT

24 Validated Integration of ODEs Interval IVP: u = f (t, u), u(t 0 ) = u 0 u 0, t t = [t 0, t end ] f : R R m R m sufficiently smooth, u 0 IR m, t end > t 0. 9 TM VII, Key West Interval Methods and Taylor Model Methods for ODEs Markus Neher, KIT

25 Validated Integration of ODEs Interval IVP: u = f (t, u), u(t 0 ) = u 0 u 0, t t = [t 0, t end ] f : R R m R m sufficiently smooth, u 0 IR m, t end > t 0. 9 TM VII, Key West Interval Methods and Taylor Model Methods for ODEs Markus Neher, KIT

26 Autonomous Interval IVP u = f (u), u(t 0 ) = u 0 u 0, t t = [t 0, t end ], where D R m, f C n (D), f : D R m, u 0 IR m. Moore s enclosure method: Automatic computation of Taylor coefficients Interval iteration: For j = 1, 2,... : A priori enclosure: v j u(t) for all t [t j 1, t j ] ("Alg. I"). Truncation error: z j := hn+1 j (n + 1)! f (n) (v j ). u(t j ) u j := u j 1 + n k=1 h k j k! f (k 1) (u j 1 ) + z j ("Algorithm II"). 10 TM VII, Key West Interval Methods and Taylor Model Methods for ODEs Markus Neher, KIT

27 Piecewise Constant A Priori Enclosure u v 1 v 2 u 0 u 1 u 2 t 0 t 1 t 2 t 11 TM VII, Key West Interval Methods and Taylor Model Methods for ODEs Markus Neher, KIT

28 A Priori Enclosures Picard iteration: find h j, v j such that u j 1 + [0, h j ]f (v j ) v j Step size restrictions: Explicit Euler steps Improvements: Lohner 1988, Corliss & Rihm 1996, Makino 1998, Nedialkov & Jackson 2001 Alternatives: Neumaier 1994, N. 1999, N. 2007, Delanoue & Jaulin 2010, Kin, Kim & Nakao TM VII, Key West Interval Methods and Taylor Model Methods for ODEs Markus Neher, KIT

29 Modifications of Algorithm II Reduction of wrapping effect: Moore, Eijgenraam, Lohner, Rihm, Kuehn, Nedialkov & Jackson,... Nedialkov & Jackson: Hermite-Obreshkov-Method Rihm: Implicit methods Petras & Hartmann, Bouissou: Runge-Kutta-Methods Berz & Makino: Taylor models Taylor expansion of solution w.r.t. time and initial values 13 TM VII, Key West Interval Methods and Taylor Model Methods for ODEs Markus Neher, KIT

30 Direct Interval Method Direct method (Moore 1965): Apply mean value form to f (k) : ( ) f [0] (u) = u, f [k] (u) = 1 k f [k 1] u f (u) for k 1. Let S j 1 = I + n k=1 h k 0 J( f [k] (u j 1 ) ), z j = h n+1 0 f [n] (v j ), (I: identity matrix, J ( f [k]) : Jacobian of f [i] ), then for some û j 1 u j 1 n 1 u(t j ; u 0 ) u j = û j 1 + hj k f [k] (û j 1 ) + z j + S j 1 (u j 1 û j 1 ). k=1 14 TM VII, Key West Interval Methods and Taylor Model Methods for ODEs Markus Neher, KIT

31 Global Error Propagation Wrapping effect: S j 1 (u j 1 û j 1 ) may overestimate S = {S j 1 (u j 1 û j 1 ) S j 1 S j 1, u j 1 u j 1 } propagate S as a parallelepiped. û 0 := m(u 0 ), r 0 = u 0 û 0, B 0 = I; for some nonsingular B j 1 : n 1 û j = û j 1 + hj 1 k f [k] (û j 1 ) + m(z j ), u j = û j 1 + k=1 n 1 k=1 h k j 1 f [k] (û j 1 ) + z j + (S j 1 B j 1 )r j 1, û j : approximate point solution for the central IVP z j : local error; r j : global error 15 TM VII, Key West Interval Methods and Taylor Model Methods for ODEs Markus Neher, KIT

32 Global Error Propagation Global error propagation: ( ) r j = B 1 j (S j 1 B j 1 ) r j 1 + B 1 j (z j m(z j )) Moore s direct method: B j = I Pep method (Eijgenraam, Lohner): B j = m(s j 1 B j 1 ) QR method (Lohner): m(s j 1 B j 1 ) = QR, B j := Q Blunting method (Berz, Makino): modify B j in the pep method such that condition numbers remain small 16 TM VII, Key West Interval Methods and Taylor Model Methods for ODEs Markus Neher, KIT

33 Autonomous Linear ODE Autonomous linear system (A R m m ): u = A u, u(0) u 0. Propagation of the Global Error r j = (B 1 j TB j 1 )r j 1 + B 1 ( zj m(z j ) ), T = j n 1 ν=0 (ha) ν. ν! + = 17 TM VII, Key West Interval Methods and Taylor Model Methods for ODEs Markus Neher, KIT

34 Interval Methods for Linear ODEs Direct method: r j = T r j 1 + z j m(z j ). Optimal for local error, bad for global error (rotation) Parallelepiped method: r j = r j 1 + (T j )(z j (m(z j )). Optimal for global error; suitable for local error, if cond(t j ) is small Bad for local error in presence of shear QR method: r j = R j r j 1 + Qj T ( zj m(z j ) ), j = 1, 2,.... Handles rotation, contraction, shear 18 TM VII, Key West Interval Methods and Taylor Model Methods for ODEs Markus Neher, KIT

35 Wrapping Effect: Direct Interval Method (Plots by Ned Nedialkov) Huge overestimations in general 19 TM VII, Key West Interval Methods and Taylor Model Methods for ODEs Markus Neher, KIT

36 Wrapping Effect: Parallelepiped Method B j = TB j 1 3 x x { C j r +e r r j 1, e e j } { C j r r r j 1 } 4 { C j r +e r r j 1, e e j } { C j r r r j 1 } { C 3 j r r r j } x { C j r r r j } x B j often ill-conditioned, large overestimations 20 TM VII, Key West Interval Methods and Taylor Model Methods for ODEs Markus Neher, KIT

37 Wrapping Effect: QR Method B j = Q j, Q j R j = TB j 1 x x { C j r +e r r j 1, e e j } 1.5 { C j r +e r r j 1, e e j } 3 { C j r r r j 1 } 2 { C j r r r j 1 } 4 QR, Version 1 QR, Version QR, Version 1 QR, Version x x Overestimation depends on column permutations of B j 1 21 TM VII, Key West Interval Methods and Taylor Model Methods for ODEs Markus Neher, KIT

38 Taylor Model Methods for ODEs 22 TM VII, Key West Interval Methods and Taylor Model Methods for ODEs Markus Neher, KIT

39 Taylor Models (I) x R m, f : x R, f C n+1, x 0 x; f (x) = p n,f (x x 0 ) + R n,f (x x 0 ), x x (p n,f Taylor polynomial, R n,f remainder term) Interval remainder bound of order n of f on x: x x : R n,f (x x 0 ) i n,f Taylor model T n,f = (p n,f, i n,f ) of order n of f : x x: f (x) p n,f (x x 0 ) + i n,f 23 TM VII, Key West Interval Methods and Taylor Model Methods for ODEs Markus Neher, KIT

40 Taylor Models (II) Taylor model: U := p n (x) + i, x x, x IR m, i IR m (p n : vector of m-variate polynomials of order n) Function set: U = {f C 0 (x) : f (x) p n (x) + i for all x x } Range of a TM: Rg (U) = {z = p(x) + ξ x x, ξ i} R m ( ) x Ex.: U := x1 2 + x, x 1, x 2 [ 1, 1] 2 x 2 Rg (U): x 1 24 TM VII, Key West Interval Methods and Taylor Model Methods for ODEs Markus Neher, KIT

41 TM Arithmetic Paradigm for TMA: p n,f is processed symbolically to order n Higher order terms are enclosed into the remainder interval of the result Taylor Model Methods for ODEs Taylor expansion of solution w.r.t. time and initial values Computation of Taylor coefficients by Picard iteration: Parameters describing initial set treated symbolically Interval remainder bounds by fixed point iteration (Makino, 1998) 25 TM VII, Key West Interval Methods and Taylor Model Methods for ODEs Markus Neher, KIT

42 Example: Quadratic Problem u = v, u(0) [0.95, 1.05], v = u 2, v(0) [ 1.05, 0.95]. Taylor model method: initial set described by parameters a and b: u 0 (a, b) := 1 + a, a a := [ 0.05, 0.05], v 0 (a, b) := 1 + b, b b := [ 0.05, 0.05]. 26 TM VII, Key West Interval Methods and Taylor Model Methods for ODEs Markus Neher, KIT

43 3rd order TM Method: Enclosure of the Flow h = 0.1, flow for τ [0, 0.1]: Ũ 1 (τ, a, b) := 1 + a τ + bτ τ2 + aτ τ3 + i 0, Ṽ 1 (τ, a, b) := 1 + b + τ + 2aτ τ 2 + a 2 τ aτ 2 + bτ τ3 + j 0. Flow at t 1 = 0.1: U 1 (a, b) := Ũ 1 (0.1, a, b) = a + 0.1b + i 0, V 1 (a, b) := Ṽ 1 (0.1, a, b) = a b + 0.1a 2 + j 0 (nonlinear boundary). 27 TM VII, Key West Interval Methods and Taylor Model Methods for ODEs Markus Neher, KIT

44 Naive TM Method Interval remainder terms accumulate Linear ODEs: Naive TM method performs similarly to the direct interval method Shrink wrapping, preconditioned TM methods 28 TM VII, Key West Interval Methods and Taylor Model Methods for ODEs Markus Neher, KIT

45 Shrink Wrapping Absorb interval term into polynomial part (Makino and Berz 2002): ( U V ) (white) vs. ( Usw V sw ). Linear ODEs: Shrink wrapping performs similarly to the pep method. 29 TM VII, Key West Interval Methods and Taylor Model Methods for ODEs Markus Neher, KIT

46 Integration with Preconditioned Taylor Models Preconditioned integration: flow at t j : U j = U l,j U r,j = (p l,j + i l,j ) (p r,j + i r,j ). Purpose: stabilize integration as in the QR interval method Theorem (Makino and Berz 2004) If the initial set of an IVP is given by a preconditioned Taylor model, then integrating the flow of the ODE only acts on the left Taylor model. 30 TM VII, Key West Interval Methods and Taylor Model Methods for ODEs Markus Neher, KIT

47 Preconditioned TMM for linear ODE Global error: i r,j+1 := C 1 l,j+1 TC l,j i r,j + C 1 l,j+1 i l,j+1, j = 0, 1,.... C l,j+1 = TC l,j : C l,j+1 = Q j : parallelepiped preconditioning QR preconditioning Other choices: curvilinear coordinates, blunting (Makino and Berz 2004) 31 TM VII, Key West Interval Methods and Taylor Model Methods for ODEs Markus Neher, KIT

48 Integration of Quadratic Problem u = v, u(0) [0.95, 1.05], v = u 2, v(0) [ 1.05, 0.95] COSY Infinity AWA 32 TM VII, Key West Interval Methods and Taylor Model Methods for ODEs Markus Neher, KIT

49 Summary Interval arithmetic Interval methods for ODEs Taylor model methods for ODEs Open problems Treatment of high-dimensional problems Validated implicit methods 33 TM VII, Key West Interval Methods and Taylor Model Methods for ODEs Markus Neher, KIT

ON TAYLOR MODEL BASED INTEGRATION OF ODES

ON TAYLOR MODEL BASED INTEGRATION OF ODES ON TAYLOR MODEL BASED INTEGRATION OF ODES M. NEHER, K. R. JACKSON, AND N. S. NEDIALKOV Abstract. Interval methods for verified integration of initial value problems (IVPs for ODEs have been used for more

More information

Validated Solutions of Initial Value Problems for Parametric ODEs

Validated Solutions of Initial Value Problems for Parametric ODEs Validated Solutions of Initial Value Problems for Parametric ODEs Youdong Lin and Mark A. Stadtherr Department of Chemical and Biomolecular Engineering University of Notre Dame, Notre Dame, IN 46556, USA

More information

Deterministic Global Optimization for Dynamic Systems Using Interval Analysis

Deterministic Global Optimization for Dynamic Systems Using Interval Analysis Deterministic Global Optimization for Dynamic Systems Using Interval Analysis Youdong Lin and Mark A. Stadtherr Department of Chemical and Biomolecular Engineering University of Notre Dame, Notre Dame,

More information

AN INTERVAL METHOD FOR INITIAL VALUE PROBLEMS IN LINEAR ORDINARY DIFFERENTIAL EQUATIONS

AN INTERVAL METHOD FOR INITIAL VALUE PROBLEMS IN LINEAR ORDINARY DIFFERENTIAL EQUATIONS AN INTERVAL METHOD FOR INITIAL VALUE PROBLEMS IN LINEAR ORDINARY DIFFERENTIAL EQUATIONS NEDIALKO S. NEDIALKOV Abstract. Interval numerical methods for initial value problems (IVPs) for ordinary differential

More information

Validated Explicit and Implicit Runge-Kutta Methods

Validated Explicit and Implicit Runge-Kutta Methods Validated Explicit and Implicit Runge-Kutta Methods Alexandre Chapoutot joint work with Julien Alexandre dit Sandretto and Olivier Mullier U2IS, ENSTA ParisTech 8th Small Workshop on Interval Methods,

More information

Propagation of Uncertainties in Nonlinear Dynamic Models

Propagation of Uncertainties in Nonlinear Dynamic Models Propagation of Uncertainties in Nonlinear Dynamic Models Youdong Lin 1, Scott Ferson 2, George F. Corliss 3 and Mark A. Stadtherr 1 1 Department of Chemical and Biomolecular Engineering, University of

More information

SUPPRESSION OF THE WRAPPING EFFECT BY TAYLOR MODEL- BASED VERIFIED INTEGRATORS: LONG-TERM STABILIZATION BY PRECONDITIONING

SUPPRESSION OF THE WRAPPING EFFECT BY TAYLOR MODEL- BASED VERIFIED INTEGRATORS: LONG-TERM STABILIZATION BY PRECONDITIONING International Journal of Differential Equations and Applications Volume 0 No. 0 2006, 1-36 SUPPRESSION OF THE WRAPPING EFFECT BY TAYLOR MODEL- BASED VERIFIED INTEGRATORS: LONG-TERM STABILIZATION BY PRECONDITIONING

More information

Enclosing All Solutions of Two-Point Boundary Value Problems for ODEs

Enclosing All Solutions of Two-Point Boundary Value Problems for ODEs Enclosing All Solutions of Two-Point Boundary Value Problems for ODEs Youdong Lin, Joshua A. Enszer, and Mark A. Stadtherr 1 Department of Chemical and Biomolecular Engineering University of Notre Dame,

More information

An Introduction to Differential Algebra

An Introduction to Differential Algebra An Introduction to Differential Algebra Alexander Wittig1, P. Di Lizia, R. Armellin, et al. 1 ESA Advanced Concepts Team (TEC-SF) SRL, Milan Dinamica Outline 1 Overview Five Views of Differential Algebra

More information

A Rigorous Implementation of Taylor Model-Based Integrator in Chebyshev Basis Representation 1

A Rigorous Implementation of Taylor Model-Based Integrator in Chebyshev Basis Representation 1 A Rigorous Implementation of Taylor Model-Based Integrator in Chebyshev Basis Representation 1 Tomáš Dzetkulič Institute of Computer Science Czech Academy of Sciences December 15, 2011 1 This work was

More information

Geometric Series Bounds for the Local Errors of Taylor Methods for Linear n-th Order ODEs

Geometric Series Bounds for the Local Errors of Taylor Methods for Linear n-th Order ODEs Appeared in: Alefeld, G., Rohn, J., Rump, S., Yamamoto, T. (eds): Symbolic Algebraic Methods and Verification Methods, pp. 183 193. Springer, Wien, 2001. Geometric Series Bounds for the Local Errors of

More information

High-Order Representation of Poincaré Maps

High-Order Representation of Poincaré Maps High-Order Representation of Poincaré Maps Johannes Grote, Martin Berz, and Kyoko Makino Department of Physics and Astronomy, Michigan State University, East Lansing, MI, USA. {grotejoh,berz,makino}@msu.edu

More information

VERIFIED SOLUTION OF NONLINEAR DYNAMIC MODELS IN EPIDEMIOLOGY

VERIFIED SOLUTION OF NONLINEAR DYNAMIC MODELS IN EPIDEMIOLOGY Int. J. Appl. Math. Comput. Sci.,, Vol., No., DOI: VERIFIED SOLUTION OF NONLINEAR DYNAMIC MODELS IN EPIDEMIOLOGY JOSHUA A. ENSZER, MARK A. STADTHERR Department of Chemical and Biomolecular Engineering

More information

Second Order ODEs. CSCC51H- Numerical Approx, Int and ODEs p.130/177

Second Order ODEs. CSCC51H- Numerical Approx, Int and ODEs p.130/177 Second Order ODEs Often physical or biological systems are best described by second or higher-order ODEs. That is, second or higher order derivatives appear in the mathematical model of the system. For

More information

Computing validated solutions of implicit differential equations

Computing validated solutions of implicit differential equations Advances in Computational Mathematics 19: 231 253, 2003. 2003 Kluwer Academic Publishers. Printed in the Netherlands. Computing validated solutions of implicit differential equations Jens Hoefkens a, Martin

More information

Deterministic Global Optimization of Nonlinear Dynamic Systems

Deterministic Global Optimization of Nonlinear Dynamic Systems Deterministic Global Optimization of Nonlinear Dynamic Systems Youdong Lin and Mark A. Stadtherr Department of Chemical and Biomolecular Engineering University of Notre Dame, Notre Dame, IN 46556, USA

More information

Application of Taylor Models to the Worst-Case Analysis of Stripline Interconnects

Application of Taylor Models to the Worst-Case Analysis of Stripline Interconnects Application of Taylor Models to the Worst-Case Analysis of Stripline Interconnects Paolo Manfredi, Riccardo Trinchero, Igor Stievano, Flavio Canavero Email: paolo.manfredi@ugent.be riccardo.trinchero@to.infn.it,

More information

Guaranteed State and Parameter Estimation for Nonlinear Continuous-Time Systems with Bounded-Error Measurements

Guaranteed State and Parameter Estimation for Nonlinear Continuous-Time Systems with Bounded-Error Measurements Guaranteed State and Parameter Estimation for Nonlinear Continuous-Time Systems with Bounded-Error Measurements Youdong Lin and Mark A. Stadtherr Department of Chemical and Biomolecular Engineering University

More information

Validating an A Priori Enclosure Using. High-Order Taylor Series. George F. Corliss and Robert Rihm. Abstract

Validating an A Priori Enclosure Using. High-Order Taylor Series. George F. Corliss and Robert Rihm. Abstract Validating an A Priori Enclosure Using High-Order Taylor Series George F. Corliss and Robert Rihm Abstract We use Taylor series plus an enclosure of the remainder term to validate the existence of a unique

More information

CONSISTENCY TECHNIQUES FOR SIMULATION OF WASTEWATER TREATMENT PROCESSES WITH UNCERTAINTIES

CONSISTENCY TECHNIQUES FOR SIMULATION OF WASTEWATER TREATMENT PROCESSES WITH UNCERTAINTIES CONSISTENCY TECHNIQUES FOR SIMULATION OF WASTEWATER TREATMENT PROCESSES WITH UNCERTAINTIES Marco Kletting Andreas Rauh Harald Aschemann Eberhard P. Hofer University of Ulm Department of Measurement, Control,

More information

Euler s Method applied to the control of switched systems

Euler 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 information

Verified Global Optimization with Taylor Model based Range Bounders

Verified Global Optimization with Taylor Model based Range Bounders Verified Global Optimization with Taylor Model based Range Bounders KYOKO MAKINO and MARTIN BERZ Department of Physics and Astronomy Michigan State University East Lansing, MI 88 USA makino@msu.edu, berz@msu.edu

More information

Applied Math for Engineers

Applied 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 information

VERIFIED HIGH-ORDER INTEGRATION OF DAES AND HIGHER-ORDER ODES

VERIFIED HIGH-ORDER INTEGRATION OF DAES AND HIGHER-ORDER ODES VERIFIED HIGH-ORDER INTEGRATION OF DAES AND HIGHER-ORDER ODES Jens Hoefkens Martin Berz Kyoko Makino Department of Physics and Astronomy and National Superconducting Cyclotron Laboratory Michigan State

More information

Two-Point Boundary Value Problem and Optimal Feedback Control based on Differential Algebra

Two-Point Boundary Value Problem and Optimal Feedback Control based on Differential Algebra Two-Point Boundary Value Problem and Optimal Feedback Control based on Differential Algebra Politecnico di Milano Department of Aerospace Engineering Milan, Italy Taylor Methods and Computer Assisted Proofs

More information

An Improved Taylor-Bernstein Form for Higher Order Convergence

An Improved Taylor-Bernstein Form for Higher Order Convergence An Improved Taylor-Bernstein Form for Higher Order Convergence P. S. V. Nataraj, IIT Bombay Talk at the Mini-workshop on Taylor Model Methods and Applications Miami, Florida, USA. Dec. 16th - 20th, 2002

More information

Euler s Method, cont d

Euler s Method, cont d Jim Lambers MAT 461/561 Spring Semester 009-10 Lecture 3 Notes These notes correspond to Sections 5. and 5.4 in the text. Euler s Method, cont d We conclude our discussion of Euler s method with an example

More information

Consistency and Convergence

Consistency 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 information

ON THE EXPONENTIATION OF INTERVAL MATRICES

ON THE EXPONENTIATION OF INTERVAL MATRICES ON THE EXPONENTIATION OF INTERVAL MATRICES ALEXANDRE GOLDSZTEJN AND ARNOLD NEUMAIER Abstract. The numerical computation of the exponentiation of a real matrix has been studied intensively. The main objective

More information

NUMERICAL SOLUTION OF ODE IVPs. Overview

NUMERICAL 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 information

2tdt 1 y = t2 + C y = which implies C = 1 and the solution is y = 1

2tdt 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 information

Review Higher Order methods Multistep methods Summary HIGHER ORDER METHODS. P.V. Johnson. School of Mathematics. Semester

Review 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 information

Exam 2. Average: 85.6 Median: 87.0 Maximum: Minimum: 55.0 Standard Deviation: Numerical Methods Fall 2011 Lecture 20

Exam 2. Average: 85.6 Median: 87.0 Maximum: Minimum: 55.0 Standard Deviation: Numerical Methods Fall 2011 Lecture 20 Exam 2 Average: 85.6 Median: 87.0 Maximum: 100.0 Minimum: 55.0 Standard Deviation: 10.42 Fall 2011 1 Today s class Multiple Variable Linear Regression Polynomial Interpolation Lagrange Interpolation Newton

More information

Computation of Interval Extensions Using Berz-Taylor Polynomial Models

Computation of Interval Extensions Using Berz-Taylor Polynomial Models Computation of Interval Extensions Using Berz-Taylor Polynomial Models Hongkun Liang and Mark A. Stadtherr Λ Department of Chemical Engineering University of Notre Dame Notre Dame, IN 46556 USA AIChE Annual

More information

Value Problem for an Ordinary Differential Equation. Nedialko Stoyanov Nedialkov. A thesis submitted in conformity with the requirements

Value Problem for an Ordinary Differential Equation. Nedialko Stoyanov Nedialkov. A thesis submitted in conformity with the requirements Computing Rigorous Bounds on the Solution of an Initial Value Problem for an Ordinary Differential Equation by Nedialko Stoyanov Nedialkov A thesis submitted in conformity with the requirements for the

More information

Chapter 8. Numerical Solution of Ordinary Differential Equations. Module No. 1. Runge-Kutta Methods

Chapter 8. Numerical Solution of Ordinary Differential Equations. Module No. 1. Runge-Kutta Methods Numerical Analysis by Dr. Anita Pal Assistant Professor Department of Mathematics National Institute of Technology Durgapur Durgapur-71309 email: anita.buie@gmail.com 1 . Chapter 8 Numerical Solution of

More information

Taylor Model Range Bounding Schemes

Taylor Model Range Bounding Schemes Taylor Model Range Bounding Schemes I Kyoko Makino II Martin Berz Department of Physics and Astronomy Michigan State University Introduction LDB (Linear Dominated Bounder) QDB (Quadratic Dominated Bounder)

More information

Selected HW Solutions

Selected HW Solutions Selected HW Solutions HW1 1 & See web page notes Derivative Approximations. For example: df f i+1 f i 1 = dx h i 1 f i + hf i + h h f i + h3 6 f i + f i + h 6 f i + 3 a realmax 17 1.7014 10 38 b realmin

More information

Verification of Invertibility of Complicated Functions over Large Domains

Verification of Invertibility of Complicated Functions over Large Domains Reliable Computing 8: 67 82, 2002. 67 c 2002 Kluwer Academic Publishers. Printed in the Netherlands. Verification of Invertibility of Complicated Functions over Large Domains JENS HOEFKENS and MARTIN BERZ

More information

PARTIAL DIFFERENTIAL EQUATIONS

PARTIAL DIFFERENTIAL EQUATIONS MATHEMATICAL METHODS PARTIAL DIFFERENTIAL EQUATIONS I YEAR B.Tech By Mr. Y. Prabhaker Reddy Asst. Professor of Mathematics Guru Nanak Engineering College Ibrahimpatnam, Hyderabad. SYLLABUS OF MATHEMATICAL

More information

Interval Arithmetic An Elementary Introduction and Successful Applications

Interval Arithmetic An Elementary Introduction and Successful Applications Interval Arithmetic An Elementary Introduction and Successful Applications by R. Baker Kearfott Department of Mathematics University of Southwestern Louisiana U.S.L. Box 4-1010 Lafayette, LA 70504-1010

More information

From Particle Accelerators to Celestial Dynamics: An Introduction to Differential Algebra

From Particle Accelerators to Celestial Dynamics: An Introduction to Differential Algebra AstroNet II Summer School 2014 Friday, 27 June 2014 Zielona Góra (Poland) From Particle Accelerators to Celestial Dynamics: An Introduction to Differential Algebra 1, Pierluigi di Lizia 1, Roberto Armellin

More information

Affine Arithmetic: Concepts and Applications

Affine Arithmetic: Concepts and Applications SCAN 2002 Affine Arithmetic: Concepts and Applications Luiz Henrique de Figueiredo (IMPA) Jorge Stolfi (UNICAMP) Outline What is affine arithmetic? The dependency problem in interval arithmetic Main concepts

More information

Exponential multistep methods of Adams-type

Exponential 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 information

Numerical Methods - Initial Value Problems for ODEs

Numerical 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 information

Section 7.2 Euler s Method

Section 7.2 Euler s Method Section 7.2 Euler s Method Key terms Scalar first order IVP (one step method) Euler s Method Derivation Error analysis Computational procedure Difference equation Slope field or Direction field Error Euler's

More information

x x2 2 + x3 3 x4 3. Use the divided-difference method to find a polynomial of least degree that fits the values shown: (b)

x x2 2 + x3 3 x4 3. Use the divided-difference method to find a polynomial of least degree that fits the values shown: (b) Numerical Methods - PROBLEMS. The Taylor series, about the origin, for log( + x) is x x2 2 + x3 3 x4 4 + Find an upper bound on the magnitude of the truncation error on the interval x.5 when log( + x)

More information

Fourth Order RK-Method

Fourth 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 information

Math 411 Preliminaries

Math 411 Preliminaries Math 411 Preliminaries Provide a list of preliminary vocabulary and concepts Preliminary Basic Netwon's method, Taylor series expansion (for single and multiple variables), Eigenvalue, Eigenvector, Vector

More information

CS 323: Numerical Analysis and Computing

CS 323: Numerical Analysis and Computing CS 323: Numerical Analysis and Computing MIDTERM #2 Instructions: This is an open notes exam, i.e., you are allowed to consult any textbook, your class notes, homeworks, or any of the handouts from us.

More information

High-order representation of Poincare maps

High-order representation of Poincare maps Nuclear Instruments and Methods in Physics Research A 558 (2006) 106 111 wwwelseviercom/locate/nima High-order representation of Poincare maps Johannes Grote, Martin Berz, Kyoko Makino Department of Physics

More information

Module 6 : Solving Ordinary Differential Equations - Initial Value Problems (ODE-IVPs) Section 1 : Introduction

Module 6 : Solving Ordinary Differential Equations - Initial Value Problems (ODE-IVPs) Section 1 : Introduction Module 6 : Solving Ordinary Differential Equations - Initial Value Problems (ODE-IVPs) Section 1 : Introduction 1 Introduction In this module, we develop solution techniques for numerically solving ordinary

More information

MATHEMATICAL METHODS INTERPOLATION

MATHEMATICAL METHODS INTERPOLATION MATHEMATICAL METHODS INTERPOLATION I YEAR BTech By Mr Y Prabhaker Reddy Asst Professor of Mathematics Guru Nanak Engineering College Ibrahimpatnam, Hyderabad SYLLABUS OF MATHEMATICAL METHODS (as per JNTU

More information

Probability Bounds Analysis for Nonlinear Population Ecology Models

Probability Bounds Analysis for Nonlinear Population Ecology Models Probability Bounds Analysis for Nonlinear Population Ecology Models Joshua A. Enszer 1, D. Andrei Măceș, Mark A. Stadtherr 2 Department of Chemical and Biomolecular Engineering, University of Notre Dame,

More information

PowerPoints organized by Dr. Michael R. Gustafson II, Duke University

PowerPoints 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 information

Apophis Encounter 2029: Differential Algebra and Taylor Model Approaches. 1 st IAA Planetary Defense Conference: Protecting Earth from Asteroids

Apophis Encounter 2029: Differential Algebra and Taylor Model Approaches. 1 st IAA Planetary Defense Conference: Protecting Earth from Asteroids Apophis Encounter 9: Differential Algebra and Taylor Model Approaches 1 st IAA Planetary Defense Conference: Protecting Earth from Asteroids 7- April 9 Granada, Spain R. Armellin (1), P. Di Lizia (1),

More information

1 Ordinary Differential Equations

1 Ordinary Differential Equations Ordinary Differential Equations.0 Mathematical Background.0. Smoothness Definition. A function f defined on [a, b] is continuous at ξ [a, b] if lim x ξ f(x) = f(ξ). Remark Note that this implies existence

More information

CS 257: Numerical Methods

CS 257: Numerical Methods CS 57: Numerical Methods Final Exam Study Guide Version 1.00 Created by Charles Feng http://www.fenguin.net CS 57: Numerical Methods Final Exam Study Guide 1 Contents 1 Introductory Matter 3 1.1 Calculus

More information

EAD 115. Numerical Solution of Engineering and Scientific Problems. David M. Rocke Department of Applied Science

EAD 115. Numerical Solution of Engineering and Scientific Problems. David M. Rocke Department of Applied Science EAD 115 Numerical Solution of Engineering and Scientific Problems David M. Rocke Department of Applied Science Computer Representation of Numbers Counting numbers (unsigned integers) are the numbers 0,

More information

TS Method Summary. T k (x,y j 1 ) f(x j 1,y j 1 )+ 2 f (x j 1,y j 1 ) + k 1

TS Method Summary. T k (x,y j 1 ) f(x j 1,y j 1 )+ 2 f (x j 1,y j 1 ) + k 1 TS Method Summary Let T k (x,y j 1 ) denote the first k +1 terms of the Taylor series expanded about the discrete approximation, (x j 1,y j 1 ), and ẑ k,j (x) be the polynomial approximation (to y(x))

More information

Numerical Methods for Differential Equations Mathematical and Computational Tools

Numerical Methods for Differential Equations Mathematical and Computational Tools Numerical Methods for Differential Equations Mathematical and Computational Tools Gustaf Söderlind Numerical Analysis, Lund University Contents V4.16 Part 1. Vector norms, matrix norms and logarithmic

More information

Runge Kutta Chebyshev methods for parabolic problems

Runge 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 information

CHAPTER 10: Numerical Methods for DAEs

CHAPTER 10: Numerical Methods for DAEs CHAPTER 10: Numerical Methods for DAEs Numerical approaches for the solution of DAEs divide roughly into two classes: 1. direct discretization 2. reformulation (index reduction) plus discretization Direct

More information

Introduction to the Numerical Solution of IVP for ODE

Introduction to the Numerical Solution of IVP for ODE Introduction to the Numerical Solution of IVP for ODE 45 Introduction to the Numerical Solution of IVP for ODE Consider the IVP: DE x = f(t, x), IC x(a) = x a. For simplicity, we will assume here that

More information

Interpolation. Chapter Interpolation. 7.2 Existence, Uniqueness and conditioning

Interpolation. Chapter Interpolation. 7.2 Existence, Uniqueness and conditioning 76 Chapter 7 Interpolation 7.1 Interpolation Definition 7.1.1. Interpolation of a given function f defined on an interval [a,b] by a polynomial p: Given a set of specified points {(t i,y i } n with {t

More information

LECTURE NOTES ELEMENTARY NUMERICAL METHODS. Eusebius Doedel

LECTURE NOTES ELEMENTARY NUMERICAL METHODS. Eusebius Doedel LECTURE NOTES on ELEMENTARY NUMERICAL METHODS Eusebius Doedel TABLE OF CONTENTS Vector and Matrix Norms 1 Banach Lemma 20 The Numerical Solution of Linear Systems 25 Gauss Elimination 25 Operation Count

More information

Exam in TMA4215 December 7th 2012

Exam in TMA4215 December 7th 2012 Norwegian University of Science and Technology Department of Mathematical Sciences Page of 9 Contact during the exam: Elena Celledoni, tlf. 7359354, cell phone 48238584 Exam in TMA425 December 7th 22 Allowed

More information

Rigorous Global Optimization of Impulsive Space Trajectories

Rigorous Global Optimization of Impulsive Space Trajectories Rigorous Global Optimization of Impulsive Space Trajectories P. Di Lizia, R. Armellin, M. Lavagna K. Makino, M. Berz Fourth International Workshop on Taylor Methods Boca Raton, December 16 19, 2006 Motivation

More information

ECE257 Numerical Methods and Scientific Computing. Ordinary Differential Equations

ECE257 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 information

Comparison between Interval and Fuzzy Load Flow Methods Considering Uncertainty

Comparison between Interval and Fuzzy Load Flow Methods Considering Uncertainty Comparison between Interval and Fuzzy Load Flow Methods Considering Uncertainty T.Srinivasarao, 2 P.Mallikarajunarao Department of Electrical Engineering, College of Engineering (A), Andhra University,

More information

Applied Numerical Analysis

Applied Numerical Analysis Applied Numerical Analysis Using MATLAB Second Edition Laurene V. Fausett Texas A&M University-Commerce PEARSON Prentice Hall Upper Saddle River, NJ 07458 Contents Preface xi 1 Foundations 1 1.1 Introductory

More information

Ordinary differential equations. Phys 420/580 Lecture 8

Ordinary 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 information

Lecture 10 Polynomial interpolation

Lecture 10 Polynomial interpolation Lecture 10 Polynomial interpolation Weinan E 1,2 and Tiejun Li 2 1 Department of Mathematics, Princeton University, weinan@princeton.edu 2 School of Mathematical Sciences, Peking University, tieli@pku.edu.cn

More information

Defect-based a-posteriori error estimation for implicit ODEs and DAEs

Defect-based a-posteriori error estimation for implicit ODEs and DAEs 1 / 24 Defect-based a-posteriori error estimation for implicit ODEs and DAEs W. Auzinger Institute for Analysis and Scientific Computing Vienna University of Technology Workshop on Innovative Integrators

More information

Numerical Methods I Solving Nonlinear Equations

Numerical Methods I Solving Nonlinear Equations Numerical Methods I Solving Nonlinear Equations Aleksandar Donev Courant Institute, NYU 1 donev@courant.nyu.edu 1 MATH-GA 2011.003 / CSCI-GA 2945.003, Fall 2014 October 16th, 2014 A. Donev (Courant Institute)

More information

Finite 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 28 PART II Finite Difference Methods for Differential Equations Finite Differences for Differential Equations 29 BOUNDARY VALUE PROBLEMS (I) Solving a TWO

More information

Preface. 2 Linear Equations and Eigenvalue Problem 22

Preface. 2 Linear Equations and Eigenvalue Problem 22 Contents Preface xv 1 Errors in Computation 1 1.1 Introduction 1 1.2 Floating Point Representation of Number 1 1.3 Binary Numbers 2 1.3.1 Binary number representation in computer 3 1.4 Significant Digits

More information

Introduction - Motivation. Many phenomena (physical, chemical, biological, etc.) are model by differential equations. f f(x + h) f(x) (x) = lim

Introduction - Motivation. Many phenomena (physical, chemical, biological, etc.) are model by differential equations. f f(x + h) f(x) (x) = lim Introduction - Motivation Many phenomena (physical, chemical, biological, etc.) are model by differential equations. Recall the definition of the derivative of f(x) f f(x + h) f(x) (x) = lim. h 0 h Its

More information

Validated integration of Solar System Dynamics. 1 st IAA Planetary Defense Conference: Protecting Earth from Asteroids

Validated integration of Solar System Dynamics. 1 st IAA Planetary Defense Conference: Protecting Earth from Asteroids Validated integration of Solar System Dynamics 1 st IAA Planetary Defense Conference: Protecting Earth from Asteroids 27-3 April 29 Granada, Spain P. Di Lizia (1), R. Armellin (1), F. Bernelli Zazzera

More information

Chapter 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. (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 information

8.1 Introduction. Consider the initial value problem (IVP):

8.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 information

D0 D1 s(t0,d0,t1) D2 s(t1,d1,t2)

D0 D1 s(t0,d0,t1) D2 s(t1,d1,t2) Consistency Techniques in Ordinary Dierential Equations? Yves Deville 1,Micha Janssen 1,Pascal Van Hentenryck 2 1 Universite catholique de Louvain, Pl. Ste Barbe 2, B-1348 Louvain-la-Neuve, Belgium 2 Brown

More information

On the existence of an eigenvalue below the essential spectrum

On the existence of an eigenvalue below the essential spectrum On the existence of an eigenvalue below the essential spectrum B.M.Brown, D.K.R.M c Cormack Department of Computer Science, Cardiff University of Wales, Cardiff, PO Box 916, Cardiff CF2 3XF, U.K. A. Zettl

More information

Nonconstant Coefficients

Nonconstant Coefficients Chapter 7 Nonconstant Coefficients We return to second-order linear ODEs, but with nonconstant coefficients. That is, we consider (7.1) y + p(t)y + q(t)y = 0, with not both p(t) and q(t) constant. The

More information

Numerical methods for the Navier- Stokes equations

Numerical 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 information

BSM510 Numerical Analysis

BSM510 Numerical Analysis BSM510 Numerical Analysis Polynomial Interpolation Prof. Manar Mohaisen Department of EEC Engineering Review of Precedent Lecture Polynomial Regression Multiple Linear Regression Nonlinear Regression Lecture

More information

Function approximation

Function approximation Week 9: Monday, Mar 26 Function approximation A common task in scientific computing is to approximate a function. The approximated function might be available only through tabulated data, or it may be

More information

ENO and WENO schemes. Further topics and time Integration

ENO and WENO schemes. Further topics and time Integration ENO and WENO schemes. Further topics and time Integration Tefa Kaisara CASA Seminar 29 November, 2006 Outline 1 Short review ENO/WENO 2 Further topics Subcell resolution Other building blocks 3 Time Integration

More information

Numerical Methods in Physics and Astrophysics

Numerical Methods in Physics and Astrophysics Kostas Kokkotas 2 October 20, 2014 2 http://www.tat.physik.uni-tuebingen.de/ kokkotas Kostas Kokkotas 3 TOPICS 1. Solving nonlinear equations 2. Solving linear systems of equations 3. Interpolation, approximation

More information

Verified High-Order Optimal Control in Space Flight Dynamics

Verified High-Order Optimal Control in Space Flight Dynamics Verified High-Order Optimal Control in Space Flight Dynamics R. Armellin, P. Di Lizia, F. Bernelli-Zazzera K. Makino and M. Berz Fourth International Workshop on Taylor Methods Boca Raton, December 16

More information

Non-linear least squares

Non-linear least squares Non-linear least squares Concept of non-linear least squares We have extensively studied linear least squares or linear regression. We see that there is a unique regression line that can be determined

More information

Scientific Computing: An Introductory Survey

Scientific Computing: An Introductory Survey Scientific Computing: An Introductory Survey Chapter 11 Partial Differential Equations Prof. Michael T. Heath Department of Computer Science University of Illinois at Urbana-Champaign Copyright c 2002.

More information

NUMERICAL METHODS FOR ENGINEERING APPLICATION

NUMERICAL 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 information

A THEORETICAL INTRODUCTION TO NUMERICAL ANALYSIS

A THEORETICAL INTRODUCTION TO NUMERICAL ANALYSIS A THEORETICAL INTRODUCTION TO NUMERICAL ANALYSIS Victor S. Ryaben'kii Semyon V. Tsynkov Chapman &. Hall/CRC Taylor & Francis Group Boca Raton London New York Chapman & Hall/CRC is an imprint of the Taylor

More information

State Estimation Based on Self-Triggered Measurements

State Estimation Based on Self-Triggered Measurements Preprints of the 19th World Congress The International Federation of Automatic Control State Estimation Based on Self-Triggered Measurements N. Meslem and C. Prieur Grenoble Images Speech Signals and Automatics

More information

CS 450 Numerical Analysis. Chapter 9: Initial Value Problems for Ordinary Differential Equations

CS 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 information

Jim Lambers MAT 772 Fall Semester Lecture 21 Notes

Jim 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 information

Global Optimization by Interval Analysis

Global Optimization by Interval Analysis Global Optimization by Interval Analysis Milan Hladík Department of Applied Mathematics, Faculty of Mathematics and Physics, Charles University in Prague, Czech Republic, http://kam.mff.cuni.cz/~hladik/

More information

SAT Modulo ODE: A Direct SAT Approach to Hybrid Systems

SAT Modulo ODE: A Direct SAT Approach to Hybrid Systems Welcome ATVA 2008 SAT Modulo ODE: A Direct SAT Approach to Hbrid Sstems Andreas Eggers, Martin Fränzle, and Christian Herde DFG Transregional Collaborative Research Center AVACS Outline Motivation Bounded

More information

4 Stability analysis of finite-difference methods for ODEs

4 Stability analysis of finite-difference methods for ODEs MATH 337, by T. Lakoba, University of Vermont 36 4 Stability analysis of finite-difference methods for ODEs 4.1 Consistency, stability, and convergence of a numerical method; Main Theorem In this Lecture

More information