Stability properties of a family of chock capturing methods for hyperbolic conservation laws

Size: px
Start display at page:

Download "Stability properties of a family of chock capturing methods for hyperbolic conservation laws"

Transcription

1 Proceedings of te 3rd IASME/WSEAS Int. Conf. on FLUID DYNAMICS & AERODYNAMICS, Corfu, Greece, August 0-, 005 (pp48-5) Stability properties of a family of cock capturing metods for yperbolic conservation laws VIRGINIA ALARCÓN, SERGIO AMAT AND SONIA BUSQUIER Departamento de Matemática Aplicada y Estadística. Universidad Politécnica de Cartagena. Paseo Alfonso XIII, Cartagena(Murcia). Spain. sergio.amat@upct.es, sonia.busquier@upct.es Abstract: In tis paper a family of local sock capturing metods for yperbolic conservation laws is presented. We analyze some stability properties in order to obtain te convergence of te scemes. Key Words: Hyperbolic conservation laws, local sock capturing metods, stability, convergence. Introduction We consider numerical approximations to weak solutions of nonlinear yperbolic conservation laws: u t + f(u) x = 0, () u(x, 0) = u 0 (x). () te initial data u 0 (x) are supposed to be piecewise smoot functions tat eiter periodic or of compact support. Let be u n j = u (x j, t n ) denote a numerical approximation to te exact solution u(x j, t n ) of ()-() defined on a computational grid x j = j, t n = n t in conservation form: u n+ j = u n j λ( ˆf n j+ ˆf n j ), (3) were λ = t and te numerical flux is a function of k variables ˆf n j+ = ˆf(u n j k+,..., u n j+k), (4) wic is consistent wit (), i.e. ˆf(u,..., u) = f(u). (5) Te importance of te following lemma (see [5]) is because it implies tat approximating te numerical flux to a ig order accuracy it is enoug to reconstruct g(x j+ ) (see equation (6)) up to te same order. Lemma (Su and Oser) If a function g(x) satisfies f(u(x)) = x+ x g(ξ)dξ (6)

2 Proceedings of te 3rd IASME/WSEAS Int. Conf. on FLUID DYNAMICS & AERODYNAMICS, Corfu, Greece, August 0-, 005 (pp48-5) ten f(u(x)) x = g(x + ) g(x ). First order metods give poor accuracy in smoot regions of te flow. Socks tend to be eavily smeared and poorly resolved on te grid. Tese effects are due to te large amount of numerical dissipation in tese scemes. Marquina [4] introduced a new local tird order accurate sock capturing metod (PHM), te main advantage of tis metod lies on te property tat it is localer tan ENO and TVD upwind scemes of te same order, (and, tus, giving better resolution of corners), because numerical fluxes depend only on four variables. In [] and [] we present some modifications of te PHM. Tey are based on different reconstructions. From te numerical experiments, te metods become efficient since tey are low cost and tey are not very sensitive to te Courant-Friedrics-Lewy (CFL) number. To complete te scemes, Su and Oser developed a special family of Runge- Kutta time integration scemes tat ave a TVD property [5], [6]. Te TVD property prevents te time stepping sceme from introducing spurious spatial oscillations into upwind-biased spatial discretization. Te aim of tis paper is to analyze some stability properties in order to obtain te convergence of tese type of scemes. Te paper is organized as follows: section contains te reconstruction step. In section 3 te complete algoritm is presented. Finally, some stability properties and a convergence analysis are studied in 4. Piecewise reconstructions We define a computational grid x j = j, j integer, > 0, were te cells are C j = {x : x j were x j+ = x j +. Our grid data are: (d j+ v j = d j+ x x j+ }, (7) xj+ g(ξ)dξ, (8) x j = v j+ v j, (9) = g (x j+ ) + O( )). We required te following conditions for every j: d i+ v j = xj+ r j (ξ)dξ, (0) x j = r j(x i+ ), i = j, j. () Taylor series expansions sow tat conditions (0) and () imply tird order accuracy of te reconstruction r j (x).. Local Total Variation Bounded reconstructions Te reconstruction procedure is repeated at every time step, tus te cange in total variation of te reconstruction must be controlled. Te local total variation of te reconstruction {r j } is defined by LT V j = T V (r j ), were T V (r j ) means te total variation of te function r j (x) in te cell C j. Te size of LT V j determines locally te increasing of te total variation of te reconstruction. In [4], te following definition is given:

