Finite volume method for conservation laws V

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

Finite Volume Schemes: an introduction

Numerical schemes for short wave long wave interaction equations

Numerical Methods for Hyperbolic Conservation Laws Lecture 4

CONVERGENCE OF THE LAX-FRIEDRICHS SCHEME AND STABILITY FOR CONSERVATION LAWS WITH A DISCONTINUOUS SPACE-TIME DEPENDENT FLUX

Info. No lecture on Thursday in a week (March 17) PSet back tonight

AMath 574 February 11, 2011

LARGE-TIME ASYMPTOTICS, VANISHING VISCOSITY AND NUMERICS FOR 1-D SCALAR CONSERVATION LAWS

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

ON SCALAR CONSERVATION LAWS WITH POINT SOURCE AND STEFAN DIEHL

LOCAL NEWS. PAVBBS any at this offioe. TAKE NOT IUE. AH accounts due the. firm qf MORRIS A' III HE mutt be paid to

Existence Theory for Hyperbolic Systems of Conservation Laws with General Flux-Functions

Notes: Outline. Shock formation. Notes: Notes: Shocks in traffic flow

FLUX IDENTIFICATION IN CONSERVATION LAWS 2 It is quite natural to formulate this problem more or less like an optimal control problem: for any functio

Math Partial Differential Equations 1

On Convergence of Minmod-Type Schemes

ENO and WENO schemes. Further topics and time Integration

Positivity-preserving high order schemes for convection dominated equations

1. Introduction. We are interested in the scalar hyperbolic conservation law

The one-dimensional equations for the fluid dynamics of a gas can be written in conservation form as follows:

Numerische Mathematik

Variational formulation of entropy solutions for nonlinear conservation laws

FDM for wave equations

Numerical Schemes Applied to the Burgers and Buckley-Leverett Equations

Bound-preserving high order schemes in computational fluid dynamics Chi-Wang Shu

Entropy stable schemes for degenerate convection-diffusion equations

Definition and Construction of Entropy Satisfying Multiresolution Analysis (MRA)

Pointwise convergence rate for nonlinear conservation. Eitan Tadmor and Tao Tang

Universität des Saarlandes. Fachrichtung 6.1 Mathematik

A Very Brief Introduction to Conservation Laws

A posteriori analysis of a discontinuous Galerkin scheme for a diffuse interface model

Basics on Numerical Methods for Hyperbolic Equations

Lois de conservations scalaires hyperboliques stochastiques : existence, unicité et approximation numérique de la solution entropique

Entropy and the numerical integration of conservation laws

Generalized Riemann Problems: From the Scalar Equation to Multidimensional Fluid Dynamics

CONVERGENCE OF RELAXATION SCHEMES FOR HYPERBOLIC CONSERVATION LAWS WITH STIFF SOURCE TERMS

Finite difference method for elliptic problems: I

A minimum entropy principle of high order schemes for gas dynamics. equations 1. Abstract

VISCOUS FLUX LIMITERS

WEAK ASYMPTOTIC SOLUTION FOR A NON-STRICTLY HYPERBOLIC SYSTEM OF CONSERVATION LAWS-II

Finite Di erence Approach for the Measure Valued Vanishing Dispersion Limit of Burgers Equation

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

Attribution-NonCommercial-NoDerivs 2.0 KOREA. Share copy and redistribute the material in any medium or format

LOWELL JOURNAL NEWS FROM HAWAII.

Local EleveD Wins Spectacular Game

A Bound-Preserving Fourth Order Compact Finite Difference Scheme for Scalar Convection Diffusion Equations

POSITIVITY PROPERTY OF SECOND-ORDER FLUX-SPLITTING SCHEMES FOR THE COMPRESSIBLE EULER EQUATIONS. Cheng Wang. Jian-Guo Liu

OVER 150 J-HOP To Q JCATS S(MJ) BY NOON TUESDAY CO-ED S LEAGUE HOLDS MEETING

