Abstract
This contribution is concerned with aposteriori error analysis of discontinuous Galerkin (dG) schemes approximating hyperbolic conservation laws. In the scalar case the aposteriori analysis is based on the \(L^1\) contraction property and the doubling of variables technique. In the system case the appropriate stability framework is in \(L^2,\) based on relative entropies. It is only applicable if one of the solutions, which are compared to each other, is Lipschitz. For dG schemes approximating hyperbolic conservation laws neither the entropy solution nor the numerical solution need to be Lipschitz. We explain how this obstacle can be overcome using a reconstruction approach which leads to an aposteriori error estimate.
Access provided by Autonomous University of Puebla. Download conference paper PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
1 Introduction
We investigate numerical approximations of systems of hyperbolic conservation laws. The problem has the general form
where \(\mathbf{u}(t,x)\in U,\) for some state space \(U \subset \mathbb {R}^d\) and we assume the flux function satisfies \(\mathbf{f} \in C^2(U,\mathbb {R}^d).\) We study semi-discretisations of (1) by the discontinuous Galerkin (dG) method and derive an aposteriori error estimate. The discretisation of (1) by finite volume and dG schemes is standard, as it is well known that solutions may develop discontinuities in finite time. However, the aposteriori analysis has been only developed for special cases. In [9] aposteriori error estimates (in \(L^1\)) are derived in the scalar case. These arguments were generalized to fully applicable Runge–Kutta dG schemes in the scalar case in [4]. As pointed out in [12] these estimates are based on exploiting the \(L^1\)-contraction property of scalar hyperbolic conservation laws and the doubling of variables technique. The work [8], which establishes aposteriori error estimates for Friedrichs systems, is in the same spirit, but replaces the \(L^1\) contraction framework by the relative entropy technique, which dates back to [2, 5].
A different approach is the construction of localized aposteriori error estimates via adjoint problems for space-time dG schemes in [7]. Nodal super-convergence of dG schemes was investigated in a sequence of works by Adjerid and coworkers, see [1] and references therein.
All the estimates mentioned before restrict themselves to one of the following two cases:
-
1.
Equation (1) is required to be a scalar equation or a Friedrichs system.
-
2.
Only continuous solutions \(\mathbf{u}\) of (1) are considered.
In case of the estimates using adjoint problems the latter restriction is introduced via the stability assumptions on the solutions of the adjoint problems.
The main difficulty in constructing error estimates in the spirit of [4, 8, 9] for (multidimensional) systems of hyperbolic conservation laws without assuming (Lipschitz) continuity of solutions is encapsulated by the following: The appropriate stability theory for this class of PDE is the relative entropy technique. It has certain features (in contrast to the \(L^1\)-contraction stability theory available for scalar conservation laws, see [3, Chap. 6.2]) which make its use for constructing aposteriori error estimates more difficult:
-
1.
It cannot be used to compare two discontinuous solutions but it can only compare a Lipschitz continuous solution to another (possibly discontinuous) one. At the same time the numerical solution obtained from a finite volume or dG scheme will be discontinuous and the exact (entropy) solution might also be discontinuous, even for smooth initial data.
-
2.
It leads to an \(L^2\)-stability framework which is difficult to use with measure valued residuals, which may not belong to \(L^2.\)
We will sketch how to overcome these difficulties for dG spatial discretisations in one space dimension by a reconstruction technique. The details of our arguments, in particular the proofs of Lemma 1 and Theorem 1, can be found in [6]. Our error estimate is expected to be of optimal order (determined by the order of the dG scheme and the regularity of the solution) in the case the entropy solution is Lipschitz continuous. In the case the entropy solution is not Lipschitz the error estimate is not expected to converge, see Remark 7, but in that case uniqueness of the entropy solution cannot be guaranteed anyway.
To avoid any difficulties introduced by boundary conditions, we consider the following version of (1):
for some initial data \(\varvec{u}_0 \in L^\infty (S^1,U),\) where \(S^1\) denotes the periodic unit interval with the endpoints being identified with each other. We will assume that (2) is endowed with (at least) one convex entropy/entropy flux pair \((\eta ,q),\) i.e. \(q,\eta \in C^1(U,\mathbb {R}),\) \(\eta \) is strictly convex and
where \(\mathrm{D }\) denotes the Jacobian/gradient. For systems of hyperbolic conservation laws there is (usually) only one (physical) entropy/entropy flux pair, while in the scalar case every convex function is an entropy. Equation (3) gives rise to the additional conservation law
for every strong solution \(\mathbf{u}\) of (2). This is crucial for defining entropy solutions:
Definition 1
(entropy solution) A function \(\mathbf{u}\in L^\infty ([0,\infty )\times S^1,U)\) is called an entropy solution of the initial boundary value problem (2), with respect to the entropy/entropy-flux pair \((\eta ,q)\), if
and
We consider approximations of (2) by a class of semi-discrete dG schemes using Godunov type numerical fluxes in Sect. 2. In Sect. 3 we will introduce an explicitly computable reconstruction \(\hat{\mathbf{u}}\) of the numerical solution \(\mathbf{u}_h.\) The reconstruction \(\hat{\mathbf{u}}\) is continuous and satisfies a perturbed version of (2) with residuals in \(L^2.\) We state an aposteriori estimate, based on the relative entropy framework, of the error between the exact solution \(\mathbf{u}\) and the reconstruction \(\hat{\mathbf{u}}\) in Sect. 4. This implies an explicitly computable estimate for the difference of the entropy solution \(\mathbf{u}\) and the numerical solution \(\mathbf{u}_h\), see Theorem 1. We will compare this result to the result from [4] in the scalar case.
2 Semi-Discrete Discontinuous Galerkin Schemes
Before we state the dG schemes under consideration, let us fix some notation. We will discretise (2) in space using a consistent dG scheme. Let \(I:=[0,1]\) be the unit interval and choose \(0 = x_0 < x_1 < \dots < x_N = 1.\) By \(I_n=[x_n,x_{n+1}]\) we denote the \(n\)–th sub-interval and by \(h_n:= x_{n+1}-x_n\) its size. Let \(\mathbb {P}_{p}(I)\) be the space of polynomials of degree less than or equal to \(p\) on \(I\), then we denote
where \(\mathbf{g} = (g_1,\dots ,g_d)^T\), is the usual space of piecewise \(p\)–th degree polynomials for vector valued functions over \(I\). In addition, we define jump operators such that
We will examine the following class of semi-discrete numerical schemes where \(\mathbf{u}_h \in C^1([0,T),\mathbb {V}_p)\) is determined such that
In the sequel we will assume that (9) has a solution and, in particular, that \(\mathbf{u}_h\) takes values in \(U\). We also set
to account for the periodic boundary conditions. In (9) \(\mathbf{F}: U^2 \subset \mathbb {R}^{2d} \rightarrow \mathbb {R}^d\) is a numerical flux function. We restrict our attention to a certain class of numerical flux functions. We impose that there exists a function
and that there exists a constant \(L>0\) such that \(\mathbf{w}\) satisfies
Remark 1
The restriction of the flux functions, in general, restricts our analysis to fluxes of Godunov type. Still, fluxes of Roe or Osher-Solomon type fall into this framework in some situations. We need this restriction in order to define the reconstructions in Sect. 3. If we do not have this restriction we may still define reconstructions but the error estimate will no longer be of optimal order for smooth solutions of (2).
3 Reconstructions
In order to derive error estimates for the scheme (9) we introduce reconstructions, which are similar to those used for dG schemes in time in [11], denoted by \(\hat{\mathbf{u}}\) and \(\hat{\mathbf{f}}\). For brevity we will omit the time dependency of all quantities in this section.
Definition 2
(Reconstruction of \( u_h\)) The reconstruction \(\hat{\mathbf{u}}\) is the unique element of \(\mathbb {V}_{p+1}\) such that
and
recalling that \(\mathbf{u}_h(x_0^-):=\mathbf{u}_h(x_N^-),\) and \(\mathbf{u}_h(x_N^+):=\mathbf{u}_h(x_0^+)\).
Definition 3
(Reconstruction of \(f(u_h)\)) The reconstruction \(\hat{\mathbf{f}}\) is the unique element of \(\mathbb {V}_{p+1}\) such that
and
Lemma 1
(Properties of the reconstruction) The reconstructions \(\hat{\mathbf{u}}\) and \(\hat{\mathbf{f}}\) are uniquely defined and continuous. Moreover, the reconstructions are explicitly and locally computable.
Proof
The proof of uniqueness and continuity of \(\hat{\mathbf{u}}\) is straightforward. To assert the continuity of \(\hat{\mathbf{f}}\), we use an analagous argument to that of [11, Lemma 2.1] by testing (15) with piecewise constant functions.
Using the specific reconstruction (15) and (9) we see that
As \((\mathbf{u}_h)_t\) and \(\hat{\mathbf{f}}_x\) are piecewise polynomials of degree \(p\) this implies the pointwise equation
which is equivalent to
Remark 2
Equation (19) shows that \(\hat{\mathbf{u}}\) solves a perturbed version of (1). As \(\mathbf{f}(\hat{\mathbf{u}})\) and \(\hat{\mathbf{f}}\) are continuous and piecewise polynomial, \( \mathbf{R}_h (t,\cdot )\in L^2(S^1)\) for all \(t >0.\) In addition \(\mathbf{R}_h\) is explicitly computable.
Remark 3
The reconstruction \(\hat{\mathbf{u}} \) is Lipschitz continuous because it is piecewise polynomial and continuous. However, it must be noted that it is not clear whether the Lipschitz constant of \(\hat{\mathbf{u}} \) is uniformly bounded if \(h\) goes to zero.
Remark 4
It might be expected that the \(x\)-derivatives appearing in the definition of \(\mathbf{R}_h\) in (19) might lead to a suboptimal order of the error estimate. This is precisely the point at which we need assumption (11) in order to obtain an error estimate of optimal order. For details we refer to [6].
Due to Remarks 2 and 3 the relative entropy framework can be used to estimate the difference between \(\hat{\mathbf{u}}\) and the entropy solution \(\mathbf{u}\) in terms of \(\mathbf{R}_h\) and \(\hat{\mathbf{u}} \) even if \(\mathbf{u}\) is discontinuous. Once we obtained such an estimate we can estimate the error of the numerical scheme by
4 The Aposteriori Error Estimate
In the remainder of this paper we make the following assumption on the flux and the entropy which is standard in relative entropy arguments. We will assume that there are constants \(0 < C_{\overline{\mathbf{f}}}< \infty \) and \(0< C_{\underline{\eta }}< C_{\overline{\eta }}< \infty \) such that
where \(|\cdot |\) is the Euclidean norm for vectors, and \(\mathrm{H }[\cdot ]\) denotes the Hessian of a function or vector field.
Using an analogous argument to [3, Theorem: 5.3.1] we infer
Theorem 1
(Aposteriori error estimate) Let \(\mathbf{f} \in {W_{2}^{\infty }}(U,\mathbb {R}^d)\) satisfy (21). Let \(\mathbf{u}\) be an entropy solution of (2) with periodic boundary conditions. Then, for \(0 \le t \le T\) the error between the numerical solution \(\mathbf{u}_h,\) given by (9), and \(\mathbf{u}\) satisfies
where \(\hat{\mathbf{u}}\) is the reconstruction of \(\mathbf{u}_h\) given in Definition (2) and \(\mathbf{R}_h\) is defined in (19).
Remark 5
Note that all the terms on the right hand side of (22) are explicitly computable. Provided \(\Vert \hat{\mathbf{u}}_x(s,\cdot )\Vert _{L^{\infty }(S^1)}\) is uniformly bounded in \(h\) the right hand side of (22) is expected to be of optimal order. This is expected in case of an at least Lipschitz continuous entropy solution. This is also confirmed by numerical experiments, see [6].
Remark 6
In [6] it is shown that \(\Vert \mathbf{R}_h\Vert _{L^{2}((0,t)\times S^1)}^2\) can be estimated without explicitly computing \(\hat{\mathbf{u}}.\) The estimate [6, Lemma 5.6] is rather technical but it shows that for every \(t \in (0,T)\)
where \(C>0\) is a computable constant and the “\(\lesssim \)” in (23) should indicate that there are additional terms needed to estimate \(\Vert \mathbf{R}_h\Vert _{L^2(S^1)} \) which are of the same order as the right hand side of (23).
Remark 7
Let us compare the estimate which is obtained by combining Theorem 1 and (23) to the estimate which is obtained if the arguments from [4] are applied to our scheme (9) in the scalar case:
where \(\bar{u}_h\) is the intervalwise mean of \(u_h, \) \(h_{n+\frac{1}{2}} = \tfrac{1}{2}(h_n + h_{n+1})\) and
where \(K_1,K_2\) are computable constants. In this comparison obviously the two estimators are rather different. The two most important differences making (24) preferable in the scalar case are the following:
-
1.
The estimator in (24) is proportional to \(\sqrt{t}\) while the estimator in (22) depends exponentially on time.
-
2.
The estimator in (24) is expected to converge even for discontinuous entropy solutions. In contrast the estimator in (22) depends exponentially on \(\Vert \hat{\mathbf{u}}_x\Vert _{L^\infty ([0,t]\times S^1)}.\) For discontinuous entropy solutions \(\Vert \hat{\mathbf{u}}_x\Vert _{L^\infty ([0,t]\times S^1)}\) will be of order \(h^{-1}.\) Thus, for discontinuous entropy solutions, the right hand of side (22) will (at best) behave like \( h^{2p+2} e^{-1/h}\) which blows up for \(h \rightarrow 0.\) Therefore, while (22) indeed holds even for discontinuous \(\mathbf{u}\), the estimator will not converge for \(h \rightarrow 0\) and its practical use is limited in that case.
Both of these observations are consequences of the use of the relative entropy. We see that it provides a much weaker kind of stability that the \(L^1\)-contraction property does for scalar equations.
Remark 8
(Higher space dimensions and time-discretisation) There are two immediate directions for generalisation of the results stated here. The first direction is to derive aposteriori error estimates for fully discrete Runge-Kutta-discontinuous Galerkin schemes. We are optimistic that similar methods to those used in [10] will permit us to obtain such estimates. A special emphasis in this analysis should be put on considering explicit discretisations in time as they are most commonly used in practice.
The second direction is the generalisation to several space dimensions. The crucial issue there is to find appropriate reconstructions of the numerical solution as well as of the numerical fluxes. This is the subject of ongoing research. Once such reconstructions are determined the other arguments presented here can immediately be applied, as they are by no means restricted to the one dimensional case.
References
Baccouch, M., Adjerid, S.: Discontinuous Galerkin error estimation for hyperbolic problems on unstructured triangular meshes. Comput. Methods Appl. Mech. Eng. 200(1–4), 162–177 (2011)
Dafermos, C.M.: The second law of thermodynamics and stability. Arch. Ration. Mech. Anal. 70(2), 167–179 (1979)
Dafermos, C.M.: Hyperbolic conservation laws in continuum physics, Grundlehren der Mathematischen Wissenschaften [Fundamental Principles of Mathematical Sciences], vol. 325. Springer, Berlin (2010)
Dedner, A., Makridakis, C., Ohlberger, M.: Error control for a class of Runge-Kutta discontinuous Galerkin methods for nonlinear conservation laws. SIAM J. Numer. Anal. 45(2), 514–538 (2007)
DiPerna, R.J.: Uniqueness of solutions to hyperbolic conservation laws. Indiana Univ. Math. J. 28(1), 137–188 (1979)
Giesselmann, J., Makridakis, C., Pryer, T.: Aposteriori analysis of discontinuous Galkerin schemes for systems of hyperbolic conservation laws. In preparation
Hartmann, R., Houston, P.: Adaptive discontinuous Galerkin finite element methods for nonlinear hyperbolic conservation laws. SIAM J. Sci. Comput. 24(3), 979–1004 (electronic) (2002)
Jovanović, V., Rohde, C.: Finite-volume schemes for Friedrichs systems in multiple space dimensions: a priori and a posteriori error estimates. Numer. Methods Partial Differ. Equ. 21(1), 104–131 (2005)
Kröner, D., Ohlberger, M.: A posteriori error estimates for upwind finite volume schemes for nonlinear conservation laws in multidimensions. Math. Comp. 69(229), 25–39 (2000)
Makridakis, C.: Space and time reconstructions in a posteriori analysis of evolution problems. In: ESAIM proceedings, vol. 21, pp. 31–44. (2007) [Journées d’Analyse Fonctionnelle et Numérique en l’honneur de Michel Crouzeix], (EDP Sci., Les Ulis (2007))
Makridakis, C., Nochetto, R.H.: A posteriori error analysis for higher order dissipative methods for evolution problems. Numer. Math. 104(4), 489–514 (2006)
Ohlberger, M.: A review of a posteriori error control and adaptivity for approximations of non-linear conservation laws. Internat. J. Numer. Methods Fluids 59(3), 333–354 (2009)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Giesselmann, J., Pryer, T. (2014). On Aposteriori Error Analysis of DG Schemes Approximating Hyperbolic Conservation Laws. In: Fuhrmann, J., Ohlberger, M., Rohde, C. (eds) Finite Volumes for Complex Applications VII-Methods and Theoretical Aspects. Springer Proceedings in Mathematics & Statistics, vol 77. Springer, Cham. https://doi.org/10.1007/978-3-319-05684-5_30
Download citation
DOI: https://doi.org/10.1007/978-3-319-05684-5_30
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-05683-8
Online ISBN: 978-3-319-05684-5
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)