3 Proceedings of te 3rd IASME/WSEAS Int. Conf. on FLUID DYNAMICS & AERODYNAMICS, Corfu, Greece, August 0-, 005 (pp48-5) Definition A metod of reconstruction is local total variation bounded (LTVB) if tere exists a constant M > 0, independing of (depending only on te function g(x) to be reconstructed), suc tat LT V j M, for all j. Te metod of reconstruction wit r j (x) is not LTVB. For nonlinear fluxes, te metod becomes unstable. As PHM sceme, we will assign a different value to te central derivative. Since our reconstruction is local, we restrict our discussion to te cell C 0 and te grid data of te cell: v 0, d, and d. Te algoritm defines te modified reconstruction r 0 (x) suc tat its derivative interpolates d 0 at x 0 and te lateral grid derivative wit smallest absolute value. Were, if C 0 is a nontransition (d d > 0) cell, ten we define d 0 suc tat d 0 r (x 0 ) = O( ) in ), r 0 (x )) = smoot regions and max( r 0 (x O(). In transition cells we consider d 0 = 0. Teorem Te above metod of reconstruction of te function g(x) is a local preprocessed reconstruction procedure tat is LTVB. 3 Piecewise Metods Te final algoritm is based on te first order Roe sceme, wit te entropy-fix correction due to Su and Oser [6], for local piecewise reconstruction. Te numerical fluxes are reconstructed from te upwind side, except tat if te wind canges direction at te cell, ten a local Lax- Friedrics flux decomposition is performed. ALGORITHM For every j do If f (u) does not canges of sign between u n j and un j+, ten Upwindness Pase (Roe-speed) If ā j+ else ā j+ 0 ten = v j+ v j u j+ u j () = r j (x j+ ) (3) = r j+ (x (j+) ) (4) else Flux decomposition pase = max u n j <u<u n f (u) j+ M j+ v k + = (v k + M j+ Computation of f +, as (3) vk = (v k M j+ Computation of f, as (4) end = f + + f u n k ) k = j, j, j + u n k ) k = j, j +, j + 4 Stability and Convergence Analysis Our metod is consistent and in conservation form, ten te Lax-Wendroff teorem ([3] Capter ) says tat if a sequence of te approximations converges ten te limit is a weak solution.

4 Proceedings of te 3rd IASME/WSEAS Int. Conf. on FLUID DYNAMICS & AERODYNAMICS, Corfu, Greece, August 0-, 005 (pp48-5) Definition Te Total Variation of a discrete solution is defined by T V (u) = j u n j+ u n j To obtain te convergence, we use te following two teorems (Teorem 5. and Teorem 5. in [3]). Teorem Consider a conservative metod wit a Lipscitz continuous numerical flux and suppose tat for eac initial data u 0 tere exists some k 0, R > 0 suc tat T V (u n ) R n, k wit k < k 0, nk T. Ten te metod is TV-stable. Teorem 3 A conservative sceme in conservation form, wit Lipscitz continuous numerical flux and TV-stable is convergent. Tus, it is enoug to guarantee tat te numerical flux is Lipscitz continuous and tat te T V (u n ) is uniformly bounded for all n, k wit k < k 0, nk T. We assume tat te numerical flux associated to te considered reconstruction is Lipscitz continuous. Finally, we ave to find a positive constant C suc tat T V (u n ) < C for all n, k wit k < k 0, nk T. In practice, a Runge-Kutta TVD for te time discretization is used. Tus, we do not ave stability problems wit te time. In order to simplify te notation we consider te simplest Euler sceme. From u n+ j = u n j λ( ˆf n j+ ˆf n j ), u n+ j = u n j λ( ˆf n j ˆf n j 3 ). we obtain (u n+ j u n+ j ) = (un j u n j ) λ( ˆf j + ˆf j 3 ). (5) Remark We are interesting to analyze te reconstruction step only. Te oters parts of te algoritm is classical and common for tis type of scemes. Tus, in order to present a more clear proof, we do not consider te upwind pase. We summarize te basic ingredients to obtain te desired stability. ) Let us coose a number > 0, suc tat tere is at least two cells between two jumps of g(x). Since g(x) is a piecewise smoot function, tere exist two constant M, M > 0 depending only on derivatives of g in smoot regions, suc tat: a) For all j, except for a finite number of insolated j s (for wic d j+ = O( )), d j+ < M. In particular, d c and d l are lees tan M always. b) d j+ r (x j ) M ( u n j+ u n j + u n j u n j ). c) (r (x j ) r (x j )) = f (β n j )(u n j u n j ). ) If let us consider vj n = un j, j. Since f is smoot, f(u n j ) f(vn j ) = f (θj n)(un j vn j ). 3) Let be te CFL condition 0 αj n := λ(f (θ n j ) + f (β n j ) ) for all j. Using tis properties and relation (5) we arrive to u n+ j u n+ j ( αn j ) u n j u n j

5 Proceedings of te 3rd IASME/WSEAS Int. Conf. on FLUID DYNAMICS & AERODYNAMICS, Corfu, Greece, August 0-, 005 (pp48-5) and ten + α n j u n j u n j + tm ( u n j+ u n j + u n j u n j + u n j u n j ), T V (u n+ ) ( + αk)t V (u n ), were 0 α 3 M is independent of u n. By induction T V (u n+ ) ( + αk) n+ T V (u 0 ). Tus, for (n + )k T, [4] Marquina A. (994), Local piecewise yperbolic reconstruction of numerical fluxes for nonlinear scalar conservation laws, SIAM J.Sci.Comput., 5, 4, pp [5] Su C.W. and Oser S.J. (987), Efficient implementation of essential non- Oscillatory sock capturing scemes, J.Comput.Pys., 77, pp [6] Su C.W. and Oser S.J. (989), Efficient implementation of essential non- Oscillatory sock capturing scemes II, J.Comput.Pys., 83, pp T V (u n+ ) e αt T V (u 0 ), and ence te metod is total variation stable. Acknowledgments Researc supported in part by te Spanis grants MTM and 00675/PI/04. References [] Amat S., Busquier S. and Candela V.F. (003), A polynomial approac to PHM metod, Preprint U.P. Cartagena, Int.J.Comput.Fluid.D., 7(3), pp [] Amat S., Busquier S. and Candela V.F. (003), Local Total Variation Bounded metods for yperbolic conservation laws, J. of Comp. Metods in Sciences and Engineering, 3(3), pp [3] Leveque R.J. (990). Numerical Metods for Conservation Laws. Birkäuser Verlag (Lectures in Matematics).

ERROR BOUNDS FOR THE METHODS OF GLIMM, GODUNOV AND LEVEQUE BRADLEY J. LUCIER*

ERROR BOUNDS FOR THE METHODS OF GLIMM, GODUNOV AND LEVEQUE BRADLEY J. LUCIER* EO BOUNDS FO THE METHODS OF GLIMM, GODUNOV AND LEVEQUE BADLEY J. LUCIE* Abstract. Te expected error in L ) attimet for Glimm s sceme wen applied to a scalar conservation law is bounded by + 2 ) ) /2 T

More information

Order of Accuracy. ũ h u Ch p, (1)

Order of Accuracy. ũ h u Ch p, (1) Order of Accuracy 1 Terminology We consider a numerical approximation of an exact value u. Te approximation depends on a small parameter, wic can be for instance te grid size or time step in a numerical

More information

Entropy and the numerical integration of conservation laws

Entropy and the numerical integration of conservation laws Pysics Procedia Pysics Procedia 00 2011) 1 28 Entropy and te numerical integration of conservation laws Gabriella Puppo Dipartimento di Matematica, Politecnico di Torino Italy) Matteo Semplice Dipartimento

More information

1 Upwind scheme for advection equation with variable. 2 Modified equations: numerical dissipation and dispersion