MAXIMUM PRINCIPLE AND CONVERGENCE OF CENTRAL SCHEMES BASED ON SLOPE LIMITERS

CLASSROOM NOTES PART II: SPECIAL TOPICS. APM526, Spring 2018 Last update: Apr 11

Order of Convergence of Second Order Schemes Based on the Minmod Limiter

A positivity-preserving high order discontinuous Galerkin scheme for convection-diffusion equations


Non-linear Scalar Equations

Fractional Roman Domination

Non-linear Methods for Scalar Equations

u,+f(u)x=o, A GEOMETRIC APPROACH TO HIGH RESOLUTION TVD SCHEMES*

30 crete maximum principle, which all imply the bound-preserving property. But most

Grand Bapids Business Directory.

H r# W im FR ID A Y, :Q q ro B E R 1 7,.,1 0 1 S. NEPTUNE TH RHE. Chancelor-Sherlll Act. on Ballot at ^yisii/

Antony Jameson. AIAA 18 th Computational Fluid Dynamics Conference

Lecture 5.7 Compressible Euler Equations

Introduction to the Finite Volumes Method. Application to the Shallow Water Equations. Jaime Miguel Fe Marqués

AMS 529: Finite Element Methods: Fundamentals, Applications, and New Trends

Convergence of Finite Volumes schemes for an elliptic-hyperbolic system with boundary conditions

Entropy stable high order discontinuous Galerkin methods. for hyperbolic conservation laws

Chp 4: Non-linear Conservation Laws; the Scalar Case. By Prof. Dinshaw S. Balsara

CONVERGENCE RATE OF APPROXIMATE SOLUTIONS TO CONSERVATION LAWS WITH INITIAL RAREFACTIONS

Galilean invariance and the conservative difference schemes for scalar laws

Rearrangement on Conditionally Convergent Integrals in Analogy to Series

Large Time Step Scheme Behaviour with Different Entropy Fix

Weak Formulation of Elliptic BVP s

Consistency analysis of a 1D Finite Volume scheme for barotropic Euler models

Finite Volume Method

Weighted ENO Schemes

Modeling and Numerical Approximation of Traffic Flow Problems

Runge Kutta Discontinuous Galerkin Methods for Convection-Dominated Problems

CS205B / CME306 Homework 3. R n+1 = R n + tω R n. (b) Show that the updated rotation matrix computed from this update is not orthogonal.

Abstract. A front tracking method is used to construct weak solutions to

MATH 217A HOMEWORK. P (A i A j ). First, the basis case. We make a union disjoint as follows: P (A B) = P (A) + P (A c B)

A review of stability and dynamical behaviors of differential equations:

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

Entropic Schemes for Conservation Laws

Coupling algorithms for hyperbolic systems

Numerical methods for conservation laws with a stochastically driven flux

Finite Elements. Colin Cotter. February 22, Colin Cotter FEM

Numerische Mathematik

M545 Homework 8. Mark Blumstein. December 9, [f (x)] 2 dx = 1. Find such a function if you can. If it cannot be found, explain why not.

The intersection and the union of the asynchronous systems

Hyperbolic Systems of Conservation Laws

Skr. K. Nor. Vidensk. Selsk., 2003, no. 3, 49 pp

Notes on Computational Mathematics

Problem set 3: Solutions Math 207B, Winter Suppose that u(x) is a non-zero solution of the eigenvalue problem. (u ) 2 dx, u 2 dx.

Spatial Discretization

Riemann Solvers and Numerical Methods for Fluid Dynamics

Spectral Properties of Elliptic Operators In previous work we have replaced the strong version of an elliptic boundary value problem

Evaluation of The Necessary of Agriculture Public Expenditure for Poverty Reduction and Food Security in Benin

Convergence of an immersed interface upwind scheme for linear advection equations with piecewise constant coefficients I: L 1 -error estimates

Existence result for the coupling problem of two scalar conservation laws with Riemann initial data

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

Transcription:

