Table of Contents Author Guidelines Submit a Manuscript
Advances in Mathematical Physics
Volume 2017, Article ID 9736818, 11 pages
https://doi.org/10.1155/2017/9736818
Research Article

Error Estimates on Hybridizable Discontinuous Galerkin Methods for Parabolic Equations with Nonlinear Coefficients

1Department of Mathematics, Korea Military Academy, Hwarangro 564, Seoul 01805, Republic of Korea
2Department of Mathematics, Korea University, Anamro 145, Seoul 02841, Republic of Korea

Correspondence should be addressed to Hyung Kyu Jun; rk.ca.amk@7230nujkh

Received 11 November 2016; Revised 24 March 2017; Accepted 11 April 2017; Published 3 May 2017

Academic Editor: Kaliyaperumal Nakkeeran

Copyright © 2017 Minam Moon et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Abstract

HDG method has been widely used as an effective numerical technique to obtain physically relevant solutions for PDE. In a practical setting, PDE comes with nonlinear coefficients. Hence, it is inevitable to consider how to obtain an approximate solution for PDE with nonlinear coefficients. Research on using HDG method for PDE with nonlinear coefficients has been conducted along with results obtained from computer simulations. However, error analysis on HDG method for such settings has been limited. In this research, we give error estimations of the hybridizable discontinuous Galerkin (HDG) method for parabolic equations with nonlinear coefficients. We first review the classical HDG method and define notions that will be used throughout the paper. Then, we will give bounds for our estimates when nonlinear coefficients obey “Lipschitz” condition. We will then prove our main result that the errors for our estimations are bounded.

1. Introduction

In this paper, we obtain uniform-in-time convergence error estimates for the semidiscretization by hybridizable discontinuous Galerkin (HDG) methods for the parabolic equation with nonlinear coefficient.

Here, is a nonlinear coefficient, is a bounded polyhedral domain in , and is final time.

Parabolic equation (or sometimes denoted as “heat equation”) describes the distribution of heat in a certain region over time with given boundary conditions. Hence, physically, can be interpreted as a time-dependent function that describes the temperature at a given location. Despite the importance, both practical and purely theoretical, of finding exact solutions for parabolic equations, it is very difficult to obtain closed-form solutions for the parabolic equation with nonlinear coefficients. Details regarding parabolic equations and the way of applying numerical approximations in various contexts can be found in diverse sources such as [13] or [4].

As said earlier, parabolic equations are particularly interesting as the equations inherently contain physical meanings, that is, information regarding heat transfer. And in many contexts, in order to explain naturally observable phenomenon, parabolic equations with linear coefficients are insufficient: we inevitably face those equations with nonlinear coefficients. One of the most fundamental difficulties of dealing with parabolic equations (or any PDE) with nonlinear coefficients is that finding an exact solution is extremely difficult, if impossible (whereas existence of the solution can be easily shown when we require certain conditions on coefficients). Thus, we tend to focus on finding numerical approximations.

Various methods have been developed to find approximate solutions for given parabolic equations having nonlinear coefficients (or more generally, any PDE). Some examples of popular methods include but are not limited to finite volume method [5], finite difference method [6], continuous Galerkin (CG) method [7], discontinuous Galerkin (DG) method [3, 79], HDG method [10, 11] (the method that we will mainly focus on), and mixed methods [12, 13]. Among the listed methods, DG has been studied the most.

Since Douglas Jr. et al. [14, 15] and Arnold [16] first introduced DG method for parabolic equations (and, at the same time, elliptic equations), it has been classically used to give physically meaningful approximate solutions [17], primarily because the method is notably advantageous over the continuous Galerkin (CG) method in many contexts. First, DG can be used in a much broader context as it can be used on general meshes. Furthermore, degrees of polynomials can be arbitrary. Also, DG can produce highly accurate discretization for convection-diffusion equations. It can also be applied to solve problems with unambiguous boundary conditions. Since DG can provide approximate solutions with high accuracy and it can be used on general meshes, the method has been widely used to solve nonlinear problems. Detailed explanations on DG methods can be found in [18].

However, there are some disadvantages on using DG method, and this inevitably gave a rise to HDG method, which tends to alleviate disadvantageous facets of DG. As [19] shows, HDG method, when compared to DG analyses (see [18, 20] and/or [21], e.g.), DG method produces larger globally coupled degrees of freedom than CG when the mesh size is invariant, since the degree of freedom is not shared by the boundary elements. In short, DG method is computationally ineffective when it is compared to CG method [18], and this shortcoming is the very reason the standard hybridizable discontinuous Galerkin (HDG) method was first introduced in [17] and developed. In HDG setting, the degrees of freedom associated with the numerical trances of the field variables solely matter in algebraic system. Degrees of freedom are substantially reduced as the numerical traces are only defined on the interelement boundaries. Consequentially, HDG method is very efficient [19].