1 Upwind scheme for advection equation with variable. 2 Modified equations: numerical dissipation and dispersion 1 Upwind sceme for advection equation wit variable coefficient Consider te equation u t + a(x)u x Applying te upwind sceme, we ave u n 1 = a (un u n 1), a 0 u n 1 = a (un +1 u n ) a < 0. CFL condition

More information

Consider a function f we ll specify which assumptions we need to make about it in a minute. Let us reformulate the integral. 1 f(x) dx.

Consider a function f we ll specify which assumptions we need to make about it in a minute. Let us reformulate the integral. 1 f(x) dx. Capter 2 Integrals as sums and derivatives as differences We now switc to te simplest metods for integrating or differentiating a function from its function samples. A careful study of Taylor expansions

More information

LECTURE 14 NUMERICAL INTEGRATION. Find

LECTURE 14 NUMERICAL INTEGRATION. Find LECTURE 14 NUMERCAL NTEGRATON Find b a fxdx or b a vx ux fx ydy dx Often integration is required. However te form of fx may be suc tat analytical integration would be very difficult or impossible. Use

More information

A New Fourth-Order Non-Oscillatory Central Scheme For Hyperbolic Conservation Laws

A New Fourth-Order Non-Oscillatory Central Scheme For Hyperbolic Conservation Laws A New Fourth-Order Non-Oscillatory Central Scheme For Hyperbolic Conservation Laws A. A. I. Peer a,, A. Gopaul a, M. Z. Dauhoo a, M. Bhuruth a, a Department of Mathematics, University of Mauritius, Reduit,

More information

Superconvergence of energy-conserving discontinuous Galerkin methods for. linear hyperbolic equations. Abstract

Superconvergence of energy-conserving discontinuous Galerkin methods for. linear hyperbolic equations. Abstract Superconvergence of energy-conserving discontinuous Galerkin metods for linear yperbolic equations Yong Liu, Ci-Wang Su and Mengping Zang 3 Abstract In tis paper, we study superconvergence properties of

More information

Numerical Solution of One Dimensional Nonlinear Longitudinal Oscillations in a Class of Generalized Functions

Numerical Solution of One Dimensional Nonlinear Longitudinal Oscillations in a Class of Generalized Functions Proc. of te 8t WSEAS Int. Conf. on Matematical Metods and Computational Tecniques in Electrical Engineering, Bucarest, October 16-17, 2006 219 Numerical Solution of One Dimensional Nonlinear Longitudinal

More information

Click here to see an animation of the derivative

Click here to see an animation of the derivative Differentiation Massoud Malek Derivative Te concept of derivative is at te core of Calculus; It is a very powerful tool for understanding te beavior of matematical functions. It allows us to optimize functions,

More information

Arbitrary order exactly divergence-free central discontinuous Galerkin methods for ideal MHD equations

Arbitrary order exactly divergence-free central discontinuous Galerkin methods for ideal MHD equations Arbitrary order exactly divergence-free central discontinuous Galerkin metods for ideal MHD equations Fengyan Li, Liwei Xu Department of Matematical Sciences, Rensselaer Polytecnic Institute, Troy, NY

More information

ere x = (x 1 ; :::; x d ) and f(u) = (f 1 (u); :::; f d (u)). We do not pay attention to boundary conditions in tis paper, ence te solution is conside

ere x = (x 1 ; :::; x d ) and f(u) = (f 1 (u); :::; f d (u)). We do not pay attention to boundary conditions in tis paper, ence te solution is conside Error Estimates to Smoot Solutions of Runge Kutta Discontinuous Galerkin Metods for Scalar Conservation Laws Qiang ang Λ and Ci-Wang Su y Abstract In tis paper we study te error estimates to sufficiently

More information

Jian-Guo Liu 1 and Chi-Wang Shu 2

Jian-Guo Liu 1 and Chi-Wang Shu 2 Journal of Computational Pysics 60, 577 596 (000) doi:0.006/jcp.000.6475, available online at ttp://www.idealibrary.com on Jian-Guo Liu and Ci-Wang Su Institute for Pysical Science and Tecnology and Department

More information

1. Introduction. We consider the model problem: seeking an unknown function u satisfying

1. Introduction. We consider the model problem: seeking an unknown function u satisfying A DISCONTINUOUS LEAST-SQUARES FINITE ELEMENT METHOD FOR SECOND ORDER ELLIPTIC EQUATIONS XIU YE AND SHANGYOU ZHANG Abstract In tis paper, a discontinuous least-squares (DLS) finite element metod is introduced

More information

232 Calculus and Structures

232 Calculus and Structures 3 Calculus and Structures CHAPTER 17 JUSTIFICATION OF THE AREA AND SLOPE METHODS FOR EVALUATING BEAMS Calculus and Structures 33 Copyrigt Capter 17 JUSTIFICATION OF THE AREA AND SLOPE METHODS 17.1 THE

More information

Poisson Equation in Sobolev Spaces

Poisson Equation in Sobolev Spaces Poisson Equation in Sobolev Spaces OcMountain Dayligt Time. 6, 011 Today we discuss te Poisson equation in Sobolev spaces. It s existence, uniqueness, and regularity. Weak Solution. u = f in, u = g on

More information

A New Fifth Order Finite Difference WENO Scheme for Hamilton-Jacobi Equations

A New Fifth Order Finite Difference WENO Scheme for Hamilton-Jacobi Equations A New Fift Order Finite Difference WENO Sceme for Hamilton-Jacobi Equations Jun Zu, 1 Jianxian Qiu 1 College of Science, Nanjing University of Aeronautics and Astronautics, Nanjing, Jiangsu 10016, People

More information

Finite Difference Method

Finite Difference Method Capter 8 Finite Difference Metod 81 2nd order linear pde in two variables General 2nd order linear pde in two variables is given in te following form: L[u] = Au xx +2Bu xy +Cu yy +Du x +Eu y +Fu = G According

More information

Blanca Bujanda, Juan Carlos Jorge NEW EFFICIENT TIME INTEGRATORS FOR NON-LINEAR PARABOLIC PROBLEMS

