A quasi-optimal test norm for a DPG discretization of the convection-diffusion equation
Introduction
Let be a bounded polyhedral domain and consider the problem with n denoting the outward unit normal to the boundary ∂Ω and where and are two disjoint open subsets satisfying and . Here, the data satisfies , with and .
The solution to problem (1.1) is difficult to approximate numerically due to the presence of boundary/interior layers – areas of steep solution gradients with a width dependent upon ε. It is well known that regardless of what formulation of problem (1.1) is used that discretizing it using the standard finite element method results in spurious oscillations occurring in the numerical solution near the layers until a sufficient number of elements have been added locally with the problem worsening as ; for this reason, multiple stable schemes have been developed for problem (1.1) over the years. The discontinuous Galerkin (DG) method originally developed by Reed/Hill for the neutron transport equation [28] has been successfully applied to the convection-diffusion equation through a variety of different stable discretizations [1], [3], [13], [29]. The so-called hybridizable discontinuous Galerkin (HDG) methods are another popular class of schemes used to discretize the convection-diffusion equation, cf., [12], [19], [23], [26], [27]. We also cannot discuss numerical methods for convection-diffusion equations without mentioning the highly successful streamline-upwind Petrov-Galerkin (SUPG) method [5], [6]; the SUPG method is unique among all of these previously mentioned methods in the sense that it uses standard conforming finite elements for the trial space but uses a special space of test functions, biased in the upwind direction, to impart the method its stability [10]. This idea of test functions imparting stability to numerical methods in fact dates back to [21] and it is this critical observation that lies at the heart of the discontinuous Petrov-Galerkin method. When discussing Petrov-Galerkin methods, we should also mention [4] which is unusual among numerical methods in that it allows passing to the convective limit.
The discontinuous Petrov-Galerkin (DPG) method was originally introduced by Demkowicz/Gopalakrishnan in the context of the transport equation [16]. This idea was then abstracted and applied to a variety of different equations [14], [15], [32]. A thorough analysis of the DPG method, as applied to the Poisson equation, also exists [17]. The DPG method can be applied to the abstract variational formulation of finding such that where U and V are some Hilbert Spaces, is a continuous bilinear form and is a continuous linear functional. As is common, for the discretization of (1.2), we seek such that . In general, the existence of a solution to the continuous problem (1.2) does not guarantee that the discrete problem (1.3) also has a solution unless is chosen to be the so-called space of optimal test functions. To be specific, (1.3) becomes the (theoretical) DPG method when the test space is chosen to be the space of optimal test functions where is the trial to test operator given by the unique solution of the variational problem Here, the inner product induces a norm referred to as the test norm which, effectively, defines the DPG method via the variational equation above. Note that the use of this test space, in addition to guaranteeing the solvability of (1.3), also means that solving (1.3) gives the best approximation error in the energy norm , i.e.,
We now remark that the space of optimal test functions, as defined above, cannot actually be computed since (1.4) is an infinite dimensional problem; therefore, for the practical DPG method we must approximate this variational equation. Typically, this is done through an enriched test space based on the same mesh as but with higher polynomial degree so that though other methods of forming this enriched test space do exist [24], [30]. Thus, if we let denote a basis for then we are seeking a basis defining such that However, this still presents a problem; namely, (1.6) results in a matrix-vector system of higher dimension than that of the original discretization! This difficulty can be overcome by using a discontinuous enriched test space and, hence, a discontinuous test space . Under the additional assumption that the test norm is localizable then (1.6) can now be solved elementwise instead of globally yielding a practical method. Note that must be a subspace of V which means that V must also consist of discontinuous functions; it is necessary to take this into consideration when formulating the bilinear form.
As noted above, the DPG method converges optimally in the energy norm , however, we usually prefer to measure the error in a norm of our choice appropriate to the problem at hand. By duality, defines a corresponding norm on V referred to as the optimal test norm, viz., The discrepancy between the use of in the DPG method and the ‘optimal norm’ results in a worse convergence bound formulated precisely in the following convergence result from Theorem 2.1 in [32]. Theorem 1.8 Let u and denote the solutions of (1.2) and (1.3), respectively and suppose that the practical norm on V is equivalent to the optimal test norm on V, i.e., that there exists positive constants and such that Further suppose that the bilinear form B satisfies Then
Theorem 1.8 implies that we want to choose the test norm to be as close as we can practically get to the optimal test norm in order to force and to be as near to unity as possible. Note that we cannot use itself in the DPG method since, as we will see below, for practical choices of the norm the optimal test norm contains ‘jump norms’ which couple nearby elements meaning it is non-localizable. In the context of convection-diffusion, then, the goal is to find an appropriate trial norm in which to measure the error along with a test norm which is as close as possible to the optimal test norm thus resulting in a good ratio of the constants to . With respect to Theorem 1.8, we also note [9] which shows that the robustness of the field variables is essentially dependent only upon the continuous formulation of the problem and the choice of test norm .
Most of the DPG discretizations for the convection-diffusion equation are based on the ultra-weak formulation (to be derived in the next section) for which we have a vector-valued test function with v corresponding to u and τ corresponding to ∇u. Various different test norms have been proposed for the DPG method as applied to the convection-diffusion equation (1.1). In [18], multiple test norms are trialed including the quasi-optimal test norm which has performed well in the past on many PDE problems of very different character. Results show that this norm performs well up to a point using the standard p-enriched test space approach but that for higher polynomial degrees it was necessary to use computationally expensive Shishkin-type meshes for the enriched test space [18]. This problem is somewhat remedied in [10], [11] through the use of the mesh-dependent test norm where , , where is some mesh of Ω. It was shown that optimal test functions computed under this norm do not have boundary layers allowing for the standard p-enriched test space approach to work for this norm. All of the works [10], [11], [18] contain upper and lower bounds between and with which we will compare bounds for our proposed test norm later in this paper. Another work [25] shows that the quasi-optimal test norm performs well with the authors choosing the values , for these parameters in their numerical experiments. As in [18], Shishkin-type meshes are used for the enriched test space in that work.
Here, we propose the mesh-dependent quasi-optimal test norm for use in the DPG method approximating (1.1). We prove upper and lower bounds between and for that have favorable scalings with respect to the diffusion parameter ε with minimal assumptions on the convection. Similar upper/lower bounds can also be proven for our proposed test norm but with the term replaced by either or just with differing (ε-independent) constants. In light of this observation, we note the similarities between our proposed test norm and the quasi-optimal test norm of [25]; due to this, we restrict ourselves to a comparison between the test norms and only in the numerical experiments section.
The remainder of this paper is organized as follows: in the next section, we derive the ultra-weak variational formulation for (1.1) and in section 3 we introduce the function spaces necessary in order to properly define the ultra-weak variational formulation. In section 4, we prove upper and lower bounds between and for the proposed test norm (1.12) and compare our results with similar results already in the literature. We then apply our test norm in a variety of numerical experiments in section 5 with a special emphasis on a comparison with the test norm from [10], [11] before drawing conclusions in section 6.
Section snippets
Ultra-weak formulation
Setting in (1.1) gives the mixed formulation Next, we assume that is a triangulation of the domain Ω with K denoting a generic open element of diameter with which we associate the mesh skeleton Γ, that is, the union of all edges E in the triangulation. If we let v and τ denote scalar and vector (respectively) valued test functions which are allowed to be discontinuous across Γ then multiplying the first equation by v and the
Function spaces
In order for the ultra-weak formulation (2.8) to be well-defined, the vector spaces U and V need to be specified. Hence, this section is dedicated to introducing the notation necessary to define these spaces as well as some miscellaneous definitions and theorems which will be needed in the forthcoming analysis.
We begin by defining the broken -norm for the space , . Next, we introduce the ε-scaled broken -norm for the
Test norm
In this section, we will work to show that the norm is a test norm sufficiently close to that the corresponding energy norm (1.5) on U generated by is both an upper and lower bound for with favorable ε-dependent constants.
Numerical experiments
Before we begin our numerical experiments, we first need to select our discrete trial space . Recall that , the solution to (1.3), satisfies Theorem 1.8 which tells us that choosing the right DPG trial space is just as crucial as selecting a good optimal test norm. In particular, the finite element spaces need to be chosen such that for any polynomial degree we have where is the maximum mesh-size. We thus choose our finite element space
Conclusions
We proposed the mesh-dependent quasi-optimal test norm , for use in the DPG method based on the ultra-weak formulation of the convection-diffusion equation. We proved that this test norm is robust in the gradient component once the mesh has been sufficiently refined while also having favorable scalings in the solution component and the trace components. The proof requires only minimal assumptions on the convection in
References (32)
- et al.
A discontinuous hp finite element method for convection—diffusion problems
Comput. Methods Appl. Mech. Eng.
(1999) - et al.
Streamline upwind/Petrov-Galerkin formulations for convection dominated flows with particular emphasis on the incompressible Navier-Stokes equations
Comput. Methods Appl. Mech. Eng.
(1982) - et al.
Breaking spaces and forms for the DPG method and applications including Maxwell equations
Comput. Math. Appl.
(2016) - et al.
A robust DPG method for convection-dominated diffusion problems II: adjoint boundary conditions and mesh-dependent test norms
Comput. Math. Appl.
(2014) - et al.
Compatible algorithms for coupled flow and transport
Comput. Methods Appl. Mech. Eng.
(2004) - et al.
A class of discontinuous Petrov–Galerkin methods. Part III: Adaptivity
Appl. Numer. Math.
(2012) - et al.
A class of discontinuous Petrov–Galerkin methods. Part I: The transport equation
Comput. Methods Appl. Mech. Eng.
(2010) - et al.
An implicit high-order hybridizable discontinuous Galerkin method for linear convection–diffusion equations
J. Comput. Phys.
(2009) - et al.
Discontinuous Petrov-Galerkin method based on the optimal test space norm for one-dimensional transport problems
Proc. Comput. Sci.
(2011) - et al.
Automatically stable discontinuous Petrov–Galerkin methods for stationary transport problems: quasi-optimal test space norm
Comput. Math. Appl.
(2013)