As we are dealing with numerical approximations, one may ask how accurate our approximations are, and this question is what we would like to answer in this study. Previously, optimal convergence order for convection-diffusion equations was studied in norm of polynomials of degree (see [19, 22]). Then, the choices of stabilization parameter were presented in numerical values and analyzed [23]. Then, based on optimal convergence and superconvergence of HDG methods, local postprocessing was developed in [24] for linear convection-diffusion equations and in [25] for nonlinear case to increase the convergence order of numerical solutions. Despite the importance of solving parabolic equations and the substantial number of researches on applying various techniques to give approximate solutions that tend to hint that, at least for now, HDG method seems to be the best tools we have in our pocket, error analysis has not been conducted yet. To have a sense on how accurate the approximate solution is, we obtained through HDG a method which is indispensable, primarily because we need to check whether the result obtained from the method is meaningful or not. We limit ourselves to parabolic equations with nonlinear coefficients and conduct error estimation to investigate how accurate our approximation is.

In this paper, we will conduct an error analysis within HDG frame. We will use HDG projections of exact solution, satisfying certain properties. Then, by computing the magnitude of the norm of the difference between the projected solution and the approximate solution, we compute how far HDG approximations can deviate from the exact solution. The main idea is to derive HDG error equations (that will be introduced in the third section), and, by using the error equations, we will derive several identities that will give an upper bound for the error.

The paper is organized in the following way: after this introduction, we will give some introduction on HDG method, and along with that, we will define notions regarding HDG method that will be used throughout the paper. Then, in Section 3, we will give a priori estimation while assuming certain bounds for the nonlinear coefficient. We will then give error estimations for the proposed HDG method.

2. Preliminaries

2.1. Notations and Norms

Let be a conforming, shape-regular simplicial triangulation of our domain [26]. For any element , is defined to be the set of edges of when . When , it is defined as the set of the faces of and is denoted by . Let . Now, let denote the set of all edges/faces of the triangulation . is the set of all interior faces of the triangulation. Now, for any element , is the diameter of , and define . Call this number the mesh size.

Throughout the paper, we will use the standard notations for Sobolev spaces and their norms on the domain and the boundary. For example, , denote the Sobolev norms and seminorms on and its boundary . For an integer , the Sobolev spaces are Hilbert spaces and the norms are defined by the norms on their weak derivatives up to the order . When is not an integer, the spaces are defined by the interpolation [27].

Furthermore, we use to denote the -norm for any . If , we simply write . We denote the norm and seminorm on any Sobolev space by and , respectively. We also denote by . For example,

SetWhen , we replace by .

2.2. The HDG Method

We consider the following mixed form for the semidiscretization by hybridizable discontinuous Galerkin methods (HDG) of problems (1a), (1b), and (1c).where .

For each time on the interval , the method yields a scalar approximation to , a vector approximation to , and a scalar approximation to the trace of on element boundaries, in spaces of the formrespectively, whereHere, and is the space of polynomial of total degree at most .

With the spaces, HDG method provides approximations , determined by the following five restrictions:

For any , we requirewith a numerical trace for the flux definedfor some nonnegative stabilization parameter defined on , which we assume to be piecewise constant on . Here, is an projection of onto .

Now, for vector-valued functions , define . For scalar-valued functions , define , when the domain is a subset of . If is in , define . Then, we introduce the following notations:

2.3. The Projection

The projection into , which was first introduced in [11], is defined as follows.

Given , the function on an arbitrary simplex is the element of which solvesfor all faces of the simplex . Also, denotes the orthogonal projection onto .

Lemma 1. If the local spaces for and are nonnegative, then the systems (9a), (9b), and (9c) are uniquely solvable for and . Furthermore, there is a constant independent of the choice of and such that, for all ,

Proof. See [11].

The existence and the uniqueness (which depend on the Lipschitz condition that will be presented in the next section and the choices of the approximation spaces and the stabilization parameter ) on the solution for the system of equations (7a) to (7f) can be found in [28, 29].

We will later use the above lemma to figure out the convergence orders between our estimated solution and the exact solution.

3. A Priori Estimate

Let us first give an assumption on . Remember that . Hence, we are giving restrictions to our nonlinear coefficient.

Assumption 2. is chosen in such a way that there exist positive constants and such that, for all , we have the following inequalities:We further assume that both and are Lipschitz continuous.

With this condition on the nonlinear coefficient, we have the following result:

Lemma 3. If Assumption 2 holds, then one haswhere is a constant that does not depend on mesh size .

Proof. Take in (7a), in (7b), in (7c), and in (7d). Adding the resulting four equations, we getwhere Using integration by parts and the definition of , (7f), we getNow use Cauchy-Schwarz and Young’s inequality and observe thatIntegrating with respect to time over the interval and using along with the above results, we get the following inequality:Using Gronwall’s lemma, we getThis completes the proof.