Blanca Bujanda, Juan Carlos Jorge NEW EFFICIENT TIME INTEGRATORS FOR NON-LINEAR PARABOLIC PROBLEMS Opuscula Matematica Vol. 26 No. 3 26 Blanca Bujanda, Juan Carlos Jorge NEW EFFICIENT TIME INTEGRATORS FOR NON-LINEAR PARABOLIC PROBLEMS Abstract. In tis work a new numerical metod is constructed for time-integrating

More information

lecture 26: Richardson extrapolation

lecture 26: Richardson extrapolation 43 lecture 26: Ricardson extrapolation 35 Ricardson extrapolation, Romberg integration Trougout numerical analysis, one encounters procedures tat apply some simple approximation (eg, linear interpolation)

More information

EXTENSION OF A POSTPROCESSING TECHNIQUE FOR THE DISCONTINUOUS GALERKIN METHOD FOR HYPERBOLIC EQUATIONS WITH APPLICATION TO AN AEROACOUSTIC PROBLEM

EXTENSION OF A POSTPROCESSING TECHNIQUE FOR THE DISCONTINUOUS GALERKIN METHOD FOR HYPERBOLIC EQUATIONS WITH APPLICATION TO AN AEROACOUSTIC PROBLEM SIAM J. SCI. COMPUT. Vol. 26, No. 3, pp. 821 843 c 2005 Society for Industrial and Applied Matematics ETENSION OF A POSTPROCESSING TECHNIQUE FOR THE DISCONTINUOUS GALERKIN METHOD FOR HYPERBOLIC EQUATIONS

More information

Fourier Type Super Convergence Study on DDGIC and Symmetric DDG Methods

Fourier Type Super Convergence Study on DDGIC and Symmetric DDG Methods DOI 0.007/s095-07-048- Fourier Type Super Convergence Study on DDGIC and Symmetric DDG Metods Mengping Zang Jue Yan Received: 7 December 06 / Revised: 7 April 07 / Accepted: April 07 Springer Science+Business

More information

Chapter 1. Density Estimation

Chapter 1. Density Estimation Capter 1 Density Estimation Let X 1, X,..., X n be observations from a density f X x. Te aim is to use only tis data to obtain an estimate ˆf X x of f X x. Properties of f f X x x, Parametric metods f

More information

Approximation of the Viability Kernel

Approximation of the Viability Kernel Approximation of te Viability Kernel Patrick Saint-Pierre CEREMADE, Université Paris-Daupine Place du Marécal de Lattre de Tassigny 75775 Paris cedex 16 26 october 1990 Abstract We study recursive inclusions

More information

Polynomial Interpolation

Polynomial Interpolation Capter 4 Polynomial Interpolation In tis capter, we consider te important problem of approximatinga function fx, wose values at a set of distinct points x, x, x,, x n are known, by a polynomial P x suc

More information

5 Ordinary Differential Equations: Finite Difference Methods for Boundary Problems

5 Ordinary Differential Equations: Finite Difference Methods for Boundary Problems 5 Ordinary Differential Equations: Finite Difference Metods for Boundary Problems Read sections 10.1, 10.2, 10.4 Review questions 10.1 10.4, 10.8 10.9, 10.13 5.1 Introduction In te previous capters we

More information

Preconditioning in H(div) and Applications

Preconditioning in H(div) and Applications 1 Preconditioning in H(div) and Applications Douglas N. Arnold 1, Ricard S. Falk 2 and Ragnar Winter 3 4 Abstract. Summarizing te work of [AFW97], we sow ow to construct preconditioners using domain decomposition

More information

Math 660-Lecture 23: Gudonov s method and some theories for FVM schemes