Finite volume method for conservation laws V Schemes satisfying entropy condition Praveen. C praveen@math.tifrbng.res.in Tata Institute of Fundamental Research Center for Applicable Mathematics Bangalore 560065 http://math.tifrbng.res.in February 1, 013 1 / 18

Entropy condition Let U(u) be any convex entropy of the scalar conservation law with associated entropy flux F (u), i.e., u t + x f(u) = 0 U (u)f (u) = F (u) Then the unique entropy solution of the conservation law satisfies in the sense of distributions U t + x F (u) 0 / 18

Definition (Entropy consistent numerical scheme) The difference scheme H is said to be consistent with the entropy condition if there exists a continuous function G : R k R which satisfies the following requirements (1) consistency with the entropy flux F () cell entropy inequality G(v,..., v) = F (v) U(v n+1 j ) U(vj n) + G(vn j k+1,..., vn j+k ) G(vn j k,..., vn j+k 1 ) 0 t x The function G is called the numerical entropy flux. If we set U n j = U(v n j ), G n j+ 1 = G(v n j k+1,..., v n j+k) then we have to verify that U n+1 j Uj n λ(g n j+ G n 1 j ) 1 3 / 18

When the scheme is consistent with any entropy function, we say that it is an entropy scheme. Proposition 4.1 (GR1, Chap. 3) Let H be a 3-point difference scheme with C numerical flux which is consistent with any entropy condition. Then it is at most first order accurate. Theorem Assume that the hypothesis of Lax-Wendroff theorem hold. Assume moreover that the scheme is consistent with any entropy condition. Then the limit u is the unique entropy solution of the conservation law. Theorem A monotone consistent scheme is consistent with any entropy condition. Proof: It is enough to check the entropy condition for the Kruzkov s entropy functions: for any l R U(u) = u l, F (u) = sign(u l)(f(u) f(l)) 4 / 18

Set a b = min(a, b), a b = max(a, b) and define the numerical entropy flux G as follows G(v k+1,..., v k ) = g(v k+1 l,..., v k l) g(v k+1 l,..., v k l) We first prove the following identity v j l λ(g j+ 1 G j 1 ) = H(v j k l,..., v j+k l) H(v j k l,..., v j+k l) By definition of G j+ 1 G j+ 1 G j 1 = [g(v j k+1 l,..., v j+k l) g(v j k+1 l,..., v j+k l)] [g(v j k l,..., v j+k 1 l) g(v j k l,..., v j+k 1 l)] = [g(v j k+1 l,..., v j+k l) g(v j k l,..., v j+k 1 l)] [g(v j k+1 l,..., v j+k l) g(v j k l,..., v j+k 1 l)] and using the finite volume scheme, we get λ[g j+ 1 j 1 ] = [H(v j k l,..., v j+k l) v j l] [H(v j k l,..., v j+k l) v j l] 5 / 18

which gives the identity we wanted to show since v j l v j l = v j l Now since H is monotone and consistent H(v j k l,..., v j+k l) H(v j k,..., v j+k ) H(l,..., l) = v n+1 j In the same way we obtain H(v j k l,..., v j+k l) v n+1 j Combining the above results we verify the entropy condition l v n+1 j l vj n l + λ(g n j+ G n 1 j ) 0 1 The consistency condition of G is readily satisfied since G(v,..., v) = g(v l,..., v l) g(v l,..., v l) = f(v l) f(v l) = sign(v l)(f(v) f(l)) = F (u) l 6 / 18

Definition (E-scheme) A consistent, conservative scheme is called an E-scheme if its numerical flux satisfies sign(v j+1 v j )(g j+ 1 f(u)) 0 for all u between v j and v j+1. Remark: Note that an E-scheme is essentially 3-point. Indeed letting v j+1 v j with first v j+1 v j and then with v j+1 v j shows that g is essentially 3-point. Remark: A 3-point monotone scheme is an E-scheme. Since g(u, v) is non-decreasing in u and non-increasing in v, we obtain and therefore g(u, v) g(u, w) g(w, w) = f(w) if u w v g(u, v) g(w, v) g(w, w) = f(w) if u w v sign(v u)(g(u, v) f(w)) 0, for all w between u and v In particular, the Godunov scheme is an E-scheme under CFl 1. 7 / 18

