Analysis of mixed discontinuous Galerkin formulations for quasilinear elliptic problems
Mohammad Zakerzadeh (1), Georg May (1) ((1) AICES, RWTH Aachen)

TL;DR
This paper develops a unified framework for analyzing discontinuous Galerkin methods applied to nonlinear quasilinear elliptic problems, establishing stability, existence, uniqueness, and optimal error estimates.
Contribution
It extends well-known DG schemes to nonlinear problems in a canonical way and proves their stability and optimal error bounds.
Findings
Stability of DG solutions for nonlinear problems established
Existence and uniqueness proven for monotone, Lipschitz cases
Optimal error estimates in energy and L2 norms obtained
Abstract
In this manuscript we present an approach to analyze the discontinuous Galerkin solution for general quasilinear elliptic problems. This approach is sufficiently general to extend most of the well-known discretization schemes, including BR1, BR2, SIPG and LDG, to nonlinear cases in a canonical way, and to establish the stability of their solution. Furthermore, in case of monotone and globally Lipschitz problems, we prove the existence and uniqueness of the approximated solution and the -optimality of the error estimate in the energy norm as well as in the norm.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Numerical Methods in Computational Mathematics · Advanced Mathematical Modeling in Engineering · Differential Equations and Numerical Methods
Analysis of mixed discontinuous Galerkin formulations for quasilinear elliptic problems
Mohammad Zakerzadeh22footnotemark: 2
Georg May22footnotemark: 2 The research of the authors was supported by the Deutsche Forschungsgemeinschaft (German Research Association) through grant GSC 111.
Abstract
In this manuscript we present an approach to analyze the discontinuous Galerkin solution for general quasilinear elliptic problems. This approach is sufficiently general to extend most of the well-known discretization schemes, including BR1, BR2, SIPG and LDG, to nonlinear cases in a canonical way, and to establish the stability of their solution. Furthermore, in case of monotone and globally Lipschitz problems, we prove the existence and uniqueness of the approximated solution and the -optimality of the error estimate in the energy norm as well as in the norm.
keywords:
discontinuous Galerkin methods, nonlinear elliptic problems, optimal estimates
AMS:
65N12, 65N15, 65N30
11footnotetext: Aachen Institute for Advanced Study in Computational Engineering Science, RWTH Aachen, 52062 Aachen, Germany ({zakerzadeh, may}@aices.rwth-aachen.de).
1 Introduction
A great amount of research has been devoted to the analysis of discontinuous Galerkin (DG) schemes for (non)linear elliptic and parabolic problems. This goes back to work of Babuska [4], Wheeler [41], Arnold [2] and Dupont et al. [29] for interior penalty (IP) methods. In later work, e.g. [9, 37], a non-symmetric IP scheme was presented and analyzed. Other classes of discretization techniques have also been introduced, e.g., the first and second method of Bassi–Rebay [7, 8], or Shu and Cockburn’s LDG method [16]. For a comprehensive literature study of these problems we refer to [15] and [3].
In their seminal paper [3], Arnold et al. provided a unified framework for obtaining different classes of DG methods for the linear Poisson problem. For nonlinear problems the picture is more complicated, and obtaining different classes of methods usually follows very different approaches; while IP methods often have been introduced and analyzed in the primal form [17, 23, 24, 34, 28], for LDG methods the usual approach is to start from a mixed formulation, e.g., [11, 22, 12] or [42]. Originating from this, different techniques are usually employed in the analysis of each family. The LDG methods [22, 11, 12, 42] have been formulated by using three unknowns in the mixed form as proposed in [14], which yields an inconsistent primal formulation as analyzed, e.g., in [11] (and [35] for the simpler linear case). In contrast, IP methods like [24, 23, 28, 34, 17] usually enjoy a consistent primal form.
On the other hand, the nonlinear versions of the Bassi-Rebay methods are often obtained by ad-hoc extension, mimicking the linear counter part, e.g. [6], and to the best knowledge of the authors, there does not exist rigorous analysis of the second Bassi–Rebay method for nonlinear problems, although they are widely used for nonlinear problems like the Navier–Stokes equations.
This manuscript aims to extend the discussion presented in [11, 24, 22, 23, 28, 34] in two ways: Firstly, we try to treat different types of discretization in a canonical way, starting from a mixed formulation as [3]. We will show that our formulation leads to a slightly modified version of previously proposed nonlinear formulations for symmetric IP (SIPG) [23], and Bassi–Rebay [6], while we recover the LDG formulation of [11]. Here we are interested in these methods since, among the methods investigated in [3], these are the only ones that are stable and consistent for primal and adjoint solutions, and we might hope for extending these properties to the corresponding nonlinear discretization. Also we prove that the approximate solution of the discontinuous Galerkin problem is well-posed; i.e, unique and stable, provided that the diffusion operator is strongly monotone and globally Lipschitz continuous. This is comparable to analysis of [11] for LDG and somewhat similar to [17] for IP; however our results cover different formulations. It is plausible that the same kind of analysis is applicable to cases which do not satisfy either strong monotonicity or global Lipschitz continuity as in [34, 24, 23]; nevertheless, we do not address this extension here and restrict our analysis to these two assumptions.
Secondly, we are going to provide an optimal error estimate for SIPG and Bassi–Rebay methods in terms of mesh size, both in energy norm and in the -norm. Such estimates have previously been derived for LDG methods, in [11] for monotone and globally Lipschtitz continuous problem, and in [22] for cases which neither of these two assumptions hold. For the SIPG method, error estimates have been presented in [23, 24] and for incomplete penalty (IIPG) in [34], for non-monotone and not globally Lipschitz operators. Also we have the results of [17] for IIPG in case of monotone and globally Lipschitz operators. Let us remark that since the formulations presented in [34, 17] are adjoint inconsistent, they derived the error estimate only in the energy norm and did not deal with the corresponding adjoint problem.
Besides the canonical approach of discretization we present here, the rigorous analysis of the second method of Bassi–Rebay is novel in the literature, as well as the different approach we adopted in the error estimate for an asymptotically adjoint consistent formulation. Furthermore, we present explicit conditions of stability for all formulations. To the best knowledge of the authors this has not been done before for a nonlinear version of Bassi–Rebay methods and is similar to the explicit bounds for the SIPG method in [39, 18] and [31]. It is worth mentioning that for the SIPG method, unlike the cited literature, our stability analysis remains valid for degenerate diffusion.
The structure of this paper is as follows: In §2 we provide a short review on the quasi-linear elliptic problems and the properties of the diffusion operator. In §3 we review some approximation results as well as the properties of triangulation of the computational domain. Section 4 deals with our canonical approach for obtaining different DG formulation in the primal form, and later in §5, we analyze the consistency and adjoint consistency of the presented formulations. The sections 6 and 7 are devoted to the stability and uniqueness of the DG approximate solution, respectively. Note that before reaching section 7 we do not require the monotonicity of the operator and the stability result is valid for more general problems. Section 8 presents the optimal error convergence estimate in both energy and norms.
2 Quasi-linear elliptic problems
We consider the following quasilinear elliptic problem
[TABLE]
where and . For simplicity we will set in later analysis. Also is a bounded and simply connected domain in . For brevity one might use the notation where , such that and . Moreover, by and \bm{a}_{\bm{z}}:=\big{[}\frac{\partial\bm{a}_{i}(\cdot,\bm{\zeta})}{\partial\zeta_{j}}\big{]}_{i,j=1,2}, we denote the derivative of with respect to its second and third arguments.
In the general theory of nonlinear elliptic problems (see [32, 45]), it is usually assumed that the function satisfies some conditions:
- A(i)
The functions are continuous in and satisfy the following growth condition;
[TABLE]
where and , for . 2. A(ii)
There exist two constants such that for all
[TABLE]
We also might consider a relaxed version of (4) as the following
[TABLE]
For simplicity in the later analysis we assume that is symmetric. Then we can interpret (5) as imposition of lower and upper bound on the eigenvalues of ; and , respectively. 3. A(iii)
The functions are in , i.e., they are twice continuously differentiable functions with all the derivatives through second order being bounded.
Note that 3 is required to guarantee the meaningfulness of the of the definition of the discrete problem. On the other hand the assumptions A(ii) and A(iii) need to be valid only for the arguments provided in sections 7 and 8 for uniqueness of the discrete solution and error estimate, respectively. Furthermore, the relaxed version of assumption A(ii) in (5) is required in the stability analysis in section 6.
Let us note the following important definition for nonlinear elliptic PDEs, the so-called strong monotonicity and global Lipschitz continuity property of the diffusion operator (as [19], [44, p. 476]):
Definition 1**.**
We say a diffusion operator satisfies strong monotonicity property, if there exists a constant such that
[TABLE]
for all and . Moreover we call it a globally Lipschitz operator if there exists a constant such that
[TABLE]
for all and .
One can show that if the left and right inequalities in (4) are satisfied, the diffusion operator is strongly monotone and globally Lipschitz continuous in the sense of Definition 1. We skip the proof here and refer to [5, Lemma 2.1] or [17, Lemma 4].
As examples of problems settled in the category of (1) we have
- (a)
Newtonian flow model
[TABLE] 2. (b)
Non-Newtonian flow model
[TABLE]
with an specific case of mean curvature flow
[TABLE]
We remark that for the case (b), following [11, 28], we typically assume the monotonicity of the diffusion operator (see Definition 1), while the diffusion operator in case (a) is not usually a monotone operator (only under very restrictive assumptions, see [1]). Since the presentation of the primal form of DG formulations in section 4 and stability result in section 6 are not affected by the monotonicity property, we do not exclude this case now. But in obtaining a priori error estimate in section 8, we will only consider monotone cases and one can refer to [34], [24] or [23] for a priori estimate for non-monotone cases. One may check that the mean curvature flow example satisfies the assumption A(ii); hence it is strongly monotone and globally Lipschitz continuous, see [23, section 5].
3 Preliminaries
First let us set a notation convention and suppress the dependence of the diffusion operator on the space variable ; henceforth we write instead of , while we still allow explicit dependence on .
Now, as a tool that we will use later in sections 6 and 8, let us consider the following integral form of Taylor’s formula; for and one has
[TABLE]
where is defined as
[TABLE]
for . Moreover we define as
[TABLE]
where and .
Seeking clarity, sometimes we denote by all four arguments, e.g. instead of .
3.1 Triangulation and finite element space
Here we are going to consider the boundary of the domain sufficiently smooth (in order to apply the duality argument, see section 5.2), e.g. a convex polygon. Then we consider a shape-regular triangulation on as composed of (non-overlapping) triangular or rectangular elements (with possible hanging nodes) and is the diameter of each . Also we define and is the outward normal to . In the following we assume that is of bounded variation, that is, there exists a constant such that
[TABLE]
where share an edge. This bounded variation property means that there is an upper bound for the number of neighboring elements of each , denoted by . In case that has no hanging nodes and for triangular and rectangular elements, respectively. We also need the following quasi-uniformity property of the mesh in the error analysis in section 8.2, that is
[TABLE]
We denote the skeleton of the triangulation , i.e. the set of all edges of , by . Also we denote the set of boundary and interior edges of by and , respectively, and the length of edge by . Following [3], let us fix some definitions for the jumps and average of the discontinuous functions on the skeleton . Let us set the trace values as . For any interior edge , where is the common edge of , and for all , we define
[TABLE]
and similarly for all
[TABLE]
For any boundary edge we define
[TABLE]
for all and .
Moreover, let us consider the following broken Sobolev space on the triangulation ; for
[TABLE]
with the corresponding norm and seminorm
[TABLE]
and for the case the associated norm and seminorm are defined as
[TABLE]
when and are the standard Sobolev norms on . Also we denote as by tradition.
Now let define the following finite dimensional approximation spaces
[TABLE]
with and or (To satisfy the inclusion property as [3].) Here by we denote the space of the polynomials of total degree on and restricted to .
Moreover, let us define two lifting operator and as
[TABLE]
for all . Using the Riesz representation theorem one can prove the existence and uniqueness of the lifting operators introduced by (23) (see e.g., [11, Lemma 3.3]). Also we define an edge-wise version of right and left lifting operators as and , such that
[TABLE]
for all edges . Also by noting that and, by applying Cauchy-Schwarz inequality and taking the norm over , one has
[TABLE]
Furthermore, one might note that for any and it holds and consequently
[TABLE]
using Cauchy-Schwarz inequality.
Also let us introduce the space and the corresponding energy norm as
[TABLE]
as well as the following seminorm as
[TABLE]
From the structure of (29), using (26) and (27) reads, there exists such that
[TABLE]
for all . Moreover, we have the following estimate from [10, Lemma 2]
Lemma 2**.**
There exist two positive constants , such that for all we have
[TABLE]
where the constants are independent and only depend on the minimum angle of the triangles and the polynomial degree .
Proof.
The original proof in [10] was presented for , while in [3] the extended version to was given, exploiting the Sobolev embedding to deduce in . Then (31) trivially holds for all . For the details on the explicit value of and we refer to [10] and [40]. ∎
In order to see the relation between and , let us remark the following relation from [2, Lemma 2.1], for all
[TABLE]
which holds when is convex. For a similar result on non-convex domains we refer to [11, 21, 38].
Now, restricted to and by using (31), (32) reduces to the following Poincaré-type inequality
[TABLE]
with some , and by the definition of the energy norm (28) one can write
[TABLE]
Also we will need the following inverse inequality
Lemma 3**.**
Let consider , then for there exists a constant such that
[TABLE]
The proof of this lemma can be found, e.g., in [13, p. 140] and we skip it.
3.2 Approximation properties
First, let state some approximation properties in the next two lemmas
Lemma 4**.**
[23, Lemma 2.1]** For , there exists a positive constant , depending on and , but independent of and , and a sequence , such that
- (i)
for any
[TABLE] 2. (ii)
for any
[TABLE]
where .
For the proof of this lemma we refer to [23, Lemma 2.1] and the references cited therein.
Using Lemma 4 and the properties of the energy norm (28), we present the following approximation result
Lemma 5**.**
For there exists a constant independent of and , and a mapping such that
[TABLE]
where .
Proof.
The proof exploits Lemmas 2 and 4 and the definition of which provides continuity of . Then the proof follows the same lines as [3, section 4.3.]. ∎
Note that in our analysis in this work, we do not need to specify the explicit type of projection . Hence we leave it undefined with merely assuming that it satisfies the approximation property described in Lemmas 4 and 5. We refer to [11] and [23] for explicit examples of such projections. Let us remark that the Galerkin projection that we introduce in (47) also satisfies these approximation properties.
4 Discontinuous Galerkin formulation
Here we follow the formulation presented in [11] (also see [14] and [35]). Let us start with writing the nonlinear elliptic problem (1) as a system of first order nonlinear PDEs in terms of new variables :
[TABLE]
Our goal is to approximate the exact solution by discrete functions in the finite element space . The weak formulation can be written as
[TABLE]
Here and are the element-wise version of the gradient and divergence operator, respectively.
This flux formulation is complete but the definition of the numerical fluxes and which depends on , and needs to be designed carefully. We postpone the explicit definition of these numerical fluxes till the next section, where we present the equivalent primal formulation; i.e., a formulation which has as its only unknown.
The only requirement we impose here is that the should be independent of and , i.e., , which provides the availability of the primal formulation. All the formulations we are going to present have this local property. For examples of other forms of non-local formulation and their analysis we refer to [42], [22] and [20].
4.1 Primal formulation
In order to obtain the primal formulation we need to solve the unknowns and in terms of . In the first step, by using (43), one can solve for as the Galerkin projection,
[TABLE]
where has the following property; for all
[TABLE]
Moreover, let us remark the following identity; for any and the following holds
[TABLE]
Applying (48) in (44) and (45), one can write
[TABLE]
Now let us require the numerical fluxes and to be conservative, which leads to
[TABLE]
on any . Also in accordance with the Dirichlet boundary condition (42), we set on . Using (49), one can simplify the weak formulation as
[TABLE]
Using the definition of lifting operator (23) and (46), we arrive at
[TABLE]
Now can be solved locally in terms of by inserting (52) and (53) in (51). Then one can obtain the primal formulation as the following; find such that
[TABLE]
where , and
[TABLE]
Note that in the rest of the paper we might abuse the notation defined in (52) in the operator form as .
The only undefined part in the primal formulation (55) is the explicit definition of the numerical fluxes. We are going to consider four different formulations by adopting different and :
- (i)
BR1. The BR1 formulation is defined as in [7],
[TABLE]
Hence, . This leads to the following quasi-linear formulation
[TABLE] 2. (ii)
BR2. The BR2 formulation, inherited from the original definition [8], is defined as
[TABLE]
with some as the stabilization parameter. Here, is the same as in BR1, and the primal formulation reads
[TABLE] 3. (iii)
SIPG. Similar to [3], we choose the fluxes as
[TABLE]
with some penalty parameter . Similarly to BR2, the primal formulation is given as
[TABLE] 4. (iv)
LDG. The LDG formulation, inherited from the original version in [16], can be obtained by setting
[TABLE]
where is some mesh-dependent parameter and constant on each edge. Also like SIPG, we have the penalty parameter . Note that in LDG formulation . Finally, the primal formulation reads
[TABLE]
Remark 1**.**
Seeking comparison of the current formulations with the already proposed versions in the literature, let us record a few observations. Firstly, it is worth pointing out that those fluxes which depend only on and (BR1, LDG) do not require any formal modification compared to the linear case. Furthermore, our LDG formulation is similar to [11] and the discretization proposed in [22] for a simpler form of nonlinearity in the diffusion.
For the SIPG formulation, looking at (58) and exploiting Taylor’s expansion (3), we can write
[TABLE]
Ignoring the boundary terms, the primal formulation proposed in [23] (or [27] in simpler case) reads as
[TABLE]
which shows two differences in the second term: in [23] there is instead of the average , which is a consequence of the direct consideration of the primal form. Also in our formulation we have an additional Galerkin projection, which seems essential to later proofs in the paper. Also one might notice that while needs to be computed explicitly in [23], in our formulation only appears in the analysis and there is no need to compute and implement this term.
Furthermore, comparing the current primal BR2 formulation with the version proposed in [6] for the case of nonlinear Helmholtz equation, and by following similar arguments to those shown for SIPG, one observes that the only difference of two formulations is in the application of the additional Galerkin projection in our formulation.
5 Consistency and adjoint consistency
It is clear that due to the discrete nature of the lifting operator and the Galerkin projection, the primal formulation (54) is inconsistent with the exact solution (for all four presented methods). This is also the case for the formulations presented in [11] and [35]. Moreover, the scheme is inconsistent with the smooth solution of its corresponding adjoint problem constructed by the linearization in the neighborhood of the exact solution.
In order to investigate these consistency errors, we consider a smooth solution to (1). In sections 5.1 and 5.2 we prove that, despite of the primal and adjoint inconsistency of the formulations, and in case of sufficiently regular solutions, one obtains asymptotic consistency in the mesh refining limit, for primal as well as for the adjoint problem.
In the following of this paper, due to the required regularity in the adjoint analysis, we assume that the exact solution of the problem (1), denoted by , belongs to .
5.1 Consistency
Due to the assumption 3, the fact that and on for the exact solution , we know that . Hence, on each . Also note that we have for all schemes. Let us first consider the schemes BR1, BR2, and SIPG. For these schemes, and for any , one can rewrite the left hand side of (55) as
[TABLE]
Applying the divergence theorem on the first two terms on the right hand side, and using the continuity of on the interfaces yield
[TABLE]
Noting (1), the consistency error for the primal formulation is the same for BR1, BR2 and SIPG; that is
[TABLE]
Similarly, for LDG scheme, following the same lines as [11] we obtain
[TABLE]
In general, even for very regular solutions, or in case of linear diffusion , this consistency error is not zero and in fact is equal to the Galerkin projection error into the polynomial space . However, provided that the diffusion is regular enough, the formulations are asymptotically consistent; i.e., as . Note that is the dual norm on space defined as
[TABLE]
where is a linear continuous operator on .
In order to prove this asymptotic consistency, one might find an upper bound for which vanishes as goes to zero. Here we present a generalized form of [11, Lemma 5.2] for different discretizations, which provides us with such an estimate:
Lemma 6**.**
Assume with some non-negative integer . Then, there exists , independent of but dependent on and , such that for the schemes presented in section 4 the following holds
[TABLE]
for all , where .
Proof.
The proof is provided in [11] for the LDG scheme, which in case gives the desired result for BR1, BR2, and SIPG. ∎
5.2 Adjoint consistency
Adjoint consistency is an important property in obtaining the optimal convergence rate for the solution, and super-convergence of the target functionals (cf. [26] or [36]). In order to apply Aubin-Nitsche duality argument, let us consider the following auxiliary dual problem
[TABLE]
where is the exact solution of (1). From assumption A(iii) and , and provided that (cf. section 6) one can check that
[TABLE]
Using (66) combined with the convexity of , it is a classical result that the unique solution of the adjoint problem, satisfies the following elliptic regularity [25, Theorem 9.1.22]
[TABLE]
Moreover, from (66) and the structure of (64), one can conclude that . Therefore one gets , on any interior edge .
In order to do the linearization, we take the Fréchet derivative of around the exact solution . For the BR1 formulation one might get
[TABLE]
Similarly, for BR2 and SIPG one has
[TABLE]
where the term is the Fréchet derivative of the penalty term; there holds
[TABLE]
for SIPG and BR2, respectively. For the LDG formulation we have
[TABLE]
Now, let us consider for the smooth exact solution of the dual problem, ; one might write for BR1, BR2 and SIPG,
[TABLE]
for all , with the following definition of the consistency error for the dual problem (64)
[TABLE]
Similarly, for the LDG formulation one can show
[TABLE]
Presence of a non-zero consistency error for the dual problem reveals the dual inconsistency of the proposed scheme, but as we are going to show that one can obtain the asymptotic dual consistency of the scheme as proposed in [30]; the quasilinear form is called asymptotic dual consistent with the target functional if the following holds
[TABLE]
where and are the exact solutions of the primal and dual problems, (1) and (64) respectively. Here is the Fréchet derivative of , which in our analysis and according to (64) is,
[TABLE]
As we will prove later in section 8.2, such an asymptotic adjoint consistency leads to the optimal convergence rate in norm. This property has been already investigated e.g., in [33] by numerical tests. Let us present the following lemma for the adjoint consistency error
Lemma 7**.**
Assume that the exact solution of the adjoint problem (64) has elliptic regularity, i.e., (67) holds. Then, there exists , independent of but dependent on , such that
[TABLE]
for all .
Proof.
Using assumption A(iii) and Lemmas 2 and 4, for BR2 and SIPG we have
[TABLE]
For LDG there exists additional term which can be bounded similarly as
[TABLE]
Using the boundedness of parameter and the fact that
[TABLE]
completes the proof of the lemma with sufficiently large . ∎
Using the result of the Lemma 7, smoothness of and elliptic regularity of yields
[TABLE]
which shows the asymptotic adjoint consistency of the proposed formulations.
6 Stability
In this section we prove the stability of the approximated solution of (54). Let us remark that in this section we do not assume neither the monotonicity nor the Lipschitz continuity of the diffusion operator. The only additional assumption we need is mentioned as the following remark:
Remark 2**.**
Based on the examples in section 1, and our main interest to interpret these problems as nonlinear diffusion phenomenon, it looks natural to assume the following
[TABLE]
which tells that there is no diffusive behavior in the absence of the gradient.
Using (76) and the Taylor’s expansion (3), as well as assumption A(iii) in form of (5), one may write
[TABLE]
We will exploit this result in the rest of this section.
It is well-known that the BR1 method is only weakly-stable (cf. [3]), so we only present the stability result for BR2, SIPG and LDG as the following lemma:
Lemma 8**.**
Let us assume is the solution of the primal formulation (54). Then for LDG, BR2 and SIPG methods the following stability result holds
[TABLE]
Here, is the continuity constant of linear form , that is
[TABLE]
while is the following coercivity constant of the operator as
[TABLE]
Proof.
For different formulations, we insert the test function and investigate if (80) actually holds. Using the fact that , the rest of the proof is complete by the following line
[TABLE]
So the only missing step is the coercivity proof, for which we check for different formulations:
- (i)
LDG: From (59) and (52) one has
[TABLE]
From the property (76) we have
[TABLE]
using Young’s inequality with . Now using (30) and the boundedness of , one has
[TABLE]
for some constant . Then (31) gives the following
[TABLE]
which indicates the condition as the coercivity requirement of LDG formulation. This coincides with the result for the Poisson problems (cf. [3]) and the version of LDG discussed in [31]. 2. (ii)
BR2, SIPG: We combine the proof for these two methods by writing them as a variation of BR1 method. This treatment will be used once more in section 7.1. Using (56), (57) and (58), one may write the following decomposition of primal formulation; for all
[TABLE]
where is the primal formulation of BR1 scheme and the next two terms are defined as
[TABLE]
Using (77) one can easily show the positive semi-definiteness of as (56). For using the Taylor’s expansion (3) we have
[TABLE]
and for the remaining term one can obtain
[TABLE]
Here we have used (31) and (77) in the first and second equation, respectively. Henceforth, we adopt the following notation for a constant
[TABLE]
Hence, using (85), (77) and (89), one might write
[TABLE]
Applying Young inequality with and (26), we arrive at
[TABLE]
This leads to the following criterion , and since can be arbitrary chosen close to , the margin for stability is which can be written separately for BR2 and SIPG as
[TABLE]
This shows that by choosing sufficiently large penalty parameter, as (90) suggests, one can ensure the stability of the solution of SIPG and BR2 formulations.
This completes the proof of coercivity as well the proof of the lemma. ∎
Remark 3**.**
The result of Lemma 8 shows that the stability estimate is available in the degenerate case, i.e. where , for SIPG method while for BR2 the uniform lower bound should be uniformly larger than zero. In the special case when , by the same lines of argument as in [43], one can check that the stability criteria for SIPG remains unchanged while the BR2 one reduces to , which is consistent with the result of Poisson problem (cf. [3]).
7 Existence and uniqueness of the discrete solution
In the following sections of this paper, we only consider the BR2 and SIPG formulations. The reason for doing this is the fact that our discussions on the LDG method will follow basically the arguments presented in [11]. Moreover, the BR1 method is not so common due to non-compact stencil and instability [3].
We first prove the strong monotonicity and Lipschitz continuity of the nonlinear operator corresponding to the primal formulation in sections 7.1 and 7.2, respectively. Then we prove the uniqueness of the discrete solution and present a Strang type error estimate.
7.1 Strong monotonicity
Let us start with the following lemma
Lemma 9**.**
If the diffusion operator satisfies the strong monotonicity property as (6), then there exists such that
[TABLE]
for all .
Before stating the proof, let us remark the following estimate which later will be used in the analysis:
Lemma 10**.**
For all , the following holds
[TABLE]
for .
Proof.
Using Young’s inequality with , (52) and (26), one can write
[TABLE]
Hence, by setting we arrive at
[TABLE]
Using the definition of energy norm (28), one can add to the right hand side and the result is obtained. ∎
Now we are ready to present the proof of Lemma 9:
of Lemma 9.
Using the decomposition (85), and setting one gets
[TABLE]
Strong monotonicity (6) and (56) readily imply
[TABLE]
For the term , using (7), (86) and a Young inequality with , one has
[TABLE]
Using the fact that and (26), we arrive at
[TABLE]
For the remaining term , using the definitions (87) and (88), as well (31) and (6), one has
[TABLE]
for SIPG and BR2 methods, respectively. Similar to (89), we define such that, for both methods
[TABLE]
Hence, combining all terms one can write
[TABLE]
Let us set to be a constant larger than ; then using Lemma 10 and (33) give
[TABLE]
Now consider arbitrary and set large enough such that the following holds
[TABLE]
The only remaining free parameter is the stabilization parameter and one can choose it sufficiently large, such that
[TABLE]
Finally we arrive at , for both BR2 and SIPG and the proof completes. ∎
7.2 Lipschitz continuity
For the Lipschitz continuity we have the following lemma
Lemma 11**.**
If the diffusion operator satisfies the Lipschitz continuity property as (6), there exists independent of the mesh size such that
[TABLE]
for all .
Proof.
Using the decomposition (85) and similar to Lemma 9 one gets
[TABLE]
where
[TABLE]
It is straightforward to show the Lipschitz continuity of using (7). For , noting the fact that one may write
[TABLE]
and readily
[TABLE]
For BR2 scheme one may note, for any
[TABLE]
On the other hand, using the fact the vanishes outside two neighbor elements, for the corresponding term we have,
[TABLE]
Finally, for SIPG method one can easily write
[TABLE]
Combining the results for , and concludes the proof. ∎
Now we present the existence, uniqueness and stability result for the approximated solution as well as a Strang type error estimate. Though we discussed the stability of the solution in section 6, note that the result of Lemma 12 requires stronger condition on the diffusion operator (strong monotonicity and global Lipschitz continuity) than the more general result already discussed in section 6.
Lemma 12**.**
There exists a unique solution of (54), which satisfies
[TABLE]
Moreover, the following error estimate holds
[TABLE]
where is the exact solution of (1).
Proof.
Using the strong monotonicity and Lipschitz continuity (Lemmas 9 and 11) the unique solvability of (54) can be proved by a well-known result as [32, Theorem 3.2.23] or [45, Theorem 35.4], also see [28]. For the stability proof we refer to [11, Theorem 4.5] and here we only present the proof of Strang type error estimate due to its application in the rest of our analysis.
Consider the error and decompose it as , where and where . From Lemma 9 one has
[TABLE]
While the first group of terms is the consistency error, applying Lemma 11 gives
[TABLE]
Applying a triangle inequality completes the proof. ∎
8 A priori error estimates
In this section, we provide the error estimate of the BR2 and SIPG methods illustrated in section 4. In section 8.1, we prove the optimal error estimate in the energy norm using the Strang type error estimate in Lemma 12 and the asymptotic consistency result in section 5.1. In section 8.2, we prove the optimal error estimate in norm exploiting the result on asymptotic adjoint consistency already provided in section 5.2.
8.1 Energy norm error estimate
Combining the result of Lemmas 12 and 6, gives the following corollary for the error estimate in the energy norm:
Corollary 8.1**.**
Let and be the solution of (54) and the exact solution of (1), respectively. Also assume that and . Then the following holds
[TABLE]
with some , and .
Proof.
Using Lemmas 12 and 6 one can easily write
[TABLE]
Choosing and applying the approximation result in Lemma 5 completes the proof with choosing a sufficiently large . ∎
Using the error decomposition (as in Lemma 12), we also are interested in obtaining an estimate for . By setting in (101) and similar to the proof of Corollary 8.1 one might get
[TABLE]
which yields, for some
[TABLE]
Moreover, using the definition of and as (53) and (52), one can prove the corresponding lemma for their error estimate
Lemma 13** (Theorem 5.5 in [11]).**
Under the same assumptions as those of Corollary 8.1, there exists independent of the mesh size, such that
[TABLE]
and, not necessarily with the same ,
[TABLE]
where and .
The proof follows the same lines as [11] and we skip it here.
8.2 norm error estimate
In this section, we present the error estimate of the solution in the norm. Recalling the adjoint problem (64), and by inserting as the (infinite dimensional) test function in (5.2) and (73), to obtain
[TABLE]
where and are defined in (60) and (71) as the consistency errors of the primal and the dual problem, respectively, while is the second order linearization error. Here, . By the Taylor’s formula in section 3.2 we have (note that as already defined)
[TABLE]
First let us handle the error estimate of the last three terms on the right hand side of (8.2), , and , in the following steps:
- (i)
Using (109) and very similar arguments as [23, Lemma 3.10] we have
[TABLE]
From the embedding theorem, the last term is bounded since we know , i.e., by a uniform constant . Using (34) gives, since
[TABLE]
Now, the only term to handle (to obtain an additional order of ) is and . By writing , one gets
[TABLE]
In case of and (note that ), application of Lemma 4 gives
[TABLE]
On the other hand using the inverse inequality (35) one has
[TABLE]
Then, application to (105) for term with and , and quasi-uniformity condition (14) yield
[TABLE]
Hence, for and , provided that . Similarly, since one can employ (35) to write
[TABLE]
Using (26), (14), Corollary 8.1, and with similar arguments as ((i)) yield
[TABLE]
Combining all terms we have
[TABLE] 2. (ii)
Using Lemma 6 and noticing that (see (60) for smooth as well as the boundary condition of (64)), one has the following upper bound for
[TABLE]
The approximation result of Lemma 4 and -regularity of give
[TABLE] 3. (iii)
For the adjoint consistency error , from Lemma 7 one has
[TABLE]
Combining steps (i)-(iii), with the energy error estimate in Corollary 8.1, one can write
[TABLE]
The remaining term in (8.2) can be bounded using Lipschitz continuity (7) and Lemma 5
[TABLE]
Application to the elliptic regularity of and Corollary 8.1 gives
[TABLE]
which can be summarized as the following lemma for the optimal error estimate
Lemma 14**.**
Assume that and are the solutions of (54) and the exact solution of (1), respectively. Also assume that and with and . Then, there exists such that the following holds
[TABLE]
where and and .
9 Conclusion
In this work, we have analyzed different DG formulations of a quasilinear elliptic problem by introducing appropriate numerical flux functions inspired by their original version in linear problems. We showed that in spite of the fact that all of these formulations are inconsistent, they have the asymptotic consistency property for both primal and dual problem. Moreover, we also proved the stability of the solution in norm under mild assumptions on the problem.
Furthermore, for BR2 and SIPG discretizations, we proved the existence and uniqueness of the discrete solution in case of monotone and globally Lipschitz diffusion operator. Afterwards, under regularity assumptions for the exact solution, we proved the optimal convergence rate in energy norm as well as norm.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] Assyr Abdulle and Gilles Vilmart , A priori error estimates for finite element methods with numerical quadrature for nonmonotone nonlinear elliptic problems , Numerische Mathematik, 121 (2012), pp. 397–431.
- 2[2] Douglas N Arnold , An interior penalty finite element method with discontinuous elements , SIAM journal on numerical analysis, 19 (1982), pp. 742–760.
- 3[3] Douglas N Arnold, Franco Brezzi, Bernardo Cockburn, and L Donatella Marini , Unified analysis of discontinuous Galerkin methods for elliptic problems , SIAM journal on numerical analysis, 39 (2002), pp. 1749–1779.
- 4[4] Ivo Babuška and Miloš Zlámal , Nonconforming elements in the finite element method with penalty , SIAM Journal on Numerical Analysis, 10 (1973), pp. 863–875.
- 5[5] John W Barrett and WB Liu , Quasi-norm error bounds for the finite element approximation of a non-newtonian flow , Numerische Mathematik, 68 (1994), pp. 437–456.
- 6[6] Francesco Bassi, Andrea Crivellini, Stefano Rebay, and Marco Savini , Discontinuous Galerkin solution of the reynolds-averaged navier–stokes and k– ω 𝜔 \omega turbulence model equations , Computers & Fluids, 34 (2005), pp. 507–540.
- 7[7] Francesco Bassi and Stefano Rebay , A high-order accurate discontinuous finite element method for the numerical solution of the compressible navier–stokes equations , Journal of computational physics, 131 (1997), pp. 267–279.
- 8[8] F Bassi, S Rebay, G Mariotti, S Pedinotti, and M Savini , A high-order accurate discontinuous finite element method for inviscid and viscous turbomachinery flows , in Proceedings of the 2nd European Conference on Turbomachinery Fluid Dynamics and Thermodynamics, Technologisch Instituut, Antwerpen, Belgium, 1997, pp. 99–109.