Math 660-Lecture 23: Gudonov s method and some theories for FVM schemes Math 660-Lecture 3: Gudonov s method and some theories for FVM schemes 1 The idea of FVM (You can refer to Chapter 4 in the book Finite volume methods for hyperbolic problems ) Consider the box [x 1/,

More information

POLYNOMIAL AND SPLINE ESTIMATORS OF THE DISTRIBUTION FUNCTION WITH PRESCRIBED ACCURACY

POLYNOMIAL AND SPLINE ESTIMATORS OF THE DISTRIBUTION FUNCTION WITH PRESCRIBED ACCURACY APPLICATIONES MATHEMATICAE 36, (29), pp. 2 Zbigniew Ciesielski (Sopot) Ryszard Zieliński (Warszawa) POLYNOMIAL AND SPLINE ESTIMATORS OF THE DISTRIBUTION FUNCTION WITH PRESCRIBED ACCURACY Abstract. Dvoretzky

More information

New Fourth Order Quartic Spline Method for Solving Second Order Boundary Value Problems

New Fourth Order Quartic Spline Method for Solving Second Order Boundary Value Problems MATEMATIKA, 2015, Volume 31, Number 2, 149 157 c UTM Centre for Industrial Applied Matematics New Fourt Order Quartic Spline Metod for Solving Second Order Boundary Value Problems 1 Osama Ala yed, 2 Te

More information

Parameter Fitted Scheme for Singularly Perturbed Delay Differential Equations

Parameter Fitted Scheme for Singularly Perturbed Delay Differential Equations International Journal of Applied Science and Engineering 2013. 11, 4: 361-373 Parameter Fitted Sceme for Singularly Perturbed Delay Differential Equations Awoke Andargiea* and Y. N. Reddyb a b Department

More information

Numerical Differentiation

Numerical Differentiation Numerical Differentiation Finite Difference Formulas for te first derivative (Using Taylor Expansion tecnique) (section 8.3.) Suppose tat f() = g() is a function of te variable, and tat as 0 te function

More information

Runge-Kutta methods. With orders of Taylor methods yet without derivatives of f (t, y(t))

Runge-Kutta methods. With orders of Taylor methods yet without derivatives of f (t, y(t)) Runge-Kutta metods Wit orders of Taylor metods yet witout derivatives of f (t, y(t)) First order Taylor expansion in two variables Teorem: Suppose tat f (t, y) and all its partial derivatives are continuous

More information

Continuity. Example 1

Continuity. Example 1 Continuity MATH 1003 Calculus and Linear Algebra (Lecture 13.5) Maoseng Xiong Department of Matematics, HKUST A function f : (a, b) R is continuous at a point c (a, b) if 1. x c f (x) exists, 2. f (c)

More information

Lecture 15. Interpolation II. 2 Piecewise polynomial interpolation Hermite splines

Lecture 15. Interpolation II. 2 Piecewise polynomial interpolation Hermite splines Lecture 5 Interpolation II Introduction In te previous lecture we focused primarily on polynomial interpolation of a set of n points. A difficulty we observed is tat wen n is large, our polynomial as to

More information

Analytic Functions. Differentiable Functions of a Complex Variable

Analytic Functions. Differentiable Functions of a Complex Variable Analytic Functions Differentiable Functions of a Complex Variable In tis capter, we sall generalize te ideas for polynomials power series of a complex variable we developed in te previous capter to general

More information

Recent Progress in the Integration of Poisson Systems via the Mid Point Rule and Runge Kutta Algorithm

Recent Progress in the Integration of Poisson Systems via the Mid Point Rule and Runge Kutta Algorithm Recent Progress in te Integration of Poisson Systems via te Mid Point Rule and Runge Kutta Algoritm Klaus Bucner, Mircea Craioveanu and Mircea Puta Abstract Some recent progress in te integration of Poisson

More information

Third part: finite difference schemes and numerical dispersion

Third part: finite difference schemes and numerical dispersion Tird part: finite difference scemes and numerical dispersion BCAM - Basque Center for Applied Matematics Bilbao, Basque Country, Spain BCAM and UPV/EHU courses 2011-2012: Advanced aspects in applied matematics

More information

LIMITATIONS OF EULER S METHOD FOR NUMERICAL INTEGRATION

LIMITATIONS OF EULER S METHOD FOR NUMERICAL INTEGRATION LIMITATIONS OF EULER S METHOD FOR NUMERICAL INTEGRATION LAURA EVANS.. Introduction Not all differential equations can be explicitly solved for y. Tis can be problematic if we need to know te value of y

More information

Math 242: Principles of Analysis Fall 2016 Homework 7 Part B Solutions

Math 242: Principles of Analysis Fall 2016 Homework 7 Part B Solutions Mat 22: Principles of Analysis Fall 206 Homework 7 Part B Solutions. Sow tat f(x) = x 2 is not uniformly continuous on R. Solution. Te equation is equivalent to f(x) = 0 were f(x) = x 2 sin(x) 3. Since

More information

Gradient Descent etc.

Gradient Descent etc. 1 Gradient Descent etc EE 13: Networked estimation and control Prof Kan) I DERIVATIVE Consider f : R R x fx) Te derivative is defined as d fx) = lim dx fx + ) fx) Te cain rule states tat if d d f gx) )

More information

A First-Order System Approach for Diffusion Equation. I. Second-Order Residual-Distribution Schemes

A First-Order System Approach for Diffusion Equation. I. Second-Order Residual-Distribution Schemes A First-Order System Approac for Diffusion Equation. I. Second-Order Residual-Distribution Scemes Hiroaki Nisikawa W. M. Keck Foundation Laboratory for Computational Fluid Dynamics, Department of Aerospace

More information

arxiv: v1 [math.na] 11 Apr 2016

arxiv: v1 [math.na] 11 Apr 2016 Hig order approximation to non-smoot multivariate functions Anat Amir David Levin arxiv:164.281v1 [mat.na] 11 Apr 216 April 12, 216 Abstract Approximations of non-smoot multivariate functions return low-order

More information

arxiv: v2 [math.na] 11 Dec 2016

arxiv: v2 [math.na] 11 Dec 2016 Noname manuscript No. will be inserted by te editor Sallow water equations: Split-form, entropy stable, well-balanced, and positivity preserving numerical metods Hendrik Ranoca arxiv:609.009v [mat.na]

More information

Lecture XVII. Abstract We introduce the concept of directional derivative of a scalar function and discuss its relation with the gradient operator.

Lecture XVII. Abstract We introduce the concept of directional derivative of a scalar function and discuss its relation with the gradient operator. Lecture XVII Abstract We introduce te concept of directional derivative of a scalar function and discuss its relation wit te gradient operator. Directional derivative and gradient Te directional derivative

More information

Physically Based Modeling: Principles and Practice Implicit Methods for Differential Equations

Physically Based Modeling: Principles and Practice Implicit Methods for Differential Equations Pysically Based Modeling: Principles and Practice Implicit Metods for Differential Equations David Baraff Robotics Institute Carnegie Mellon University Please note: Tis document is 997 by David Baraff

More information

A h u h = f h. 4.1 The CoarseGrid SystemandtheResidual Equation

A h u h = f h. 4.1 The CoarseGrid SystemandtheResidual Equation Capter Grid Transfer Remark. Contents of tis capter. Consider a grid wit grid size and te corresponding linear system of equations A u = f. Te summary given in Section 3. leads to te idea tat tere migt

More information

MATH745 Fall MATH745 Fall

MATH745 Fall MATH745 Fall MATH745 Fall 5 MATH745 Fall 5 INTRODUCTION WELCOME TO MATH 745 TOPICS IN NUMERICAL ANALYSIS Instructor: Dr Bartosz Protas Department of Matematics & Statistics Email: bprotas@mcmasterca Office HH 36, Ext

More information

LIMITS AND DERIVATIVES CONDITIONS FOR THE EXISTENCE OF A LIMIT

LIMITS AND DERIVATIVES CONDITIONS FOR THE EXISTENCE OF A LIMIT LIMITS AND DERIVATIVES Te limit of a function is defined as te value of y tat te curve approaces, as x approaces a particular value. Te limit of f (x) as x approaces a is written as f (x) approaces, as

More information

Discontinuous Galerkin Methods: General Approach and Stability

Discontinuous Galerkin Methods: General Approach and Stability Discontinuous Galerkin Metods: General Approac and Stability Ci-Wang Su Division of Applied Matematics, Brown University Providence, RI 9, USA E-mail: su@dam.brown.edu Abstract In tese lectures, we will