Lemma Assume that CFL 1. Then E-fluxes are characterized by { gj+ 1 gg j+ 1 g j+ 1 gg j+ 1 if v j < v j+1 if v j > v j+1 where g G stands for Godunov numerical flux. Proof: Under CFL 1, the Godunov flux is given by { g G min u [vj,v j+ = j+1] f(u) if v j < v j+1 1 max u [vj+1,v j] f(u) if v j v j+1 Assume v j < v j+1. Then E-flux satisfies g j+ 1 f(u), v j u v j+1 Assume v j > v j+1. Then E-flux satisfies v j+1 u v j g j+ 1 f(u), 8 / 18

Lemma Assume that CFL 1. E-schemes are characterized by 0 Q G j+ 1 Q j+ 1, j Z Proof: Assume v j < v j+1. Then for E-scheme g j+ 1 gg j+ 1 1 (f j + f j+1 ) 1 Q j+ 1 (v j+1 v j ) 1 (f j + f j+1 ) 1 QG j+ (v 1 j+1 v j ) Proposition An E-scheme with differentiable numerical flux is at most first order accurate. 9 / 18

Theorem (Viscous form and entropy condition) Assume that the CFL condition λ max a(u) 1 holds. An E-scheme whose coefficient of numerical viscosity satisfies Q G j+ 1 Q j+ 1 1 is consistent with any entropy condition. The proof requires two lemmas which we first prove. The basic idea is to write any E-scheme as a convex combination of the Godunov scheme and a modified Lax-Friedrichs scheme, both of which satisfy entropy condition. 10 / 18

Lemma (Godunov scheme) Assume that CFL 1. The Godunov scheme can be written in the following way where H G (v j 1, v j, v j+1 ) = 1 (vg + v G+ ) j 1 j+ 1 v G j 1 v G+ j+ 1 = = x x x 0 0 x w R (x/ t; v j 1, v j )dx = v j λ(f j g G j 1 ) w R (x/ t; v j, v j+1 )dx = v j + λ(f j g G j+ 1 ) Moreover if (U, F ) is any entropy pair, we have U(v G± ) U(v j± 1 j ) ± λ[f (v j ) G G j± ] 1 where G G (u, v) = F (w R (0; u, v)) 11 / 18

Proof: The formulae for v G± follow from the derivation of the Godunov j± 1 scheme. Now since U is a convex function, we obtain by Jensen s inequality U ( x x 0 w R (x/ t; v j 1, v j )dx ) x U(w R (x/ t; v j 1, v j ))dx x 0 Since w R (x/ t; v j 1, v j ) is by definition the entropy solution of the Riemann problem u t + x u(x, 0) = it satisfies an entropy inequality U(u) t f(u) = 0, { v j 1 x < 0 v j x > 0 + F (u) x t [0, t] 0 1 / 18

Integrating this last inequality on the domain (x j 1, x j) (0, t) we get In the same way we have x U(v G ) U(w j 1 R (x/ t; v j 1, v j ))dx x 0 U(v j ) λ[f (v j ) G G j ] 1 U(v G+ 0 ) U(w j+ 1 R (x/ t; v j, v j+1 ))dx x x U(v j ) + λ[f (v j ) G G j+ ] 1 Remark: This also shows that Godunov scheme satisfies the entropy condition associated with (U, F ) since U(H G (v j 1, v j, v j+1 )) 1 [U(vG ) + U(v G+ )] j 1 j+ 1 U(v j ) λ[g G j+ G G 1 j ] 1 13 / 18

Lemma (Lax-Friedrichs modified) Consider the 3-point scheme H M (v j 1, v j, v j+1 ) = 1 4 (v j 1 + v j + v j+1 ) 1 λ(f j+1 f j 1 ) Then under the condition CFL 1, we can write where v M j 1 v M+ j+ 1 = = H M (v j 1, v j, v j+1 ) = 1 (vm j 1 + v M+ j+ 1 ) x 1 w R (x/ t; v j 1, v j )dx = 1 x x (v j + v j 1 ) λ(f j f j 1 ) 1 x x x Moreover if (U, F ) is any entropy pair, we have where w R (x/ t; v j, v j+1 )dx = 1 (v j + v j+1 ) λ(f j+1 f j ) U(v M± j± 1 ) U(v j ) ± λ[f (v j ) G M j± 1 ] G M (u, v) = 1 1 (F (u) + F (v)) (U(v) U(u)) 4λ 14 / 18

Proof: Under the condition CFL 1, we obtain the desired results by integrating the conservation law over the domains (x j 1, x j ) (t n, t n+1 ) and (x j, x j+1 ) (t n, t n+1 ). We get 0 = = tn+1 xj t n x x t 0 x j 1 ( wr t + ) x f(w R) dxdt w R (x/ t; v j 1, v j )dx x (v j + v j 1 ) + [f(w R ( x/(t); v j 1, v j )) f(w R ( x/(t); v j 1, v j ))]dt But the waves from x j 1 do not reach x j 1, x j so that w R ( x/(t); v j 1, v j ) = v j, w R ( x/(t); v j 1, v j ) = v j 1 This proves the formulae for v M±. j± 1 15 / 18

Since w R is the entropy solution, we integrate the entropy inequality over (x j 1, x j ) (t n, t n+1 ) and using Jensen s inequality U(v M ) j 1 x 1 U(w R (x/ t; v j 1, v j ))dx x x 1 (U(v j) + U(v j 1 )) λ(f (v j ) F (v j 1 )) = U(v j ) λ(f (v j ) G M j 1 ) Remark: The modified Lax-Friedrichs scheme is consistent with any entropy condition with numerical flux G M since U(H M (v j 1, v j, v j+1 )) 1 (U(vM ) + U(v M+ )) j 1 j+ 1 U(v j ) λ[g M j+ G M 1 j ] 1 Note that the numerical viscosity of this scheme is Q M j+ 1 = 1 16 / 18

Proof of Theorem (Viscous form and entropy condition): Let us write the scheme in viscous form v n+1 j = vj n λ (f j+1 n fj 1) n + 1 (Qn j+ v n 1 j+ Q n 1 j v n 1 j ) 1 and in averaged form where v n+1 j = 1 (v + v + ) j 1 j+ 1 v j 1 v + j+ 1 = v j λ(f j f j 1 ) Q j 1 v j 1 = v j λ(f j+1 f j ) + Q j+ 1 v j+ 1 We can write the Godunov and modified Lax-Friedrich schemes in the same form with superscript G and M. Now since Q M = 1 and Q G Q Q M = 1 we can write, with some 0 θ j+ 1 1 17 / 18

It follows that Q j+ 1 = θ j+ 1 QG j+ + (1 θ 1 j+ 1 )QM j+, j Z 1 v ± j± 1 = θ j± 1 vg± + (1 θ j± 1 j± 1 )vm± j± 1 If (U, F ) is any entropy pair, then due to convexity of U where U(v n+1 j ) 1 U(v j 1 ) + 1 U(v+ j+ 1 ) 1 θ j 1 U(vG ) + 1 j 1 (1 θ j 1 )U(vM ) + j 1 1 θ j+ 1 U(vG+ j+ 1 U(v j ) λ(g j+ 1 G j 1 ) ) + 1 (1 θ j+ 1 )U(vM+ ) j+ 1 G j+ 1 = θ j+ 1 GG j+ + (1 θ 1 j+ 1 )GM j+ 1 is a consistent entropy flux associated with the E-scheme under consideration. Remark: Under the conditions of the above theorem Q G Q 1, the E-scheme is also TVD and L stable. 18 / 18