4. Error Estimations

Let us now derive error estimates for the proposed method.

4.1. Error Equations

For the remaining sections, we define

Remark 4. Note that, by triangle inequality, The first term (i.e., ) that appears in RHS is bounded by Lemma 1. Hence, we only need to find an upper bound for . Similarly, we only need to bound to give an upper bound for .

Lemma 5. One hasfor all , where

Proof. For all , the exact solution obviously satisfies the following four equations:Since is the projection into and satisfies the orthogonal property, we haveBy the properties of the projection , we havefor all . Subtracting the first three equations defining the HDG method (i.e., (7a)–(7c)), from the above equations in order, we obtain (21a)–(21c).
By the definition of , (21f) and the property of the projection, (9c), we getNotice that both of the above terms are zero. Hence, (21d) follows.
This completes the proof.

Remark 6. Note that, by definition, . Using Lemma 1, as in Remark 4, the two terms in the right hand side both vanish when is small enough. Hence, from now on, to ease the computation, we assume that ; that is, although in reality, to take account for , we have two extra nonzero terms and in equalities that we would show, we will ignore the two terms from now on for simplicity.

4.2. Estimations for in

Lemma 7. For any , one haswhere

Proof. Take in (21a), in (21b), in (21c), and in (21d). Add the four equations that we get. We then getwhereUsing integration by parts and the definition of , (21f), we haveThe identity we wanted to prove follows after integrating in time over the interval and using the fact that by (21e).

Theorem 8. If Assumption 2 is satisfied and , one haswhere is independent of mesh size .

Proof of Theorem 8. Consider ’s we defined in the previous lemma. Applying Cauchy-Schwarz and Young’s inequalities to the equation that defines , we get the following inequality:since .
Similarly, we get the following inequality for .Since is Lipschitz continuous and , we haveSince is bounded below by , we getTherefore, we haveTake and apply Gronwall’s lemma. We haveTherefore,

Corollary 9. If Assumption 2 is satisfied and , one haswhere is independent of mesh size .

Proof. We obtained bounds for ’s from the proof of Theorem 8. Using Lemma 7, we obtain the desired upper bound.

Remark 10. Note that the above result gives (together with triangle inequality) an upper bound for . Depending on how we discretize the time interval , the convergence order with respect to time is determined. Note that the convergence order of with respect to the given space was already determined by Lemma 1. Hence, we only need to sum (or integrate if our discretization was continuous) with respect to time to determine the convergence order.

4.3. Estimations for in

Lemma 11. If Assumption 2 is satisfied and , one haswhere is independent of a mesh size .

Proof. We differentiate all of error equations (21a)–(21e), with respect to time, and obtainfor all , whereTake , , , and in the above four equations in that order. Adding the resulting four equations and following the steps of calculation as in the previous lemma, we getwhereNote first that Lemma 1 tells us that Thus, whenever we have suitably small , we will be able to make as small as we want. Keeping this in mind, using Cauchy-Schwarz’ and Young’s inequalities, we getTo estimate , observe that (use the Lipschitz assumption on and the fact that is bounded)We then get the following estimations for :Apply Cauchy-Schwarz and Young’s inequalities and get the following inequality for :Now let us derive an inequality for . Remember that it is a well-known that when we have a finite dimensional vector space endowed with two norms and then the two norms are equivalent. That is, for any vector in that vector space, there exists two constants and , independent of the choice of , such that . Now, observe thatNote that (using Lipschitz condition for and the fact that is bounded) the second term For the first term, observe that (using Hölder’s inequality and the fact that all norms are equivalent in a finite dimensional vector space)Using Corollary 9, we can take (by decreasing the mesh size of ) as small as we want. Proceeding (similarly to how we derived an inequality for ), we getApplying the Gronwall’s lemma, we haveApplying the error estimates of Theorem 8 and Corollary 9, we obtainTherefore,and we are done.

Lemma 12. For any , one haswhere

Proof. We keep all the error equations except for (21a) and (21c); instead of the two, we use the equations obtained from differentiating the two equations with respect to time . That is, we have the following equations:for all , where on .
Substitute to the first equation, to the second one, to the third one, and to the fourth one. Adding the resulting four equations, we getwhereIntegrating in time over the interval , we can get the desired identity.

Theorem 13. If Assumption 2 holds, and , one haswhere is independent of mesh size .

Proof. To get the above estimate, we consider the identity obtained from the previous lemma. By Cauchy-Schwarz and Young’s inequalities, we get the following inequality for :Note thatHence,Applying Cauchy-Schwarz and Young’s inequalities, we getApplying the error estimations from Lemma 11 and Theorem 8, we haveTake and use Gronwall’s lemma. We obtainNext, we note that if we differentiate Lemma 7 and evaluate the resulting equation at , we obtain