More information

Grad-div stabilization for the evolutionary Oseen problem with inf-sup stable finite elements

Grad-div stabilization for the evolutionary Oseen problem with inf-sup stable finite elements Noname manuscript No. will be inserted by te editor Grad-div stabilization for te evolutionary Oseen problem wit inf-sup stable finite elements Javier de Frutos Bosco García-Arcilla Volker Jon Julia Novo

More information

Polynomial Interpolation

Polynomial Interpolation Capter 4 Polynomial Interpolation In tis capter, we consider te important problem of approximating a function f(x, wose values at a set of distinct points x, x, x 2,,x n are known, by a polynomial P (x

More information

Some Applications of Fractional Step Runge-Kutta Methods

Some Applications of Fractional Step Runge-Kutta Methods Some Applications of Fractional Step Runge-Kutta Metods JORGE, J.C., PORTERO, L. Dpto. de Matematica e Informatica Universidad Publica de Navarra Campus Arrosadia, s/n 3006 Pamplona Navarra SPAIN Abstract:

More information

HOMEWORK HELP 2 FOR MATH 151

HOMEWORK HELP 2 FOR MATH 151 HOMEWORK HELP 2 FOR MATH 151 Here we go; te second round of omework elp. If tere are oters you would like to see, let me know! 2.4, 43 and 44 At wat points are te functions f(x) and g(x) = xf(x)continuous,

More information

Finite Difference Methods Assignments

Finite Difference Methods Assignments Finite Difference Metods Assignments Anders Söberg and Aay Saxena, Micael Tuné, and Maria Westermarck Revised: Jarmo Rantakokko June 6, 1999 Teknisk databeandling Assignment 1: A one-dimensional eat equation

More information

The Verlet Algorithm for Molecular Dynamics Simulations

The Verlet Algorithm for Molecular Dynamics Simulations Cemistry 380.37 Fall 2015 Dr. Jean M. Standard November 9, 2015 Te Verlet Algoritm for Molecular Dynamics Simulations Equations of motion For a many-body system consisting of N particles, Newton's classical

More information

A Demonstration of the Advantage of Asymptotic Preserving Schemes over Standard Finite Volume Schemes

A Demonstration of the Advantage of Asymptotic Preserving Schemes over Standard Finite Volume Schemes A Demonstration of te Advantage of Asymptotic Preserving Scemes over Standard Finite Volume Scemes Jocen Scütz Berict Nr. 366 Juni 213 Key words: conservation laws, asymptotic metods, finite volume metods,

More information

A compact upwind second order scheme for the Eikonal equation

A compact upwind second order scheme for the Eikonal equation A compact upwind second order sceme for te Eikonal equation Jean-David Benamou Songting Luo Hongkai Zao Abstract We present a compact upwind second order sceme for computing te viscosity solution of te

More information

A Finite Element Primer

A Finite Element Primer A Finite Element Primer David J. Silvester Scool of Matematics, University of Mancester d.silvester@mancester.ac.uk. Version.3 updated 4 October Contents A Model Diffusion Problem.................... x.

More information

MATH1151 Calculus Test S1 v2a

MATH1151 Calculus Test S1 v2a MATH5 Calculus Test 8 S va January 8, 5 Tese solutions were written and typed up by Brendan Trin Please be etical wit tis resource It is for te use of MatSOC members, so do not repost it on oter forums

More information

Continuity and Differentiability of the Trigonometric Functions

Continuity and Differentiability of the Trigonometric Functions [Te basis for te following work will be te definition of te trigonometric functions as ratios of te sides of a triangle inscribed in a circle; in particular, te sine of an angle will be defined to be te

More information

A compact upwind second order scheme for the Eikonal equation

A compact upwind second order scheme for the Eikonal equation A compact upwind second order sceme for te Eikonal equation J.-D. Benamou INRIA, INRIA B.P. 05, 7853 Le Cesnay Cedex, France. jean-david.benamou@inria.fr Songting Luo Department of Matematics, Micigan

More information

AMS 147 Computational Methods and Applications Lecture 09 Copyright by Hongyun Wang, UCSC. Exact value. Effect of round-off error.

AMS 147 Computational Methods and Applications Lecture 09 Copyright by Hongyun Wang, UCSC. Exact value. Effect of round-off error. Lecture 09 Copyrigt by Hongyun Wang, UCSC Recap: Te total error in numerical differentiation fl( f ( x + fl( f ( x E T ( = f ( x Numerical result from a computer Exact value = e + f x+ Discretization error

More information

Discontinuous Galerkin Methods for Relativistic Vlasov-Maxwell System

Discontinuous Galerkin Methods for Relativistic Vlasov-Maxwell System Discontinuous Galerkin Metods for Relativistic Vlasov-Maxwell System He Yang and Fengyan Li December 1, 16 Abstract e relativistic Vlasov-Maxwell (RVM) system is a kinetic model tat describes te dynamics

More information

Chapter 5 FINITE DIFFERENCE METHOD (FDM)

Chapter 5 FINITE DIFFERENCE METHOD (FDM) MEE7 Computer Modeling Tecniques in Engineering Capter 5 FINITE DIFFERENCE METHOD (FDM) 5. Introduction to FDM Te finite difference tecniques are based upon approximations wic permit replacing differential

More information

A quadratic interaction estimate for conservation laws: motivations, techniques and open problems*

A quadratic interaction estimate for conservation laws: motivations, techniques and open problems* Bull Braz Mat Soc, New Series 47(2), 589-604 2016, Sociedade Brasileira de Matemática ISSN: 1678-7544 (Print) / 1678-7714 (Online) A quadratic interaction estimate for conservation laws: motivations, tecniques

More information

1 Calculus. 1.1 Gradients and the Derivative. Q f(x+h) f(x)

1 Calculus. 1.1 Gradients and the Derivative. Q f(x+h) f(x) Calculus. Gradients and te Derivative Q f(x+) δy P T δx R f(x) 0 x x+ Let P (x, f(x)) and Q(x+, f(x+)) denote two points on te curve of te function y = f(x) and let R denote te point of intersection of

More information

Differentiation in higher dimensions

Differentiation in higher dimensions Capter 2 Differentiation in iger dimensions 2.1 Te Total Derivative Recall tat if f : R R is a 1-variable function, and a R, we say tat f is differentiable at x = a if and only if te ratio f(a+) f(a) tends

More information

CLEMSON U N I V E R S I T Y

CLEMSON U N I V E R S I T Y A Fractional Step θ-metod for Convection-Diffusion Equations Jon Crispell December, 006 Advisors: Dr. Lea Jenkins and Dr. Vincent Ervin Fractional Step θ-metod Outline Crispell,Ervin,Jenkins Motivation

More information

1 The concept of limits (p.217 p.229, p.242 p.249, p.255 p.256) 1.1 Limits Consider the function determined by the formula 3. x since at this point

1 The concept of limits (p.217 p.229, p.242 p.249, p.255 p.256) 1.1 Limits Consider the function determined by the formula 3. x since at this point MA00 Capter 6 Calculus and Basic Linear Algebra I Limits, Continuity and Differentiability Te concept of its (p.7 p.9, p.4 p.49, p.55 p.56). Limits Consider te function determined by te formula f Note

More information

ERROR BOUNDS FOR FINITE-DIFFERENCE METHODS FOR RUDIN OSHER FATEMI IMAGE SMOOTHING

ERROR BOUNDS FOR FINITE-DIFFERENCE METHODS FOR RUDIN OSHER FATEMI IMAGE SMOOTHING ERROR BOUNDS FOR FINITE-DIFFERENCE METHODS FOR RUDIN OSHER FATEMI IMAGE SMOOTHING JINGYUE WANG AND BRADLEY J. LUCIER Abstract. We bound te difference between te solution to te continuous Rudin Oser Fatemi

More information

Crouzeix-Velte Decompositions and the Stokes Problem

Crouzeix-Velte Decompositions and the Stokes Problem Crouzeix-Velte Decompositions and te Stokes Problem PD Tesis Strauber Györgyi Eötvös Loránd University of Sciences, Insitute of Matematics, Matematical Doctoral Scool Director of te Doctoral Scool: Dr.

More information

Chapter 8. Numerical Solution of Ordinary Differential Equations. Module No. 2. Predictor-Corrector Methods

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

On the best approximation of function classes from values on a uniform grid in the real line

On the best approximation of function classes from values on a uniform grid in the real line Proceedings of te 5t WSEAS Int Conf on System Science and Simulation in Engineering, Tenerife, Canary Islands, Spain, December 16-18, 006 459 On te best approximation of function classes from values on

More information

NUMERICAL DIFFERENTIATION. James T. Smith San Francisco State University. In calculus classes, you compute derivatives algebraically: for example,

NUMERICAL DIFFERENTIATION. James T. Smith San Francisco State University. In calculus classes, you compute derivatives algebraically: for example, NUMERICAL DIFFERENTIATION James T Smit San Francisco State University In calculus classes, you compute derivatives algebraically: for example, f( x) = x + x f ( x) = x x Tis tecnique requires your knowing

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

Notes on Multigrid Methods

Notes on Multigrid Methods Notes on Multigrid Metods Qingai Zang April, 17 Motivation of multigrids. Te convergence rates of classical iterative metod depend on te grid spacing, or problem size. In contrast, convergence rates of

More information

ch (for some fixed positive number c) reaching c

ch (for some fixed positive number c) reaching c GSTF Journal of Matematics Statistics and Operations Researc (JMSOR) Vol. No. September 05 DOI 0.60/s4086-05-000-z Nonlinear Piecewise-defined Difference Equations wit Reciprocal and Cubic Terms Ramadan

More information

A Conservative and Convergent Scheme for Undercompressive Shock Waves

A Conservative and Convergent Scheme for Undercompressive Shock Waves C. Calons a P. Engel b C. Rode b A Conservative and Convergent Sceme for Undercompressive Sock Waves Stuttgart, November 01 a Université Paris Diderot Paris 7 & Laboratoire Jacques-Louis Lions U.M.R. 7598,

More information

The Laplace equation, cylindrically or spherically symmetric case

The Laplace equation, cylindrically or spherically symmetric case Numerisce Metoden II, 7 4, und Übungen, 7 5 Course Notes, Summer Term 7 Some material and exercises Te Laplace equation, cylindrically or sperically symmetric case Electric and gravitational potential,

More information

Chapter 2 Limits and Continuity

Chapter 2 Limits and Continuity 4 Section. Capter Limits and Continuity Section. Rates of Cange and Limits (pp. 6) Quick Review.. f () ( ) () 4 0. f () 4( ) 4. f () sin sin 0 4. f (). 4 4 4 6. c c c 7. 8. c d d c d d c d c 9. 8 ( )(

More information

Numerical Analysis of the Double Porosity Consolidation Model

Numerical Analysis of the Double Porosity Consolidation Model XXI Congreso de Ecuaciones Diferenciales y Aplicaciones XI Congreso de Matemática Aplicada Ciudad Real 21-25 septiembre 2009 (pp. 1 8) Numerical Analysis of te Double Porosity Consolidation Model N. Boal

More information

Explicit and Implicit TVD Schemes for Conservation Laws with Caputo Derivatives

Explicit and Implicit TVD Schemes for Conservation Laws with Caputo Derivatives J Sci Comput 2017 72:291 313 DOI 10.1007/s10915-017-0356-4 Explicit and Implicit TVD Scemes for Conservation Laws wit Caputo Derivatives Jian-Guo Liu 1 Zeng Ma 2 Zennan Zou 3 Received: 20 June 2016 / Revised:

More information

Function Composition and Chain Rules

Function Composition and Chain Rules Function Composition and s James K. Peterson Department of Biological Sciences and Department of Matematical Sciences Clemson University Marc 8, 2017 Outline 1 Function Composition and Continuity 2 Function

More information

LEAST-SQUARES FINITE ELEMENT APPROXIMATIONS TO SOLUTIONS OF INTERFACE PROBLEMS

LEAST-SQUARES FINITE ELEMENT APPROXIMATIONS TO SOLUTIONS OF INTERFACE PROBLEMS SIAM J. NUMER. ANAL. c 998 Society for Industrial Applied Matematics Vol. 35, No., pp. 393 405, February 998 00 LEAST-SQUARES FINITE ELEMENT APPROXIMATIONS TO SOLUTIONS OF INTERFACE PROBLEMS YANZHAO CAO

More information

Numerical Methods for Conservation Laws WPI, January 2006 C. Ringhofer C2 b 2

Numerical Methods for Conservation Laws WPI, January 2006 C. Ringhofer C2 b 2 Numerical Methods for Conservation Laws WPI, January 2006 C. Ringhofer ringhofer@asu.edu, C2 b 2 2 h2 x u http://math.la.asu.edu/ chris Last update: Jan 24, 2006 1 LITERATURE 1. Numerical Methods for Conservation

More information

Math Spring 2013 Solutions to Assignment # 3 Completion Date: Wednesday May 15, (1/z) 2 (1/z 1) 2 = lim

Math Spring 2013 Solutions to Assignment # 3 Completion Date: Wednesday May 15, (1/z) 2 (1/z 1) 2 = lim Mat 311 - Spring 013 Solutions to Assignment # 3 Completion Date: Wednesday May 15, 013 Question 1. [p 56, #10 (a)] 4z Use te teorem of Sec. 17 to sow tat z (z 1) = 4. We ave z 4z (z 1) = z 0 4 (1/z) (1/z

More information

Digital Filter Structures

Digital Filter Structures Digital Filter Structures Te convolution sum description of an LTI discrete-time system can, in principle, be used to implement te system For an IIR finite-dimensional system tis approac is not practical

More information

Continuity and Differentiability Worksheet

Continuity and Differentiability Worksheet Continuity and Differentiability Workseet (Be sure tat you can also do te grapical eercises from te tet- Tese were not included below! Typical problems are like problems -3, p. 6; -3, p. 7; 33-34, p. 7;

More information

Combining functions: algebraic methods

Combining functions: algebraic methods Combining functions: algebraic metods Functions can be added, subtracted, multiplied, divided, and raised to a power, just like numbers or algebra expressions. If f(x) = x 2 and g(x) = x + 2, clearly f(x)

More information

Convergence and Descent Properties for a Class of Multilevel Optimization Algorithms

Convergence and Descent Properties for a Class of Multilevel Optimization Algorithms Convergence and Descent Properties for a Class of Multilevel Optimization Algoritms Stepen G. Nas April 28, 2010 Abstract I present a multilevel optimization approac (termed MG/Opt) for te solution of

More information

5.1 introduction problem : Given a function f(x), find a polynomial approximation p n (x).

5.1 introduction problem : Given a function f(x), find a polynomial approximation p n (x). capter 5 : polynomial approximation and interpolation 5 introduction problem : Given a function f(x), find a polynomial approximation p n (x) Z b Z application : f(x)dx b p n(x)dx, a a one solution : Te

More information

Dedicated to the 70th birthday of Professor Lin Qun

Dedicated to the 70th birthday of Professor Lin Qun Journal of Computational Matematics, Vol.4, No.3, 6, 4 44. ACCELERATION METHODS OF NONLINEAR ITERATION FOR NONLINEAR PARABOLIC EQUATIONS Guang-wei Yuan Xu-deng Hang Laboratory of Computational Pysics,

More information

AN ANALYSIS OF NEW FINITE ELEMENT SPACES FOR MAXWELL S EQUATIONS

AN ANALYSIS OF NEW FINITE ELEMENT SPACES FOR MAXWELL S EQUATIONS Journal of Matematical Sciences: Advances and Applications Volume 5 8 Pages -9 Available at ttp://scientificadvances.co.in DOI: ttp://d.doi.org/.864/jmsaa_7975 AN ANALYSIS OF NEW FINITE ELEMENT SPACES

More information

Convergence of a Central Difference Discretization of ROF Model for Image Denoising

Convergence of a Central Difference Discretization of ROF Model for Image Denoising Convergence of a Central Difference Discretization of ROF Model for Image Denoising Ming-Jun Lai and Jingyue Wang Department of Matematics Te University of Georgia Atens, GA 30602 October 8, 2009 Abstract

More information

An efficient implementation of the divergence free constraint in a discontinuous Galerkin method for magnetohydrodynamics on unstructured meshes

An efficient implementation of the divergence free constraint in a discontinuous Galerkin method for magnetohydrodynamics on unstructured meshes An efficient implementation of te divergence free constraint in a discontinuous Galerkin metod for magnetoydrodynamics on unstructured meses Cristian Klingenberg 1, Frank Pörner 1, and Yinua Xia 2, 1 Department

More information

Recall from our discussion of continuity in lecture a function is continuous at a point x = a if and only if

Recall from our discussion of continuity in lecture a function is continuous at a point x = a if and only if Computational Aspects of its. Keeping te simple simple. Recall by elementary functions we mean :Polynomials (including linear and quadratic equations) Eponentials Logaritms Trig Functions Rational Functions

More information

Parametric Spline Method for Solving Bratu s Problem

Parametric Spline Method for Solving Bratu s Problem ISSN 749-3889 print, 749-3897 online International Journal of Nonlinear Science Vol4202 No,pp3-0 Parametric Spline Metod for Solving Bratu s Problem M Zarebnia, Z Sarvari 2,2 Department of Matematics,

More information

Copyright c 2008 Kevin Long

Copyright c 2008 Kevin Long Lecture 4 Numerical solution of initial value problems Te metods you ve learned so far ave obtained closed-form solutions to initial value problems. A closedform solution is an explicit algebriac formula

More information

A method of Lagrange Galerkin of second order in time. Une méthode de Lagrange Galerkin d ordre deux en temps

A method of Lagrange Galerkin of second order in time. Une méthode de Lagrange Galerkin d ordre deux en temps A metod of Lagrange Galerkin of second order in time Une métode de Lagrange Galerkin d ordre deux en temps Jocelyn Étienne a a DAMTP, University of Cambridge, Wilberforce Road, Cambridge CB3 0WA, Great-Britain.

More information