Analysis of an HDG Method for Linearized Incompressible Resistive MHD Equations
Jeonghun J. Lee, Stephen Shannon, Tan Bui-Thanh, John N. Shadid

TL;DR
This paper introduces a hybridized discontinuous Galerkin method for stationary linearized incompressible MHD equations, providing error estimates and numerical verification of optimal convergence in multiple dimensions.
Contribution
It develops a novel HDG flux formulation for MHD equations enabling hybridization and derives rigorous error estimates with numerical validation.
Findings
Optimal convergence for fluid velocity and magnetic variables
Quasi-optimal convergence for other quantities
Numerical results confirm theoretical error estimates
Abstract
We present a hybridized discontinuous Galerkin (HDG) method for stationary linearized incompressible magnetohydrodynamics (MHD) equations. At the heart of the paper is the introduction of an HDG flux of the dual saddle-point form of the MHD equations that facilitates the hybridization of discontinuous Galerkin (DG) method. We carry out the error estimates for the proposed HDG method on simplicial meshes in both two- and three-dimensions. The analysis provides optimal convergence for the fluid velocity and the magnetic variables, and quasi-optimal convergence for the remaining quantities. Numerical examples are presented to verify the theoretical findings.
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.
\newsiamremark
remarkRemark \newsiamremarkhypothesisHypothesis
\newsiamthmclaimClaim \headersAn HDG Method for MHDJ. Lee, S. Shannon, T. Bui-Thanh, and J. N. Shadid
Analysis of an HDG method for linearized incompressible resistive MHD equations
††thanks: **Funding: ** This work was partially supported by DOE grants DE-SC0010518 and DE-SC0011118, NSF Grant DMS-1620352, and by DOE NNSA ASC Algorithms effort, the DOE Office of Science AMR program at Sandia National Laboratory under contract DE-AC04-94AL85000. We are grateful for the support.
Jeonghun J. Lee222Institute for Computational Engineering Sciences (ICES), The University of Texas at Austin, Austin, TX 78712 (, , ).
Stephen Shannon222Institute for Computational Engineering Sciences (ICES), The University of Texas at Austin, Austin, TX 78712 (, , ).
Tan Bui-Thanh222Institute for Computational Engineering Sciences (ICES), The University of Texas at Austin, Austin, TX 78712 (, , ). 333Department of Aerospace Engineering and Engineering Mechanics, The University of Texas at Austin, Austin, TX 78712.
John N. Shadid444Computational Mathematics Department, Sandia National Laboratories, P.O. Box 5800, MS 1321, Albuquerque, NM 87185 (). 555Department of Mathematics and Statistics, University of New Mexico, Albuquerque, NM 87131.
Abstract
We present a hybridized discontinuous Galerkin (HDG) method for stationary linearized incompressible magnetohydrodynamics (MHD) equations. At the heart of the paper is the introduction of an HDG flux of the dual saddle-point form of the MHD equations that facilitates the hybridization of discontinuous Galerkin (DG) method. We carry out the a priori error estimates for the proposed HDG method on simplicial meshes in both two- and three-dimensions. The analysis provides optimal convergence for the fluid velocity and the magnetic variables, and quasi-optimal convergence for the remaining quantities. Numerical examples are presented to verify the theoretical findings.
keywords:
hybridized discontinuous Galerkin methods, resistive magnetohydrodynamics, a priori error analysis, Stokes equations, Maxwell equations
{AMS}
65N30, 65N12, 65N15, 76W05
1 Introduction
An important base-level representation for continuum approximation of the dynamics of charged fluids in the presence of electromagnetic fields is the resistive magnetohydrodynamics (MHD) model. MHD models describe important physical phenomena in astrophysical systems (e.g. solar flares, and planetary magnetic field generation) and in critical science and technological applications (e.g., magnetically confined fusion energy devices) [28], for example. The single fluid resistive MHD model involes the partial differential equations (PDEs) describing conservation of mass, momentum, and energy, coupled with the low-frequency Maxwell’s equations. This multiphysics PDE system is highly nonlinear and characterized by multiple interacting physical phenomena spanning a wide range of length- and time-scales. These characteristics make the task of developing scalable, robust, accurate, and efficient computational methods extremely challenging.
The most common computational solution strategies for MHD have been the use of explicit and partially implicit time integration methods. Notably are implicit-explicit [2, 43, 35], semi-implicit [47, 30, 50], and operator-splitting [33, 45] techniques that include some use of implicit operators in the formulation. The implicitness of these approaches is used to enhance efficiency by removing stringent explicit time-scale constraints in the problem, either from diffusion or from fast-wave phenomena [9, 36].
In addition to the challenges associated with designing robust and efficient time integrators, there are a number of spatial discretization issues including the dual saddle-point structure of the velocity-pressure and the enforcement of the solenoidal involution/constraint on the magnetic induction . This adds considerable complexity to the numerical approximation of resistive MHD system. In the context of finite volume and finite element methods, there are four popular approaches to deal with these difficulties: 1) physics-compatible discretizations that directly enforce key mathematical properties of the continuous problem (see e.g. [39, 34, 3]); 2) methods that transform to potential-based formulations to eliminate one or both saddle-point sub-systems [10, 43, 37, 48]; 3) exact and weighted-exact penalty formulations [29, 25, 19, 20]; and 4) and stabilization methods that regularize the dual saddle-point structure [46, 18, 49].
In this paper we propose a hybridized discontinuous Galerkin (HDG) formulation for a linearized version of the resistive MHD system. The hybridization technique and post-processing have been proposed to reduce computational costs of saddle-point problems and to improve the accuracy of numerical solutions [1]. HDG methods were developed by Cockburn, coauthors, and others to mitigate the computational costs of classical discontinuous Galerkin (DG) methods. They have been proposed for various types of PDEs including, but not limited to, Poisson-type equations [13, 15, 40, 22], the Stokes equation [12, 41], the Oseen equations [8], and the incompressible Navier-Stokes equations [42].
In HDG discretizations, the coupled unknowns are single-valued traces introduced on the mesh skeleton, i.e., the faces, and for high order implicit systems the resulting matrix is substantially smaller and sparser compared to standard DG approaches. Once they are solved for, the volume DG unknowns can be recovered in an element-by-element fashion, completely independent of one another. Therefore HDG methods have an intrinsic structure for parallel computing which is essential for large scale applications. Nevertheless, devising an HDG method for coupled PDE systems is challenging because construction of a consistent and robust HDG flux is nontrivial. We adopt the upwind HDG framework proposed in [5, 7, 6] since it provides a systematic construction of HDG methods for a large class of PDEs.
Our work starts with section 2 where notations and conventions are introduced to enable the construction of HDG method in section 3. Specifically, the proposed HDG method is introduced directly on the dual saddle-point structure of the MHD system and its well-posedness is analyzed using an energy approach. This is followed by the a priori error estimation in section 4 where we combine an energy analysis, specially designed projections, and a duality argument to provide convergence rates for all variables. Our development can serve as a standalone high-order solver for linearized MHD equations, or can be used as the fast-time scale solver in an implicit/explicit time integration method, and/or the solver for a sub-step in a fixed-point nonlinear solver. Various numerical results will be presented in section 5 to verify our theoretical findings. Section 6 concludes the paper with future work. This is followed by four appendices in which we detail the definition and analysis of projection operators, state some auxiliary results, discuss the well-posedness of the adjoint equation, and present a postprocessing procedure to enforce the solenoidal constraints.
2 Notation
In this section we introduce common notations and conventions to be used in the rest of the paper. Let , , be a bounded domain such that it is simply-connected and its boundary is a Lipschitz manifold with only one component. Suppose that we have a triangulation of , i.e., a partition of into a finite number of nonoverlapping -dimensional simplices. We assume that the triangulation is shape-regular, i.e., for all -dimensional simplices in the triangulation, the ratio of the diameter of the simplex and the radius of an inscribed -dimensional ball is uniformly bounded. We will use and to denote the sets of - and ()-dimensional simplices of the triangulation, and call the mesh skeleton of the triangulation. The boundary and interior mesh skeletons are defined by and . We also define . The mesh size of triangulations is .
We use (respectively ) to denote the -inner product on if is a - (respectively -) dimensional domain. The standard notation , , , is used for the Sobolev space on based on -norm with differentiability (see, e.g., [23]) and denotes the associated norm. In particular, if , we use and . denotes the space of functions whose restrictions on reside in for each and its norm is if and . For simplicity, we use , , , , and for , , , , and , respectively. We define . Furthermore, we denote by the inequality with a constant independent of the mesh size, and by the combination of and .
For vector- or matrix-valued functions these notations are naturally extended with a component-wise inner product. We define similar spaces (respectively inner products and norms) on a single element and a single skeleton face/edge by replacing with and with . We define the gradient of a vector, the divergence of a matrix, and the outer product symbol as:
[TABLE]
In this paper denotes a unit outward normal vector field on faces/edges. If for two distinct simplices , then and denote the outward unit normal vector fields on and , respectively, and on . We simply use to denote either or in an expression that is valid for both cases, and this convention is also used for other quantities (restricted) on a face/edge . For a scalar quantity which is double-valued on , the jump term on is defined by where and are the traces of from - and -sides, respectively. For double-valued vector quantity and matrix quantity , jump terms are and where denotes the matrix-vector product.
We define as the space of polynomials of degree at most on a domain , and
[TABLE]
The space of polynomials on the mesh skeleton is similarly defined, and their extensions to vector- or matrix-valued polynomials , , , etc, are straightforward.
3 HDG Formulation
We consider the following nondimensional linearized incompressible MHD system [32]
[TABLE]
where is velocity of the fluid (plasma or liquid metal), the magnetic field, the fluid pressure, and a scalar potential. The following are constant parameters: a fluid Reynolds number , a magnetic Reynolds number , and a coupling parameter , with the Hartmann number . Here, is a prescribed magnetic field and with is a prescribed velocity.
By introducing auxiliary variables and , we cast (1) into a first order hyperbolic system:
[TABLE]
In this paper, we consider the following (Dirichlet) boundary conditions for the MHD system (2)
[TABLE]
where we have defined the tangent component of a vector as . Additionally, we require the compatibility condition for :
[TABLE]
For the uniqueness of the pressure, , we require that the pressure has zero mean, i.e.,
[TABLE]
Following the upwind HDG framework in [5] we define the HDG flux as
[TABLE]
where , , and are the single-valued trace quantities residing on the mesh skeleton . They will be new unknowns in the discretizations, which will be described later, to hybridize the DG method. Here, , and , , and are constant parameters. As will be shown later, the conditions , , and are sufficient for the well-posedness of our HDG formulation. Note that all 6 components of the HDG flux, , for simplicity are denoted in the same fashion (by a bold italic symbol). It is, however, clear from (2) that is a third order tensor, is a second order tensor, is a vector, etc, and that the normal HDG flux components, , defined in (6), are tensors of one order lower.
For discretization we introduce the discontinuous piecewise polynomial spaces
[TABLE]
where if , and if .
Let us introduce two identities which are useful throughout the paper:
[TABLE]
These identities follow from integration by parts and vector product identities.
Next, we multiply (2a) through (2f) by test functions , integrate by parts all terms, and introduce the HDG flux (6) in the boundary terms. This results in a local discrete weak formulation, which we shall call the local solver of the HDG method, for the MHD system (2):
[TABLE]
for all and for all , where , , …, are the discrete counterparts of , , …, and is the discrete counterpart of in (6) by replacing the unknowns , , …, with their discrete counterparts.
Since , , and are the new unknowns, we need to equip extra equations to close the system (8). To that end, we observe that an element communicates with its neighbors only through the trace unknowns. For the HDG method to be conservative, we (weakly) enforce the continuity of the HDG flux (6) across each interior edge, i.e., . Since and are single-valued on , , , and . The conservation constraints to be enforced reduce to
[TABLE]
for all , and for all in . Finally, we enforce the Dirichlet boundary conditions through the trace unknowns:
[TABLE]
for all for all in .
In (8), (9), and (10), we seek and . From this point forward, for simplicity in writing, we will not state explicitly that equations hold for all test functions, for all elements, or for all edges.
We will refer to and as the local variables, and to equation (8) on each element as the local solver. This reflects the fact that we can solve for local variables element-by-element as function of and . On the other hand, we will refer to and as the global variables, which are governed by equations (9) and (10) on the mesh skeleton. Finally, for the uniqueness of the discrete pressure , we enforce the discrete counterpart of (5):
[TABLE]
3.1 Well-posedness of the HDG formulation
In this subsection we discuss well-posedness of the system (8)–(10).
Theorem 3.1**.**
*The HDG system (8)–(11) is well-posed. *
Proof 3.2**.**
Since the problem is a system of linear equations with the same number of equations and unknowns, without loss of generality, we only need show that implies . To begin, we take and get
[TABLE]
If we integrate by parts the first four terms of the second equation and the first term of the fifth equation, sum the resulting equations, and sum over all elements, then we arrive at
[TABLE]
Here, we have used
[TABLE]
which is obtained from .
Next, we set , and sum (9) over all interior edges to obtain
[TABLE]
where we have used the continuity of to eliminate and .
Since and by assumption, we conclude from the boundary conditions (10) that , , and on . The integrals in (14) can then be written over since the contribution on the domain boundary, , is zero. Subtracting (14) from (13) we arrive at
[TABLE]
Finally, using the fact that and on , we can freely add to rewrite (15) as
[TABLE]
Choosing , , and , we can conclude that and , that , , and on , and that , , and on .
Now, we integrate (8a) by parts to obtain in , which implies that must be elementwise constant. The fact that on means is also continuous on , and since on we conclude that , and therefore .
Note that since on , is continuous on . Furthermore, the third conservation constraint in (9) implies that is continuous on . Integrating both (8d) and (8f) by parts, we can conclude that and on . When and on , and when is simply-connected with one component to the boundary, there is a constant such that (see, e.g., [26, Lemma 3.4]). This implies that , and hence .
*Considering the vanishing unknowns above, integrating by parts reduces (8b) and (8e) to and , respectively. Thus, and are elementwise constants. Since on , then is continuous on , and since on , we can conclude that , and hence . Finally, we use the first conservation constraint in (9) to conclude is continuous and hence constant on . Using the zero-average condition (11) yields . *
3.2 Well-posedness of the local solver
The key design of the HDG method is that it allows us to separate the computation of the volume (DG) unknowns and the trace unknowns . In practice, we first solve (8) for local unknowns as a function of . These are then substituted into the conservative algebraic equation (9) on the mesh skeleton to solve for the unknown . Finally, the local unknowns are computed, as in the first step, using from the second step. It is therefore important to study the well-posedness of the local solver.
Similar to HDG methods for Stokes equation [41, 16, 5], it turns out that the local solver is not well-posed unless extra conditions are imposed on the pressure. Two methods for achieving the well-posedness of the local solver for the Stokes equations are proposed in [41]. One is a pseudotransient approach, and the other involves introducing the element average edge pressure as global unknowns. These methods are both suitable for our setting here. Here, we present a new approach in which we introduce the elementwise pressure integral as a global unknown and require their sum to vanish. Toward this goal, we introduce the space of elementwise constants, . Next we augment (8c) to read
[TABLE]
with , the average of in , and the volume of element . Next we augment the global solver with
[TABLE]
for all in , and remove the constraint (11), which will be automatically satisfied by this construction.
To justify (17) and (18) we make the following observations. First, summing (18) over all elements and using the compatibility condition on , (4), we conclude
[TABLE]
and
[TABLE]
Next, setting on in (17) and using (20), we can conclude that
[TABLE]
and therefore that (8c) holds for each . Additionally, (21) and (19) imply that (11) holds. Finally, we note that we have added the same number of new unknowns as the number of equations in (18).
For this modified HDG scheme we claim well-posedness of the local solver.
Theorem 3.3**.**
*The local solver given by (8) such that (8c) is replaced by (17), is well-posed. In other words, given , there exists a unique solution
to the system. *
Proof 3.4**.**
We show that implies . To begin, set . Then (17) reduces to , and taking as constant gives and hence .
Next, choose , integrate by parts the first four terms in (8b) and the first term in (8e), and sum the resulting equations in the local solver to conclude
[TABLE]
Recalling we have set , , and , we can conclude that
[TABLE]
*Using an argument similar to that in Section 3.1 we can conclude that in . From (8b) and (8e) we can conclude and , respectively. Thus, and must be constant, and since on , is identically zero in . Now since , we have in . *
Remark 3.5**.**
*Note that introducing and equations (17) and (18) does not alter the solution of the original HDG scheme. Indeed, if is a solution of the modified scheme, it is also a solution of the original one because the modified scheme contains all the equations of the original one, except for (8c) and (11). But we have already shown that (17), (18), and (4) imply (8c), and that (21) and (19) imply (11). Conversely, reversing these arguments, if is a solution of the original scheme, we can define as in (21) and add (21) to (8c) to recover (17). Then, taking as constant in (8c) implies (20). Also, (21) and (11) imply (19). Finally, adding (20) and (19) we recover (18), showing that is a solution of the modified one. Since the original HDG scheme is well-posed, so is the modified one. *
4 Error analysis
For an unknown we use to denote the error between the exact solution and its finite element approximation . For example, and , where is the trace of the exact solution on the mesh skeleton. We use to denote some interpolation (or projection) of the unknown into its associated finite element space, and decompose into where
[TABLE]
Here the superscript of denotes the ‘I’nterpolation (in fact projection) error, and the superscript of indicates the difference between the interpolation of the exact solution and the finite element approximation. We will see that may not depend only on . In particular, we define a collective projection in Appendix B for our HDG scheme. Each component of may depend on the others. Nonetheless, for simplicity of presentation we use to denote the -component of for example. The analysis and the properties of the proposed projection can be referred to Appendix B. This projection simplifies the error equation substantially as we now see.
Lemma 4.1**.**
*Assume that the exact solution of (2)-(3) is sufficiently regular. Then the exact solution satisfies (8)–(10). That is, if we replace with in (8)–(10), then (8)–(10) hold true for all . *
Proof 4.2**.**
*Multiply (2) by , integrate over , and integrate by parts. By the regularity assumptions on the solution, the solution components are single valued on . and the exact solution satisfies (8). With the additional fact that and are also single-valued on , we have that the exact solution satisfies (9). Finally, the boundary conditions (3) trivially imply that the exact solution satisfies (10). *
Lemma 4.3** (Error equation).**
The discretization errors satisfy
[TABLE]
Proof 4.4**.**
Using the fact that the numerical solution and exact solution both satisfy (8) (see Lemma 4.1), the linearity of the operators lead to the following error equations:
[TABLE]
Next, we split the error terms into their interpolation and approximation components as in (23) using the projections defined in Appendix B. Due to the cancellation properties of we obtain reduced error equations:
[TABLE]
More details of the cancellation properties of used in the above formula are:
[TABLE]
Notice that (26) looks like (8), but with the approximation error replacing the finite element solution, and with some nonzero right hand side terms. Since the approximation error is in the finite element spaces, we can choose the test functions to be the approximation error terms. Similar to the procedure to arrive at (13), we take , integrate by parts the first four terms of (26) and the first term of (26e), and sum the resulting equations in (26) to arrive at
[TABLE]
For the boundary conditions and conservation conditions, since the exact solution satisfies (9)–(10), we have
[TABLE]
We split the error terms into their interpolation and approximation components as before, and use the projections defined in Appendix B to cancel terms. More detailed roles for cancellations are
[TABLE]
and recall that the definitions of for , , are projections. Then we have
[TABLE]
In (29b), we can also erase but we did not do it on purpose.
Equations (29d)–(29f) imply that on , , , and . In consideration of this zero contribution on , summing of the formulae (29a)–(29c) with including gives
[TABLE]
Subtracting (4.4) from (27), we arrive at
[TABLE]
*Following the same procedure to get (16) from (15), we obtain the conclusion. *
Lemma 4.5**.**
There holds:
[TABLE]
Proof 4.6**.**
It is clear that bounding the energy is the same as bounding the right hand side of (24). The estimate of is straightforward by Cauchy-Schwarz inequality. To estimate , note first that an algebraic computation gives
[TABLE]
The boundedness of the left hand side can be obtained by
[TABLE]
where is the projection of to the piecewise constant space on , and here we used (57f), Hölder inequality , the Bramble–Hilbert lemma (see e.g., [4]) and the inverse estimate in the last two inequalities.
For an estimate of , we first note that
[TABLE]
due to (57j). A similar argument as above gives
[TABLE]
*Finally, we simply use the Cauchy-Schwarz/Hölder inequality for the last term on the right hand side of (24). *
Corollary 4.7** (Energy estimate).**
There holds:
[TABLE]
Proof 4.8**.**
*Apply Young’s inequality to each of the terms on the right side of (31) involving and . Note also that is the best approximation of on , so is bounded by . *
In the energy estimate (33), we do not have direct control on and . In the following, we employ an indirect approach to control these quantities via a duality argument. A similar approach for the Oseen equation has been conducted in [8]. It is more complicated for our MHD system due to the coupling between fluids and electromagnetics. In particular, and are coupled and have to be simultaneously analyzed. To begin, we define a dual problem of the MHD system (2) as
[TABLE]
with homogeneous boundary conditions. Here, and are two given functions in , and the superscript “*” is used to denote the corresponding unknowns in the adjoint equation. We assume the following regularity estimate holds for the adjoint problem (34)
[TABLE]
The well-posedness of (34) and the conditions under which the regularity estimate (35) holds are discussed in Appendix C.
We use the interpolation operators defined in Appendix A (77), (78) below and , , … will denote , , etc. Testing (34b) with and (34e) with we have
[TABLE]
where we have used integration by parts in the second equality, the properties of the operators (77) and (78) in the third equality, and integration by parts again in the last equality.
Lemma 4.9**.**
The following identities hold true:
[TABLE]
Proof 4.10**.**
In (26), choose test functions to be the adjoint projections . Noting the identities
[TABLE]
*all the results follow immediately except the fifth one. In the fifth identity, note that the first equality is trivial by the definitions of and , and the second equality comes from (26) with the orthogonality of and . *
Substituting the result of Lemma 4.9 into (36) we obtain
[TABLE]
Note first that the last term in the second line and the first term in the last line can be simplified as . Note also that we can use (34a), (34c), (34d), (34f) to get
[TABLE]
We can subtract the projections on the mesh skeleton, , , of , , , in flux terms using the flux conservation of interpolation operators and numerical solutions, i.e., (29a), (29b), (29c). Moreover, we can subtract them on the domain boundary since , , , and are zero there. If we use the above three observations, i.e., the simplification of the two terms, substitution of volume integral terms using (37), and the subtraction of projections on the mesh skeleton, then we have (some terms are colored for readers’ convenience)
[TABLE]
Note that the integration by parts and properties of and yield
[TABLE]
These two identities simplify the second and third lines of the above formula and yield
[TABLE]
To simplify it further, we note the identities
[TABLE]
where cancellations come from the properties of , , and the orthogonalities of and to polynomials. We use these identities to the previous formula, more precisely, to the last two terms in the third line, to the fourth line, to the last terms in the last two lines. Then we obtain (here some terms are colored only for readers’ convenience later)
[TABLE]
Here we used the facts and . Algebraic manipulations with (7) yield
[TABLE]
We reduce this further, particularly from the third to ninth lines. For the third line, note that , , and the exact solution are single-valued, and . Note also that holds. Then the third line is
[TABLE]
where the vanishing equality comes from (78c). For the fourth line, note first that
[TABLE]
where the second equality is valid because is constant on each facet. Then the fourth line is
[TABLE]
where we use (78c) again. Note that
[TABLE]
From these the fifth and sixth lines are rewritten as
[TABLE]
Further, the seventh, eighth, ninth lines are vanishing, i.e.,
[TABLE]
where we used (77c) for the first two identities, and the fact for the third identity. Finally, \left({\varepsilon}_{\boldsymbol{J}}^{h},-{\varepsilon}_{\boldsymbol{J}^{*}}^{I}\right)={\color[rgb]{1,0,0}0} by the definition of . As a consequence, we have a reduced formula
[TABLE]
Estimation for : Combining the estimate for and the regularity estimate (see (80)) gives
[TABLE]
Estimation for : Using (34a), (57i), (57j), Lemma A.3, and the regularity of the adjoint solutions, we have
[TABLE]
Estimation for : By the identity (32), it suffices to estimate
[TABLE]
By the triangle inequality, the inverse estimate, and (80), we have
[TABLE]
and we also have
[TABLE]
thus
[TABLE]
Estimation for : By an argument similar to the estimate of above, . Since ,
[TABLE]
Estimation for and : Integrating by parts (see (7)) we have
[TABLE]
Now we can write as
[TABLE]
For the first term, as in the estimate of , it suffices to estimate
[TABLE]
Invoking the Hölder’s inequality and an inverse estimate we can bound the upper bounds of the first term as
[TABLE]
For the second term, we first observe that
[TABLE]
By the Hölder inequality,
[TABLE]
where we used the fact that and are the best approximations on . By Lemma A.2 this can be estimated by . As a consequence,
[TABLE]
Estimation for , , and : Integrating by parts (see (7)) gives
[TABLE]
Some algebraic manipulations give
[TABLE]
The first term is easily estimated by
[TABLE]
For the second term we have
[TABLE]
where we used Lemma A.2 and the discrete trace inequality. Using the Cauchy–Schwarz inequality, (80), and Lemma A.2, the third term is bounded by
[TABLE]
Combining the above estimates we conclude
[TABLE]
Estimation for : Using the approximation capability of the projector (see Appendix B) we have
[TABLE]
At this point we are ready to estimate the discretization errors for , , , and . For readability let us absorb , , , Re, Rm, , and the norms on and into the implicit constants.
Theorem 4.11**.**
Suppose that , , and are chosen to be positive constants independent of , Re, Rm, , , and . Suppose also that is sufficiently small, i.e.,
[TABLE]
with (depending on the coefficients in estimates (43) and (44)). Then it holds that
[TABLE]
and the following error estimates hold:
[TABLE]
Proof 4.12**.**
We proceed by taking , in (34). If we use (38), the estimates (39)–(45), and Young’s inequality, we can obtain
[TABLE]
which can be simplified to become
[TABLE]
if the constants that multiply and in (43) and (44) are sufficiently small, which is true under the assumptions we have made on , , and together with (46). The discretization error terms on the right hand side of (51) (i.e., terms with superscript “”) are bounded by (see definition of in (31)). This implies
[TABLE]
Applying Young’s inequality to the right side of (33) for , , and using (52), we get
[TABLE]
Then (47) follows from the approximation properties of with the trace inequality Lemma A.2 discussed in Appendix B and A, respectively. Further, it gives
[TABLE]
*where the first inequality is from the definition of in (24). Then (48) follows from the triangle inequality. Finally, the above estimate with (52) and the triangle ineqality give (49). *
What remains is to estimate and , and to that end we extend the argument in [8] for our MHD system.
Theorem 4.13**.**
There holds:
[TABLE]
Proof 4.14**.**
We consider a projection operator defined by
[TABLE]
for and , where is the subspace of which is orthogonal to in . Its well-posedness is based on the orthogonal decomposition (see [17, Lemma 4.1])
[TABLE]
and it has optimal approximation property by the Bramble–Hilbert lemma.
Since is the -projection, from (11) we have
[TABLE]
that is, has zero mean. It is known [27] that there exists a function that and . For such a , we have
[TABLE]
where we have performed integration by parts twice and used the definition of the projector . Since the exact solution and its trace also satisfy the HDG local (sub-) equation (8b), we can add and subtract the corresponding projections in (57) to obtain
[TABLE]
where we have taken as the test function in (8b).
Combining (53) and (4.14) yields
[TABLE]
which can be further simplified using two facts: first, integrating by parts twice and using the definition of give
[TABLE]
and second, we combine the first equation in (9) and (57k) to have
[TABLE]
In particular, we obtain
[TABLE]
By the triangle and Hölder inequalities,
[TABLE]
*where we have used Lemma A.3, the approximation capability of and the -projection, definition of in (24), the property of , and we absorb all mesh independent parameters into the implicit constant in the final inequality. As a consequence, we have . Then the conclusion follows from the triangle inequality and the estimates of and . *
For an analogous result for , we make use of the following Lemma.
Lemma 4.15**.**
*There exists some such that , on , and . *
Proof 4.16**.**
Let be the mean-value of in and be the indicator function on . It is well known that there exists in such that , . Since is a bounded domain with polyhedral boundary, consists of finitely many piecewise smooth -dimensional components, so there exists a nonnegative smooth function on supported on the interior of the smooth components. Let be the renormalized function of satisfying . Then holds because is a smooth function on , and there is such that and (cf. [24, Theorem II.4.3])
[TABLE]
According to a result in [24, p.176], there exists in such that , on , and also satisfies
[TABLE]
*The conclusion follows by taking . *
Theorem 4.17**.**
There holds:
[TABLE]
Proof 4.18**.**
*First choose a function that satisfies the statements of Lemma 4.15, and consider *
[TABLE]
From (26e) with , we have
[TABLE]
If we use this to the previous identity, and also use the flux condition (28b) with as the test function, we have
[TABLE]
where the surface integrals on the domain boundary are zero due to the fact that on and (28f). Note that
[TABLE]
With these identities and (28b) we have
[TABLE]
By the triangle, Hölder, and trace inequalities,
[TABLE]
Since and , we have
[TABLE]
*The conclusion follows from the triangle inequality and the estimates of and . *
5 Numerical Results
In this section we apply the proposed HDG scheme for 2D MHD problems. The application for large-scale 3D problems is ongoing and will be presented elsewhere. The first problem we consider is the Hartmann flow whose analytical solution exists and is one dimensional in nature. The second problem is posed on a non-convex domain to demonstrate the approximation capability of our proposed HDG scheme though the non-convexity is not covered by our theory. To further challenge the proposed HDG approach, we will consider a singular problem as the third example.
Before presenting the results for each example, we make some general observations to differentiate the proposed HDG scheme from the DG method of [32]. First, recalling the primary motivation of HDG schemes, we have a reduced global system to solve for, which offers computational savings, especially for high-order solution of large-scale problems. Second, the HDG scheme allows the convenience of equal polynomial order approximations of all unknowns with direct approximations of and . On the other hand, the DG method of [32] employs polynomials of order and for and , respectively, where is the order of approximation of and , and , are approximated by the derivatives of and . These differences make a direct comparison of the two methods difficult. The DG scheme is proven to be optimal (converging with ) in the DG energy norms for sufficiently smooth solutions. By the definitions of these norms in [32], , , , and are proven to converge at worst with in the norm. Optimal convergence of for and is not proven in [32], but is demonstrated in all numerical examples with smooth solutions. On the other hand, the HDG scheme is proven to be optimal () for and and quasi-optimal () for the remaining local quantities. These rates are demonstrated (and sometimes exceeded) in the numerical examples involving smooth solutions. For the numerical example involving a singular solution, the HDG scheme gives similar error magnitudes and convergence rates as in the DG scheme for and for the same polynomial order .
We note that the numerical solutions and in the numerical results below satisfy the divergence-free constraint in the weak sense. However, the pointwise divergence-free constraint can be fulfilled by a post-processing procedure outlined in Appendix D, which shows that convergence rates of the post-processed solutions to the exact solutions are as good as those of and . For that reason, we do not use the post-processed solution in the error computation.
5.1 Hartmann Flow
In this numerical study, we consider a conducting incompressible fluid (liquid metal, for example) in a domain (bounded by infinite parallel plates in the direction [32, 49]). The fluid is subject to a uniform pressure gradient in the direction, and a uniform external magnetic field in the direction. If we consider no-slip boundary conditions on the boundaries, the resulting flow pattern is known as Hartmann flow which admits an analytical solution which is one dimensional in nature. We assume that the infinite parallel plates are perfectly insulating. Here, we consider the Hartmann flow in a 2D domain . If we define the characteristic velocity as , and consider the driving pressure gradient as a forcing term (incorporated in ), the non-dimensionalized solution with , reads
[TABLE]
where , and is a constant that enables to satisfy the zero average pressure condition (5). We set and , and we enforce the boundary conditions on using the exact solution, i.e., , , and .
At refinement level , the domain is divided into squares, each of which is divided into two triangles from top right to bottom left. In Figure 1 are the convergence plots with and . The convergence rates for , , , , , and are observed to be approximately , , , , , and , respectively. These observed rates approximately match or exceed their respective theoretical rates of , , , , , and which were proven in Section 4.
5.2 Non-convex Domain
This example illustrates the convergence of the HDG scheme applied to a problem posed on the non-convex domain in Figure 2 (similar to Section 5.1.1 in [32]). We take , , and . We set and such that the manufactured solution for (1) is the following
[TABLE]
where is the constant that enables to satisfy the zero average pressure condition (5). We use the exact solution to enforce the boundary conditions , i.e., , , and .
At refinement level , each quadrant of the domain (see Figure 2 for an example with ) is subdivided into squares, each of which is divided into two triangles from top right to bottom left. In Figure 3 are the convergence plots. For this problem, we observe the optimal convergence rates of for all of the local variables, which matches or exceeds the rates proven in Section 4.
5.3 Singular Solution
Although we do not discuss the implications of singular solutions on the theoretical convergence rates of the HDG scheme, applying the scheme to such a problem is instructive in assessing its robustness. This example illustrates the convergence of the HDG scheme using a manufactured solution with a singularity (similar to the example in Section 5.2 of [32]). In particular, we consider the same non-convex domain and mesh refinement as in the previous example (see Figure 2). We take , , and . We choose and such that the analytical solution of (1) has the form
[TABLE]
where
[TABLE]
On we use the exact solution to set the boundary condition, i.e., , , and . For this problem, it is known that , , and , and that the solution contains magnetic and hydrodynamic singularities that are among the strongest singularities [32].
Convergence results for this problem are shown in Figure 4. For the fluid variables , , and , we observe convergence rates of approximately , , and , respectively. For the magnetic variables , , and , we observe convergence rates of approximately , , and , respectively.
5.4 3D numerical experiments on cubical meshes
We show numerical results for a three dimensional problem with our HDG method adapted to hexahedral meshes with tensor product polynomial spaces. Our theoretical analysis is only on the method on tetrahedral meshes, so it does not support this method on cubical meshes. Nonetheless we present this numerical result here in order to demonstrate that the HDG method can be applied to 3D problems and can be implemented using hexahedral meshes.
We set , , , and set the forcing functions and boundary conditions to solve for the manufactured solution
[TABLE]
with Dirichlet boundary conditions applied on for , , and the tangential components of .
Convergence rates of -errors with respect to uniform mesh refinements are given in Figure 5. The convergence rates of and are optimal with order , and the convergence rate of is suboptimal with . On the contrary, the errors of , , seem to have slightly lower convergence rates between and .
6 Conclusions and future work
In this paper we have constructed an HDG method for a linearization of the incompressible resistive magnetohydrodynamics equations. We have carried out the a priori error analysis using elaborate interpolation operators, a duality argument with elliptic regularity assumptions, and an energy approach. Specifically, this allows us to prove optimal convergence for the velocity variable, , and the magnetic field variable, , and quasi-optimal convergence for the remaining quantities , , , and . Numerical performances of the method are tested on three examples: the Hartmann flow, a manufactured solution over a non-convex domain, and singular solution on a non-convex domain. The numerical results show that the theoretical convergence rates of all the unknowns are obtained for smooth solutions even when the elliptic regularity assumption of domain fails to hold. Ongoing work includes 3D computation on parallel computers for large-scale problems and extensions of our HDG method to nonlinear time-dependent magnetohydrodynamics equations.
Appendix A Auxiliary results
In this appendix we collect some technical results that are useful for our analysis.
Lemma A.1** (Inverse Inequality. [44, Lemma 1.44]).**
For with , there exists independent of such that
[TABLE]
Lemma A.2** (Trace inequality. [44, Lemma 1.49]).**
For and for with , there exists independent of such that
[TABLE]
Applying the arithmetic-geometric mean inequality to the right side, we can derive
[TABLE]
If is in piecewise polynomial spaces, we can derive the following inequality from Lemma A.2 and the inverse inequality (Lemma A.1):
[TABLE]
Lemma A.3**.**
Suppose that is a bounded interpolation which is a projection on . Then
[TABLE]
Proof A.4**.**
For any constant , , so
[TABLE]
*where we have used the Poincaré inequality and the approximation property of in the last inequality. *
Appendix B Definition of projections and their properties
In this section we use , , for spaces of scalar, -dimensional vector, matrix-valued polynomials. By , , we denote the spaces of polynomials of order at most orthogonal to all polynomials of order at most . contains the tangential component of all polynomials in . We desire to have error equations conform to the original equations to facilitate the error analysis. To begin, we define a collective interpolation operator implicitly through the interpolation errors , , etc, where , , etc, are components of the collective interpolator on , etc. Specifically:
- •
projections on or on are defined as:
[TABLE]
The well-definedness and optimality of the -projections are clear. The coupled projector has been studied in [15], and in particular we have
[TABLE]
where, again, for simplicity we choose the same solution order for all the unknowns. Here, we assume that and are sufficiently smooth, that is, and .
To understand the approximation capability of the coupled projector we need to recall a result in [15, Lemma A.1].
Lemma B.1**.**
*Suppose that . Then, for any , the map is an isomorphism and holds with a constant independent of . *
Lemma B.2** (Estimation for ).**
Suppose , , , , and . The projection is well-defined and optimal, i.e.,
[TABLE]
*where . *
Proof B.3**.**
We extend the proof of a result in [8]. To begin, we define , take for some which will be determined later, and rewrite (57k) as
[TABLE]
where we have used the integration by parts in the second equality, definitions of the projections , , and , the orthogonality between and , and the orthogonality in the last equality. Now, let be the projection of and define . By the triangle inequality, it suffices to estimate the approximation capability of . From the above formula, we have
[TABLE]
Since , we can take to obtain
[TABLE]
where we have used in the integration by parts
[TABLE]
By Lemma B.1 and the fact that , we have
[TABLE]
We now estimate . Defining , note that holds due to the definition of . Thus, we have
[TABLE]
where we have used , the inverse inequality, and the continuous and discrete trace inequalies ((55) and (56), respectively) in the last step. Taking the approximation capability of into account, we get
[TABLE]
The estimate of is straightforward since :
[TABLE]
For the estimate of , note that
[TABLE]
Using the definition of as the -projection, the continuous and discrete trace inequalies ((55) and (56), respectively), the above estimate of (63), and finally the estimate of in (58a), we have
[TABLE]
*Using (61), (62), and (64) in (60), and using the triangle inequality ends the proof. *
To estimate , we need some auxiliary results. We first recall a result with a sketch of its proof.
Lemma B.4**.**
Let be a fixed face of the simplex . For and , we define as
[TABLE]
*Then, . *
Proof B.5**.**
We refer to [11] for the existence and uniqueness of . Let and . By the standard scaling argument,
[TABLE]
To estimate , note that there exists , such that , and the first component of , say , is
[TABLE]
*Since by the definition of , by Lemma B.1. The estimate follows easily by using this inequality to each component of . *
We now recall other known facts without proofs (cf. Lemma 4.8 in [14]).
Lemma B.6**.**
*For a face of , let be an orthogonal basis of the vectors orthogonal to , and let . This is a basis of the space of matrices. *
Lemma B.7** (Estimation for ).**
Assume , , , and . Furthermore, suppose the trace of the tensor vanishes, i.e., . There holds:
[TABLE]
Proof B.8**.**
We proceed in a manner similar to [8, Theorem 2.3] with adaptations corresponding to our more complicated projectors .
The dual basis of (see Lemma B.6) can be written as
[TABLE]
where for the and corresponding to the subscripts of , and 0 otherwise. Any matrix, , can be written as
[TABLE]
so
[TABLE]
Since is an element of independent of mesh size, this identity reduces the estimate of to the estimates of with and .
We first estimate with for some . Let be a fixed face of and define as
[TABLE]
and
[TABLE]
The existence and uniqueness of and follow from Lemma B.4. By the triangle inequality,
[TABLE]
Again by the triangle inequality, we bound the first term in (68) as
[TABLE]
where is the row-wise canonical Raviart-Thomas-Nédélec (RTN) interpolation operator into the row-wise -th order RTN element, which contains for all . From [11, Proposition 2.1 (vi)], we have that , and from a well known property of the canonical RTN interpolation operator we have that . Therefore, for the first term of (68) we have
[TABLE]
Note that is not necessarily in but the above argument does not require .
For the estimate of the second term in (68), note that the definitions of and give
[TABLE]
By Lemma B.4, we can estimate the second term in (68) as
[TABLE]
For the estimate of the third term in (68), recalling (57i), (57j), and (67a), we derive for all . Selecting with , we have that , and by Lemma B.1,
[TABLE]
for any of . From (57k) and (67b), we have, for
[TABLE]
with . Choosing and applying the Cauchy-Schwarz inequality to the above expression, we have
[TABLE]
where we have used the fact that , the continuous trace inequality (55), the bound on given by (63), and a similar bound for given by
[TABLE]
Combining the previous expressions, we have
[TABLE]
where we have used (58a) in the final step, but for simplicity in writing have not expanded . Thus, from the three estimates (69), (71), (73) with (68), we have
[TABLE]
To complete the estimate of , we need to estimate . First, by taking in (57i) with , we get
[TABLE]
where is the orthogonal projection into . For a fixed , taking with in (57k) and using (65), we also get
[TABLE]
where is a scalar function on defined by
[TABLE]
and is the orthogonal projection into . We define for and as
[TABLE]
We refer to [11, Lemma 3.1] for well-posedness of this interpolation and optimal approximation property. By an argument similar to Lemma B.4, we have
[TABLE]
For simplicity, we will use if .
Note that is an element-wise polynomial because , so . From this, the identities (75) and (76), and the above inequalities from scaling argument, we have
[TABLE]
The optimality of the orthogonal projection and the inverse trace inequality give
[TABLE]
and using this and the previous estimate, we can write
[TABLE]
*and here we used previous results on and in the final inequality. We completed the estimate of . *
We now define the adjoint projection . As in the splitting of errors with , we define
[TABLE]
for an adjoint unknown . We first define , , , , as projections into relevant polynomials spaces, and define , to satisfy
[TABLE]
We then choose , to satisfy
[TABLE]
where
[TABLE]
Assuming that are sufficiently regular, we can show that the interpolation is well-defined and provides optimal approximations. Due to the similarity between and , we can conclude
[TABLE]
It can also be shown that
[TABLE]
assuming . The proofs are analogous to those for the projections, with the only differences resulting from the absence of from (78c). As a consequence, from the elliptic regularity assumption (35), we have
[TABLE]
and the implicit constant depends on , , , , but not .
Appendix C Well-posedness and regularity of the adjoint
problem
In this section, we discuss the well-posedness of the adjoint equation (34) and conditions under which the regularity result (35) holds. For the well-posedness of (34) we can adapt the approach in [32]. In particular, since (34b) and (34e) satisfy the following antisymmetry:
[TABLE]
we can invoke a similar argument as in [32] to conclude
[TABLE]
because . We next assume that solutions of the Stokes and time-harmonic Maxwell equations (with [math] frequency) satisfy higher order regularities, i.e., when in (34), the solution , , satisfy and . Sufficient conditions for these assumptions are known but the details are beyond the scope of this paper, so we refer the readers to [21, 31, 38]. We now assume that is the solution of (34). From (34) and the regularity assumptions of the Stokes and Maxwell equations, we have
[TABLE]
The regularity of is already given in (81) and the regularity of and is obvious from the identities and .
Appendix D Divergence-free post-processing of and
In this appendix we adapt a postprocessing procedure in [14] to enforce the pointwise solenoidal constraint on and . For simplicity the exposition is done only for . For completeness, error estimates of the post-processed solutions will also be derived. To begin, let , , , be the barycentric coordinates of a tetrahedron , and be a symmetric matrix-valued bubble function defined by
[TABLE]
with the index counted modulo 4. Let be the space of -valued polynomials
[TABLE]
where is the space of homogeneous -valued polynomials of degree such that . We define by
[TABLE]
We recall an alternative characterization of the interpolation of the Brezzi–Douglas–Marini (BDM) element [14, Proposition A.1]:
[TABLE]
Our post-processed solution is defined as
[TABLE]
where . In two dimensions, i.e. , , , and are replaced by , , and the standard bubble function on , respectively.
The post-processed solution is in the BDM space, so its divergence is well-defined. Further, it is divergence-free because, for any ,
[TABLE]
where the last equality is due to (8c). For error analysis, it is enough to estimate . Using together with (82) and (83) gives
[TABLE]
Using a scaling argument yields
[TABLE]
On the other hand, by the triangle inequality we have
[TABLE]
Thus, the convergence rates of and are the same.
To post-process , we define as
[TABLE]
Then the divergence of is well-defined and by (8f). By a completely analogous argument as above and the fact , we can conclude
[TABLE]
hence the convergence rates of and are the same.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] D. N. Arnold and F. Brezzi , Mixed and nonconforming finite element methods: implementation, postprocessing and error estimates , RAIRO Modél. Math. Anal. Numér., 19 (1985), pp. 7–32.
- 2[2] A. Y. Aydemir and D. C. Barnes , An implicit algorithm for compressible three-dimensional magnetohydrodynamic calculations. , J. Comput. Phys., 59 (1985), pp. 108 – 19.
- 3[3] P. B. Bochev and A. C. Robinson , Matching algorithms with physics: exact sequences of finite element spaces , in Preservation of stability under discretization, D. Estep and S. Tavener, eds., Philadelphia, 2001, Colorado State University, SIAM, pp. 145–165.
- 4[4] S. C. Brenner and L. R. Scott , The Mathematical Theory of Finite Element Methods , Springer, Third ed., 2008.
- 5[5] T. Bui-Thanh , From Godunov to a unified hybridized discontinuous Galerkin framework for partial differential equations , Journal of Computational Physics, 295 (2015), pp. 114–146.
- 6[6] T. Bui-Thanh , From Rankine-Hugoniot condition to a constructive derivation of HDG methods , in Spectral and High Order Methods for Partial Differential Equations ICOSAHOM 2014, Springer, 2015, pp. 483–491.
- 7[7] T. Bui-Thanh , Construction and analysis of HDG methods for linearized shallow water equations , SIAM Journal on Scientific Computing, 38 (2016), pp. A 3696–A 3719.
- 8[8] A. Cesmelioglu, B. Cockburn, N. C. Nguyen, and J. Peraire , Analysis of HDG methods for Oseen equations , Journal of Scientific Computing, 55 (2013), pp. 392–431.
