Multisymplecticity of hybridizable discontinuous Galerkin methods
Robert I. McLachlan, Ari Stern

TL;DR
This paper establishes necessary and sufficient conditions for hybridizable discontinuous Galerkin methods to satisfy multisymplectic conservation laws, enabling structure-preserving discretizations of Hamiltonian PDEs with high-order accuracy.
Contribution
It provides a comprehensive characterization of multisymplecticity conditions for HDG methods, including common finite element variants, extending structure-preserving discretizations to high-order methods.
Findings
HDG methods satisfy multisymplectic conservation laws under specific conditions
Common finite element methods like mixed and nonconforming are multisymplectic when hybridized
Multisymplecticity holds for high-order methods on unstructured meshes
Abstract
In this paper, we prove necessary and sufficient conditions for a hybridizable discontinuous Galerkin (HDG) method to satisfy a multisymplectic conservation law, when applied to a canonical Hamiltonian system of partial differential equations. We show that these conditions are satisfied by the "hybridized" versions of several of the most commonly-used finite element methods, including mixed, nonconforming, and discontinuous Galerkin methods. (Interestingly, for the continuous Galerkin method in dimension greater than one, we show that multisymplecticity only holds in a weaker sense.) Consequently, these general-purpose finite element methods may be used for structure-preserving discretization (or semidiscretization) of canonical Hamiltonian systems of ODEs or PDEs. This establishes multisymplecticity for a large class of arbitrarily-high-order methods on unstructured meshes.
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.
\newaliascnt
lemmatheorem \aliascntresetthelemma \newaliascntpropositiontheorem \aliascntresettheproposition \newaliascntcorollarytheorem \aliascntresetthecorollary
\newaliascntdefinitiontheorem \aliascntresetthedefinition \newaliascntexampletheorem \aliascntresettheexample \newaliascntassumptiontheorem \aliascntresettheassumption
\newaliascntremarktheorem \aliascntresettheremark \newaliascntnotationtheorem \aliascntresetthenotation
Multisymplecticity of hybridizable discontinuous Galerkin methods
Robert I. McLachlan
IFS, Massey University
Palmerston North, New Zealand 5301
and
Ari Stern
Department of Mathematics
Washington University in St. Louis
Campus Box 1146
One Brookings Drive
Saint Louis, Missouri 63130
Abstract.
In this paper, we prove necessary and sufficient conditions for a hybridizable discontinuous Galerkin (HDG) method to satisfy a multisymplectic conservation law, when applied to a canonical Hamiltonian system of partial differential equations. We show that these conditions are satisfied by the “hybridized” versions of several of the most commonly-used finite element methods, including mixed, nonconforming, and discontinuous Galerkin methods. (Interestingly, for the continuous Galerkin method in dimension greater than one, we show that multisymplecticity only holds in a weaker sense.) Consequently, these general-purpose finite element methods may be used for structure-preserving discretization (or semidiscretization) of canonical Hamiltonian systems of ODEs or PDEs. This establishes multisymplecticity for a large class of arbitrarily-high-order methods on unstructured meshes.
2010 Mathematics Subject Classification:
65N30, 37K05
1. Introduction
1.1. Motivation and background
Hamiltonian systems of ordinary differential equations (ODEs) and partial differential equations (PDEs) are ubiquitous in applications, especially in the modeling of physical systems.
One essential property of a Hamiltonian ODE is that its time flow is symplectic: that is, it conserves a closed, nondegenerate -form on phase space. This has motivated the development of symplectic integrators: one-step numerical integrators that, when applied to Hamiltonian ODEs, are also symplectic maps. It turns out that these methods have several numerical advantages that result from preserving the symplectic structure. Furthermore, most of these methods (such as symplectic partitioned Runge–Kutta methods) may be applied to general systems of ODEs, whether or not the user is aware of any Hamiltonian/symplectic structure—but if such a structure is present, then the methods will automatically preserve them. For a comprehensive survey of structure-preserving numerical integrators, including symplectic integrators, see Hairer et al. [22].
Similarly, Hamiltonian PDEs satisfy a multisymplectic conservation law. Since symplecticity is a desirable property for numerical integration of canonical Hamiltonian ODEs, it is natural to seek numerical methods for canonical Hamiltonian PDEs whose solutions satisfy the multisymplectic conservation law, in an appropriate sense. There has been important work on multisymplectic methods over the past two decades, particularly by Marsden and collaborators [27, 29, 28, 25] and Reich and collaborators [37, 38, 10, 35, 16]. However, most of these methods have consisted either of tensor products of symplectic Runge–Kutta-type methods on rectangular grids or of relatively low-order, finite-difference-type methods on unstructured meshes. For the variational integrators of Marsden et al., one must also know the (Lagrangian) geometric structure of the PDE, in advance, in order to devise the method.
The impact of multisymplecticity on solutions to PDEs, and on their discretizations, is not fully understood. However, multisymplecticity is known to be necessary to preserve traveling waves of hyperbolic equations [30], and compact multisymplectic methods can preserve dispersion relations much better than non-multisymplectic methods or noncompact finite difference methods [5, 34, 33]. For boundary value problems, multisymplecticity restricts the types of bifurcations that can occur [31, 32]. Because it is a local property, multisymplecticity is a strictly stronger property than the symplecticity obtained by integrating over space.
There has been some previous work on the application of finite element methods to certain problems on structured (especially rectangular) meshes. Guo et al. [21] considered the 2-D nonlinear Poisson equation on a regular rectangular grid, meshed with biased triangles, using the continuous Galerkin method with linear shape functions, and they showed that the degrees of freedom satisfied a multisymplectic finite-difference scheme. Zhen et al. [44] did the same for first-order rectangular Lagrange elements on a regular grid. Chen [11] used first- and second-order rectangular elements to derive Lagrangian variational methods (in the sense of Marsden et al. [27]) and applied these to the sine-Gordon equation on a regular grid, while pointing out that higher-order elements could also be used in principle. In all of these examples, however, finite elements were really only used as a tool to construct a finite-difference stencil on a regular, 2-D rectangular grid.
As finite element methods are traditionally formulated, there is a serious conceptual obstacle to discussing multisymplecticity. Namely, many classical finite element methods are posed on spaces of global functions, making it difficult to make sense of local properties like the multisymplectic conservation law. Indeed, the interpretation of multisymplecticity is much more straightforward for finite difference or finite volume methods with local stencils, or for tensor products of 1-D integrators on a rectangular grid, which may explain why the previous work has been focused on such methods.
Hybrid finite element methods provide a way around this obstacle, since they consist of local problems coupled through their boundary traces, where the boundary traces are allowed to be independent variables. (Oftentimes, these boundary traces are interpreted as “Lagrange multipliers” enforcing weak continuity between local regions.) While hybrid methods have a long history (see the comprehensive work by Brezzi and Fortin [7]), the recent work of Cockburn et al. [13] has shown that a wide variety of finite element methods—including those not previously thought of as hybrid methods—may be “hybridized” within a unified framework. Such methods are called hybridizable discontinuous Galerkin (HDG) methods, and they include not only several classical mixed and hybrid methods, but also hybridized versions of continuous and discontinuous Galerkin methods, nonconforming methods, and others. This framework provides precisely the local structure needed to examine multisymplecticity of the finite element methods in this class.
1.2. Organization of the paper
The paper is organized as follows:
- •
In Section 2, we review systems of PDEs in a particular canonical form. This form includes the de Donder–Weyl equations for a Hamiltonian and many elliptic and hyperbolic variational PDEs. We recall the multisymplectic conservation law for classical (i.e., smooth) solutions and illustrate how this manifests concretely for a class of semilinear elliptic PDEs in mixed form. We also discuss the relationship between multisymplecticity of solutions and reciprocity principles in physical systems.
- •
In Section 3, we develop a hybrid “flux formulation” for these systems of PDEs. As in Cockburn et al. [13], this yields a collection of weak problems on non-overlapping subdomains, coupled only through approximate traces on their shared boundaries. Our framework includes not only the linear second-order elliptic PDEs considered by Cockburn et al. [13], but also a more general class of nonlinear systems of PDEs, including canonical Hamiltonian PDEs.
Within this formulation, we establish criteria for solutions to satisfy weak and strong versions of the multisymplectic conservation law; the distinction is shown to be related to weak and strong conservativity of numerical fluxes (cf. Arnold et al. [4], Cockburn et al. [13]). In addition to the subsequent numerical applications, we also use a domain-decomposition argument to write the weak problem (in the sense of distributions) in this flux formulation, thereby establishing multisymplecticity for weak solutions to Hamiltonian PDEs.
- •
In Section 4, we examine several particular classes of HDG methods, including the hybridized Raviart–Thomas (RT-H), Brezzi–Douglas–Marini (BDM-H), local discontinuous Galerkin (LDG-H), continuous Galerkin (CG-H), nonconforming (NC-H), and interior penalty (IP-H) methods. These methods are posed in the framework of Section 3, and their multisymplecticity is then examined. Each of these methods, except for CG-H, is proved to be strongly multisymplectic. A counterexample shows that CG-H is only weakly multisymplectic, resulting from the fact that it is only weakly conservative.
2. Canonical and multisymplectic systems of PDEs
2.1. Canonical systems of PDEs
Given a domain , consider a system of first-order PDEs having the form
[TABLE]
where and . Here, and are unknown functions on , while and are given functions on . We abbreviate and adopt the Einstein index convention of summing over repeated indices—so, for instance, the expression in (1) has an implied sum over and may therefore be interpreted as the divergence of .
Among these is the important class of (canonical) Hamiltonian systems,
[TABLE]
where is a function called the Hamiltonian. In the special case , the resulting system of ODEs yields Hamilton’s equations of classical mechanics, which are usually written as
[TABLE]
The equations (2) are called the de Donder–Weyl equations (de Donder [15], Weyl [43]). These canonical systems are an important special case of a more general class of Hamiltonian systems of PDEs, cf. Bridges [8, 9].
Throughout this section, we assume that all of the functions above are smooth. Later, in Section 3, we will relax this assumption in order to introduce a weak formulation of (1).
Example \theexample (semilinear elliptic PDE).
Let , so that is a scalar field and a vector field on . Consider
[TABLE]
where is symmetric and positive-definite with matrix inverse a_{\mu\nu}(x)\coloneqq\bigl{(}a^{\mu\nu}(x)\bigr{)}^{-1} at each , and where is arbitrary. Then the de Donder–Weyl equations for this Hamiltonian are
[TABLE]
From the first of these equations, we have , so substituting this into the second yields
[TABLE]
which is a second-order semilinear elliptic PDE in divergence form. Note that we could also have written the de Donder–Weyl equations in the equivalent, coordinate-free form,
[TABLE]
so the substitution yields
[TABLE]
which is an equivalent expression for the second-order PDE above.
An important special case is when for given and on . In this case, we obtain a linear second-order elliptic PDE,
[TABLE]
In particular, if (where is the Kronecker delta, i.e., is the identity matrix) and , then this simply becomes Poisson’s equation on .
We will regularly return to this example throughout the paper.
2.2. The multisymplectic conservation law
Define the collection of canonical 2-forms on , for .
Notation \thenotation.
Unless otherwise stated, differential forms and exterior differential operators (such as , , etc.) are assumed to be on , where (if it appears) is fixed. Differentiation with respect to will always be denoted using the previously-defined notation.
Definition \thedefinition.
Let be a solution to (1). A (first) variation of is a solution of the linearized problem
[TABLE]
The system (1) is multisymplectic if \partial_{\mu}\Bigl{(}\omega^{\mu}\bigl{(}(v,\tau),(v^{\prime},\tau^{\prime})\bigr{)}\Bigr{)}=0 for any pair of variations and . This is abbreviated by
[TABLE]
where it is understood that is evaluated on variations of solutions to (1). The equation (4) is called the multisymplectic conservation law.
Lemma \thelemma.
The system (1) is multisymplectic if and only if the -form on is closed for each .
Proof.
Using (1), we calculate
[TABLE]
so the first expression vanishes if and only if the last expression vanishes. ∎
Remark \theremark.
Certain steps in this calculation, such as , are seen to be valid by evaluating both sides on arbitrary variations of :
[TABLE]
Similar calculations with differential forms will appear throughout this paper, where they are interpreted as holding for arbitrary variations of solutions.
Corollary \thecorollary.
Every Hamiltonian system is multisymplectic.
Proof.
From (2), we have
[TABLE]
which is exact and therefore closed. ∎
Corollary \thecorollary.
Every multisymplectic system is Hamiltonian.
Proof.
Since is simply connected, its first de Rham cohomology is trivial. Hence, the closed -form is exact, i.e., it equals for some Hamiltonian . More precisely, for each fixed , the -form equals for some function on , and these may be combined into a single Hamiltonian . ∎
Remark \theremark.
Section 2.2 depends entirely on the fact that has trivial first de Rham cohomology. However, it is possible to define canonical Hamiltonian systems on more general spaces—in particular, on the dual jet bundle of some fiber bundle over (cf. Gotay [17] and references therein). In this setting, the argument of Section 2.2 holds only if the fibers of this bundle have trivial first de Rham cohomology. However, a weaker statement—that every multisymplectic system is locally Hamiltonian—still holds, by Poincaré’s lemma. By contrast, Section 2.2 remains true even in this more general setting.
Example \theexample (semilinear elliptic PDE, continued).
Let us see how the multisymplectic conservation law manifests in the class of semilinear elliptic PDEs we encountered in Section 2.1. For the system
[TABLE]
we calculate
[TABLE]
The first term vanishes by the symmetry of and the antisymmetry of , while the remaining terms vanish since (again, the antisymmetry of ) and since does not depend on .
2.3. Integral form of the multisymplectic conservation law
Given an arbitrary subdomain , the divergence theorem implies that
[TABLE]
where is the standard Euclidean volume form on and , where is the interior product (or contraction). Therefore, an equivalent formulation of the multisymplectic conservation law (4) is that
[TABLE]
We call this the integral form of the multisymplectic conservation law. As with (4), this is interpreted as holding when is evaluated on arbitrary variations of a solution to (1).
Note that, by the definition of the product,
[TABLE]
so (5) may also be written as
[TABLE]
Hence, the multisymplectic conservation law may be interpreted as a symmetry condition on the Poincaré–Steklov operator mapping Dirichlet boundary conditions for to the corresponding boundary conditions for . See Agoshkov [3], where the symmetry of the Poincaré–Steklov operator is discussed in the context of domain decomposition methods for linear elliptic problems. Similarly, Belishev and Sharafutdinov [6] establish the symmetry of a Poincaré–Steklov operator for harmonic differential forms on a manifold with boundary.
Example \theexample (semilinear elliptic PDE, continued).
Let us revisit the class of semilinear elliptic PDEs we encountered in Section 2.1 and Section 2.2. Let be a solution, and consider the linearized problem
[TABLE]
Here, is evaluated at \bigl{(}x,u(x)\bigr{)} and hence is a function of alone. If and are two arbitrary solutions to this problem, then
[TABLE]
By a similar calculation, switching with ,
[TABLE]
However, since is symmetric, these integrals are identical, and we conclude
[TABLE]
That this equality holds for every and is precisely the statement (6) of the multisymplectic conservation law.
In the special case , we have and , so this can be written as
[TABLE]
where denotes the outer unit normal to . Hence, in this case, the multisymplectic conservation law expresses the symmetry of the Dirichlet–Neumann operator for the linearized problem.
2.4. Multisymplecticity and reciprocity
In many physical systems, the multisymplectic conservation law is closely tied to so-called reciprocity phenomena, such as Green’s reciprocity in electrostatics and Betti reciprocity in elasticity. (See, for example, Abraham and Marsden [1, Section 5.3], Marsden and Hughes [26, Section 5.6], and Lew et al. [25].) These reciprocity phenomena are also exploited, numerically, in formulations of the boundary element method (cf. Partridge et al. [36]). We now briefly discuss the relationship between multisymplecticity and reciprocity, using the language we have developed throughout this section.
Let be a solution to (1). The multisymplectic conservation law (4) is just the statement that
[TABLE]
where and are arbitrary variations of , i.e., solutions to the linearized problem (3). Integrating both sides over and applying the divergence theorem gives
[TABLE]
which is the statement of (5) and (6).
We now generalize the above to the case where the variations and each solve a perturbed version of the linearized problem.
Definition \thedefinition.
Given a solution to (1), we say that solves the linearized problem with incremental sources and if
[TABLE]
where and are given functions.
Let be a solution to the linearized problem with incremental sources and , and let be a solution to the linearized problem with incremental sources and . By the Leibniz rule,
[TABLE]
which we subtract and rearrange to obtain
[TABLE]
Assuming that (1) is multisymplectic, the and terms cancel when we substitute (7), leaving the equation
[TABLE]
Integrating over and applying the divergence theorem gives
[TABLE]
The equations (8) and (9) are the differential and integral forms, respectively, of the reciprocity law for a multisymplectic system of PDEs. They may be interpreted as describing a symmetric (or “reciprocal”) relationship between the perturbation of the system by incremental sources and the incremental response of the system to such perturbations. In the special case where the incremental sources vanish, we recover the multisymplectic conservation law.
Example \theexample (semilinear elliptic PDE, continued).
Let us once again examine the semilinear elliptic PDEs considered in Section 2.1, Section 2.2, and Section 2.3. The linearized problem with incremental sources is
[TABLE]
To see how reciprocity arises, we compute
[TABLE]
Subtracting, the terms involving and cancel by symmetry, yielding
[TABLE]
which is precisely the statement (8). Integrating this over gives
[TABLE]
which is the statement (9).
As an important special case, which arises in the primal (or Lagrangian) formulation of this system, suppose that and that , so that and solves the second-order equation
[TABLE]
If the corresponding properties hold for , then we can write the reciprocity law as
[TABLE]
whose integral form on is
[TABLE]
As a final specialization, let and , so that satisfies Poisson’s equation, , and and satisfy
[TABLE]
Then the reciprocity law, in differential form, is
[TABLE]
while the integral form on is
[TABLE]
These last two expressions are two of Green’s identities from vector calculus. If and are interpreted as scalar potentials for the electrostatic fields and , respectively, then this corresponds to Green’s reciprocity.
3. The flux formulation and multisymplecticity
3.1. Domain decomposition and the flux formulation
In this section, we introduce a weak formulation of the problem (1), called the flux formulation. This decomposes the problem on into a collection of local solvers for , coupled through the approximate boundary traces . This forms the foundation of the HDG framework of Cockburn et al. [13] and is closely related to the unified DG framework of Arnold et al. [4].
We mention that our presentation of the flux formulation, and of HDG methods, differs from that in Cockburn et al. [13] in a few ways. In particular, Cockburn et al. focus on linear elliptic problems, which allows them to make substantial use of the solution theory for such problems, including well-posedness of the local and global solvers. By contrast, we are interested in obtaining multisymplecticity criteria for the much more general class of systems (1), without assuming anything about the properties of solutions, even their existence and/or uniqueness.
In this section, the function spaces appearing in the flux formulation may be either infinite-dimensional Hilbert spaces or finite-dimensional subspaces (e.g., polynomials up to some degree). This will allow us to prove general multisymplecticity results that apply both to the original, infinite-dimensional problem (Section 3.4) and to finite-element approximation via HDG methods (Section 4).
To begin, observe that if is a smooth solution to (1) on , and if are arbitrary smooth test functions, then
[TABLE]
If is a partition of into non-overlapping domains , then breaking each of the integrals above into a sum over and integrating by parts,
[TABLE]
In a typical finite-element application, will be polyhedral, and will be a triangulation of into simplices .
Following Cockburn et al. [13] (as well as Arnold et al. [4]), we now relax the regularity and inter-element continuity assumptions on and in (10), and we replace the boundary traces of and on by approximate traces and . Specifically, let
[TABLE]
be specified local function spaces on each , and define discontinuous global spaces on by
[TABLE]
Next, specify a space of approximate traces of functions in ,
[TABLE]
where , along with the subspace
[TABLE]
of approximate traces vanishing on the domain boundary .
The final ingredient in the HDG framework is the numerical flux , which we define slightly differently to Cockburn et al. [13]. As mentioned in the introduction to this section, our treatment is equivalent to [13] for linear problems, but it extends more naturally to nonlinear problems, even without assuming existence and uniqueness of solutions. Let
[TABLE]
be some space of boundary fluxes on , and define the space of restricted traces \widehat{V}(\partial K)\coloneqq\bigl{\{}\widehat{v}\rvert_{\partial K}:\widehat{v}\in\widehat{V}\bigr{\}}.
Definition \thedefinition.
A local flux function on is a bounded linear map
[TABLE]
Denoting \widehat{\Sigma}\coloneqq\prod_{K\in\mathcal{T}_{h}}\widehat{\Sigma}(\partial K)\subset\prod_{K\in\mathcal{T}_{h}}\bigl{[}L^{2}(\partial K)\bigr{]}^{mn}, this extends naturally to a global flux function,
[TABLE]
Remark \theremark.
Elements of and \prod_{K\in\mathcal{T}_{h}}\bigl{[}L^{2}(\partial K)\bigr{]}^{mn} may be interpreted as functions that are double-valued on internal facets of and single-valued on boundary facets in .
We now seek solutions satisfying
[TABLE]
the latter of which states that the normal component of is single-valued (at least in a weak sense) on the internal facets of .
In the language of Cockburn et al. [13], we have “local solvers” (11a)–(11b) on each , and these are coupled globally through the numerical flux by the conservativity condition (11d). A notable distinction between our approach and that of Cockburn et al. [13] is that they assume is a given function of , , and on each , whereas we define it through the flux functions by adding (11c) to the flux formulation.
Definition \thedefinition.
The flux formulation of (1) on is given by (11), along with choices of the global function space and, for each , the local function spaces , , and the flux function . We call this a hybridizable discontinuous Galerkin (HDG) method whenever , , and (but not necssarily or ) are finite dimensional.
Remark \theremark.
Note that (11) does not impose any particular boundary conditions on or . Hence, (11) corresponds to the system of PDEs (1) rather than a particular boundary value problem associated to (1).
We remain agnostic about the choice of boundary conditions for two reasons. First, multisymplecticity is not a statement about a particular solution, but a statement about variations within a general family of solutions. If we pick out an isolated solution (e.g., by the imposition of boundary conditions), then the “family” of solutions becomes zero-dimensional, so any statement about variations is vacuous. Second, the class of PDEs (1) is quite general, including both elliptic and hyperbolic PDEs, among others, depending on and . In the hyperbolic case, when is a spacetime region, we are not free to impose Dirichlet conditions on all of .
3.2. Local multisymplecticity criteria
In the context of smooth solutions to (1), where and are smooth functions on , Section 2.2 states that multisymplecticity holds if and only if the smooth -form is closed for all . For the flux formulation (11), we wish to relax these smoothness assumptions and express the multisymplecticity condition in terms of function spaces, rather than in a pointwise sense at each .
Observe that (11a)–(11b) still makes sense even if we only have for and . Therefore, rather than assuming that and are smooth, let us assume only that
[TABLE]
for each , which may be extended naturally to
[TABLE]
These are generally nonlinear maps—and since multisymplecticity is a statement about first variations of solutions, let us assume also that these maps are at least . When is infinite-dimensional, we may interpret this as a variational derivative (either the Gâteaux or Fréchet derivative, which are equivalent for maps, cf. Abraham et al. [2, Corollary 2.10]); in the finite-dimensional case, this is just ordinary continuous differentiability. With and defined in this way, it follows that is a differential -form on , and we say that this -form is closed if its exterior derivative vanishes as a -form on .
Definition \thedefinition.
The flux formulation (11) is multisymplectic if solutions satisfy
[TABLE]
for all , whenever the differential -form is closed.
Remark \theremark.
The condition (12) is essentially the integral form of the multisymplectic conservation law from Section 2.3, where the approximate traces and are used instead of the actual traces of and . Note that (12) only needs to hold for , not for arbitrary subdomains as in (5).
We say that (12) is a local multisymplecticity condition because it is a statement only about the local solvers (11a)–(11b) and numerical flux condition (11c) for each . We reserve the global question—whether the multisymplectic conservation law holds for arbitrary unions of elements of —for the next section, where the conservativity condition (11d) will also come into play.
To characterize the multisymplecticity of the flux formulation, we first prove a useful lemma, which relates the boundary integral in (12) to the “jumps” and between the approximate and actual traces on .
Lemma \thelemma.
If is closed and satisfies (11a)–(11b) for , then
[TABLE]
Consequently, the local multisymplecticity condition (12) holds if and only if
[TABLE]
Proof.
Since (11a) and (11b) hold for all and , we have
[TABLE]
so taking exterior derivatives gives
[TABLE]
Subtracting the second equation from the first, the terms involving and vanish by the closedness assumption, so we are left with
[TABLE]
that is,
[TABLE]
Using this identity, we finally calculate
[TABLE]
which completes the proof. ∎
The equation (13) says that the multisymplecticity of the flux formulation depends entirely on the relationship among , , , and on for . That is, it depends entirely on the choice of local flux functions .
Definition \thedefinition.
A local flux function is multisymplectic if (13) holds whenever satisfies (11c).
We now prove multisymplecticity for two particular choices of . The first is used for the hybridized Raviart–Thomas (RT-H), Brezzi–Douglas–Marini (BDM-H), and local discontinuous Galerkin (LDG-H) methods; the second is used for the hybridized continuous Galerkin (CG-H) and nonconforming (NC-H) methods. These methods will be discussed further in Section 4.
Theorem 3.1**.**
Suppose that, for all and , there exists such that for all . Then, for any (which is called a “penalty function”), the local flux function
[TABLE]
is multisymplectic.
Proof.
The flux condition (11c) says that
[TABLE]
for all . By assumption, for any and , we can choose such that for all , and therefore
[TABLE]
Since and are arbitrary, this can be written as
[TABLE]
and taking the exterior derivative of both sides yields
[TABLE]
However, this vanishes by the symmetry of and the antisymmetry of , so the multisymplecticity condition (13) holds, as claimed. ∎
Remark \theremark.
More generally, we can replace above with penalty functions such that for , and the argument above still holds. This same generalization applies to the penalty-based HDG methods we will encounter in Section 4.
Theorem 3.2**.**
Suppose that, for all , there exists such that for . Then the local flux function
[TABLE]
is multisymplectic.
Proof.
The flux condition (11c) says that
[TABLE]
for all . From the assumption on normal traces of elements of , it follows that
[TABLE]
for any and . This can be written as
[TABLE]
and taking the exterior derivative yields (13). ∎
3.3. Global multisymplecticity criteria
Whenever (11) is multisymplectic, we may of course sum (12) over an arbitrary collection of elements to obtain the global statement
[TABLE]
or equivalently, by Section 3.2
[TABLE]
In the special case , for a second-order linear elliptic PDE, (15) is precisely Equation 2.10 from Cockburn et al. [13], which establishes the symmetry of the bilinear form used to solve for once internal degrees of freedom have been eliminated (i.e., the Schur complement). Hence, (15) can be seen as a generalization of this symmetry condition to nonlinear multisymplectic systems and arbitrary .
However, (14) is a rather weak global multisymplecticity condition, since it follows trivially from the local condition (12). We now define a stronger version of multisymplecticity, which is more analogous to the classical multisymplectic conservation law (5).
Definition \thedefinition.
The flux formulation (11) is strongly multisymplectic if solutions satisfy
[TABLE]
for all , whenever the differential -form is closed.
Taking immediately implies the local condition (12) for each , so the stronger condition (16) indeed implies the weaker condition (14). It follows that (16) holds if and only if the terms of (14) cancel on internal facets. The property that conservation laws “add up” correctly over unions of elements is directly related to the conservativity condition (11d); indeed, this is the reason the term “conservative” is used to describe numerical fluxes with single-valued normal components. (See Equation 3.2 in Arnold et al. [4].)
Let be an internal facet, where are distinct. Recall from Section 3.1 that an element is generally double-valued on , since the and components need not agree. As is common in the discontinuous Galerkin literature (including Arnold et al. [4], Cockburn et al. [13]), we define the “normal jump” \llbracket\widehat{\tau}\rrbracket\rvert_{e}\in\bigl{[}L^{2}(e)\bigr{]}^{n} by
[TABLE]
Here, denotes that is oriented according to , and we take the corresponding component of and outer normal for each term on the right-hand side. Denoting the set of internal facets of by , we may sum directly over to define \llbracket\widehat{\tau}\rrbracket\in\bigl{[}L^{2}(\mathcal{E}_{h}^{\circ})\bigr{]}^{n}. Hence, the normal component of is single-valued on internal facets if and only if .
With this notation, the conservativity condition (11d) can be rewritten as
[TABLE]
If the extension by zero of to is in , then applying the conservativity condition with immediately implies , and we say that is strongly conservative. However, this is not always the case: for example, if contains discontinuous traces but contains only continuous traces, then in general , so we cannot conclude that vanishes. In this case, we say that is only weakly conservative. (This terminology is taken from Cockburn et al. [13].)
Theorem 3.3**.**
If satisfies the strong conservativity condition , then for any and ,
[TABLE]
Consequently, if (11) is multisymplectic and strongly conservative, then it is strongly multisymplectic.
Proof.
Let be an internal facet, where . Since , we have
[TABLE]
Finally, taking the exterior derivative implies that
[TABLE]
so the contributions from internal facets vanish, as claimed. ∎
3.4. The flux formulation for exact solutions
We now apply the theory of the preceding sections to exact solutions of (1), in the sense of distributions, in which case the flux formulation (11) consists of infinite-dimensional function spaces.
Definition \thedefinition.
The exact flux formulation on is the flux formulation (11) associated to the function spaces
[TABLE]
along with the flux functions , for .
The next theorem uses a domain-decomposition-type argument to relate the exact flux formulation to solutions of (1), in the sense of distributions, defined over certain global function spaces on .
Theorem 3.4**.**
The element is a solution to the exact flux formulation if and only if
[TABLE]
is a solution to (1) on , in the sense of distributions, and are the exact traces and for all .
Proof.
Suppose is a solution to the exact flux formulation.
In particular, (11a) holds for all \tau\in\bigl{[}C_{c}^{\infty}(K)\bigr{]}^{mn}, which immediately gives on , in the sense of distributions. Taking more general test functions \tau\in\bigl{[}C^{\infty}(K)\bigr{]}^{mn}, not necessarily vanishing on , implies that in the trace sense. Since this holds for all , it follows that . Hence, the trace of is single-valued on , and we may therefore conclude (cf. Brezzi and Fortin [7, Proposition III.1.1]) that u\in\bigl{[}H^{1}(U)\bigr{]}^{n}.
Similarly, taking smooth test functions in (11b) implies that holds in the sense of distributions, and holds in the trace sense, for all . The flux equation (11c) implies further that , and the conservativity condition (11d) gives on . Hence, the normal trace of is single-valued on , and we may therefore conclude (cf. Brezzi and Fortin [7, Proposition III.1.2]) that \sigma\in\bigl{[}H(\operatorname{div};U)\bigr{]}^{n}.
The converse is a simple verification of (11). If u\in V\cap\bigl{[}H^{1}(U)\bigr{]}^{n}, then it has a (single-valued) trace \widehat{u}\in\bigl{[}L^{2}(\mathcal{E}_{h})\bigr{]}^{n}=\widehat{V}. Likewise, if \sigma\in\Sigma\cap\bigl{[}H(\operatorname{div};U)\bigr{]}^{n}, then it has a trace \widehat{\sigma}\rvert_{\partial K}\in\bigl{[}L^{2}(\partial K)\bigr{]}^{mn}=\widehat{\Sigma}(\partial K) for each ; this satisfies on , so (11c)–(11d) hold. Finally, equations (11a)–(11b) hold by the assumption that satisfies (1) in the sense of distributions. ∎
Corollary \thecorollary.
The exact flux formulation satisfies
[TABLE]
for all , whenever is closed.
Proof.
It follows immediately from Theorem 3.1 (with ) and Theorem 3.3 that the exact flux formulation is strongly multisymplectic, so it satisfies (16). Moreover, Theorem 3.4 gives and for all , so we may “remove the hats” from (16). ∎
4. Multisymplecticity of particular HDG methods
We now apply the results of Section 3 to the particular HDG methods discussed in Cockburn et al. [13]. Although the flux formulation (11) is more general than that for the class of second-order linear elliptic PDEs they consider, the spaces and fluxes used to define the methods are essentially unchanged.
Throughout this section, we assume that is polyhedral and that is a triangulation of by -simplices. We denote by the space of degree- polynomials on and by the space of degree- polynomials on . We also define spaces of discontinuous polynomial boundary traces,
[TABLE]
and continuous polynomial boundary traces,
[TABLE]
which in Cockburn et al. [13] are called and , respectively.
4.1. The RT-H method
The hybridized Raviart–Thomas (RT-H) method uses the local function spaces
[TABLE]
i.e., degree- Lagrange finite elements and Raviart–Thomas finite elements, respectively, for each . The trace spaces are taken to be
[TABLE]
and the local flux functions are
[TABLE]
Note that, although is infinite-dimensional, the flux condition (11c) simply states that , so we may eliminate this equation and substitute wherever appears in the remaining equations.
Theorem 4.1**.**
The RT-H method is strongly multisymplectic.
Proof.
Observe that is a special case of the flux in Theorem 3.1, with . Since \widehat{\Sigma}(\partial K)=\bigl{[}L^{2}(\partial K)\bigr{]}^{mn}, it follows that for any and , we have . Hence, the hypotheses of Theorem 3.1 are satisfied, so the method is multisymplectic.
To show strong multisymplecticity, let be an arbitrary internal facet, and write . Since , a standard result on Raviart–Thomas elements (cf. Brezzi and Fortin [7, Proposition III.3.2]) implies that for .111This result holds since lies in an affine hyperplane in , so is constant on . It follows that the degree- elements of the Raviart–Thomas space nevertheless have degree- normal traces. The flux condition (11c) implies , so it follows from the above that \llbracket\widehat{\sigma}\rrbracket\rvert_{e}\in\bigl{[}\mathcal{P}_{r}(e)\bigr{]}^{n}. Since this holds for all , the extension by zero of to is in . Therefore, the RT-H method is strongly conservative, so Theorem 3.3 implies that it is strongly multisymplectic. ∎
Remark \theremark.
To prove multisymplecticity, instead of using Theorem 3.1, we could simply have used to see that (13) holds. However, the argument we have developed here is more general, and we will see in Section 4.3 that it also applies to methods where .
4.2. The BDM-H method
The hybridized Brezzi–Douglas–Marini (BDM-H) method uses the local function spaces
[TABLE]
i.e., degree- Lagrange finite elements and degree- Brezzi–Douglas–Marini finite elements, respectively, for each . As in the RT-H method, the trace spaces are taken to be
[TABLE]
and the local flux functions are
[TABLE]
As with RT-H, the flux condition (11c) states that , so we may eliminate (11c) and substitute for in the remaining equations.
Theorem 4.2**.**
The BDM-H method is strongly multisymplectic.
Proof.
Since the trace spaces and flux function are the same as the RT-H method, multisymplecticity follows exactly as in Theorem 4.1.
Given any internal facet , we have \sigma\rvert_{K^{\pm}}\in\bigl{[}\mathcal{P}_{r}(K^{\pm})\bigr{]}^{mn}, so \widehat{\sigma}\rvert_{e^{\pm}}=\sigma\rvert_{e^{\pm}}\in\bigl{[}\mathcal{P}_{r}(e)\bigr{]}^{mn} and therefore \llbracket\widehat{\sigma}\rrbracket\rvert_{e}\in\bigl{[}\mathcal{P}_{r}(e)\bigr{]}^{n}. Since this holds for all , the extension by zero of to is in . Therefore, the BDM-H method is strongly conservative, so Theorem 3.3 implies that it is strongly multisymplectic. ∎
4.3. The LDG-H methods
There are three variants of the hybridized local discontinuous Galerkin method (LDG-H) discussed in Cockburn et al. [13], corresponding to different choices of the local function spaces. In the setting and notation considered here, these three pairs of spaces are:
[TABLE]
Whichever of these we choose, the trace spaces are
[TABLE]
and the local flux functions are
[TABLE]
where the penalty function is piecewise constant on , i.e., constant on each facet. Note that since may be different for each , on an internal facet , the constants need not be equal to one another. The flux condition (11c) states that
[TABLE]
so we may eliminate (11c) and substitute the expression on the right-hand side wherever appears in the remaining equations.
Theorem 4.3**.**
The LDG-H method is strongly multisymplectic for each of the choices (17a)–(17c) of local function spaces.
Proof.
The flux is precisely that of Theorem 3.1. As shown in the proof of Theorem 4.1, the space \widehat{\Sigma}(\partial K)=\bigl{[}L^{2}(\partial K)\bigr{]}^{mn} satisfies the hypotheses of Theorem 3.1, so the LDG-H method is multisymplectic.
Now, for each of (17a)–(17c), we have
[TABLE]
For any internal facet , since are constants, it follows that
[TABLE]
so \llbracket\widehat{\sigma}\rrbracket\rvert_{e}\in\bigl{[}\mathcal{P}_{r}(e)\bigr{]}^{n}. (Note that if were arbitrary penalty functions, rather than constants, this would not necessarily be true; in fact, might not be polynomials at all.) Since this holds for all , the extension by zero of to is in . Therefore, the LDG-H method is strongly conservative, so Theorem 3.3 implies that it is strongly multisymplectic. ∎
4.4. The CG-H method
The hybridized continuous Galerkin (CG-H) method uses the local function spaces
[TABLE]
i.e., degree- Lagrange finite elements for and degree- Lagrange finite elements for , for and . The trace spaces are taken to be
[TABLE]
and the local flux functions are
[TABLE]
Since , we immediately have . Moreover, since consists of continuous polynomials, the degrees of freedom for are a subset of those for , so as well. Hence, taking the flux condition (11c) with implies for all .
Remark \theremark.
The CG-H method is so named because it coincides with the classical continuous Galerkin method with Lagrange finite elements when applied to second-order linear elliptic PDEs of the type considered in Section 2.1, Section 2.2, and Section 2.3, as long as is constant on each . See Cockburn et al. [14, 13], Cockburn [12], where the relationship between CG-H and the technique of “static condensation” is also discussed.
More generally, this correspondence also holds for the semilinear system
[TABLE]
Indeed, since (11c) implies , substituting for in (11a) implies , as long as is constant on each . (Otherwise, is generally not in .) It follows that , so for all test functions in this same space vanishing on , summing (11b) over gives
[TABLE]
The boundary term vanishes by (11d), since the assumption that is continuous and vanishes on implies . Hence, is a solution to the continuous Galerkin method for .
We now prove that the CG-H method is multisymplectic, although—unlike the other HDG methods considered here—it is not strongly multisymplectic except in dimension , when multisymplecticity is just ordinary symplecticity.
Theorem 4.4**.**
The CG-H method is multisymplectic. It is strongly multisymplectic (i.e., symplectic) when .
Proof.
Since , we see directly that (13) holds, so multisymplecticity follows by Section 3.2.
When , facets are simply vertices, so is discrete and finite, and the continuity conditions on are trivial. Hence, \bigl{[}\mathcal{P}_{r}^{c}(\mathcal{E}_{h})\bigr{]}^{n}=\bigl{[}\mathcal{P}_{r}(\mathcal{E}_{h})\bigr{]}^{n}=\mathbb{R}^{\lvert\mathcal{E}_{h}\rvert n}. The result follows immediately from the trivial observation that at each internal vertex . ∎
Remark \theremark.
Although is the same flux function as in Theorem 3.2, the hypotheses of that theorem do not hold for the CG-H method. Here, consists only of whose normal traces are continuous on , while this is not necessarily true of for arbitrary .
Example \theexample (CG-H for Laplace’s equation in ).
Let , , and consider the mixed form of Laplace’s equation,
[TABLE]
Let us apply the lowest-order CG-H method, with , so that for each , we have and \Sigma(K)=\bigl{[}\mathcal{P}_{0}(K)\bigr{]}^{2}.
As discussed in Section 4.4, we have and . Therefore, is determined by (11b), which in this case states
[TABLE]
Since for some , we may rewrite this as
[TABLE]
However, is generally not equal to , since the latter is piecewise constant (and generally discontinuous) on , whereas the former must be continuous and linear. Instead, we must set up a linear system and solve for in terms of .
For simplicity, let us suppose that is isometric to the standard, equilateral reference triangle in , defined by
[TABLE]
On , the Lagrange basis of linear “hat functions” simply consists of the coordinate functions , , and , and we can write
[TABLE]
Solving the linear system corresponding to (18) yields, after a calculation,
[TABLE]
The multisymplectic form restricted to is therefore , so the multisymplectic conservation law states that .
Let denote the edge in going from the th standard basis vector to the th standard basis vector in . Using the above expressions for in terms of , another calculation shows that
[TABLE]
from which it is immediately apparent that
[TABLE]
so the method is indeed multisymplectic on , following Theorem 4.4.
We now show that strong multisymplecticity does not hold for the CG-H method when , so the result of Theorem 4.4 is the best we can hope for. The proof uses a counterexample based on Section 4.4.
Proposition \theproposition.
The CG-H method is not strongly multisymplectic.
Proof.
Consider the mixed form of Laplace’s equation on the domain triangulated by two equilateral triangles, as shown in Figure 1. For simplicity, as in Section 4.4, we suppose that each of these is isometric to the standard reference triangle , so that the edge lengths are all . Note that , since the degrees of freedom for all lie on , so the conservativity condition (11d) is trivial. Hence, there are no constraints on other than the local conditions (11a)–(11c) on each triangle, as discussed in Section 4.4.
From the calculation in (19), we have
[TABLE]
and similarly,
[TABLE]
so adding these gives
[TABLE]
We conclude that this is nonzero since are independent degrees of freedom that may be varied independently. In particular, if we take variations and with
[TABLE]
we have
[TABLE]
Hence, the CG-H method is not strongly multisymplectic. ∎
Remark \theremark.
The failure of strong multisymplecticity, in this example, may also be seen via the failure of the bilinear form to be symmetric. Indeed, if we write and , then we may represent this as the quadratic form,
[TABLE]
which is immediately seen not to be symmetric. Neglecting the scalar factor of , the antisymmetrization of this matrix is
[TABLE]
This is precisely the matrix corresponding to
[TABLE]
which agrees with (20).
Remark \theremark.
Cockburn et al. [13] observe that CG-H can be seen as a limiting case of the LDG-H method (17c) where the penalty . They also consider more general LDG-H methods where is infinite on some elements and finite on others [13, Section 3.4]. However, allowing the penalty to be infinite imposes continuity conditions on , meaning that conservativity (and thus multisymplecticity) is only weak rather than strong.
4.5. The NC-H method
The hybridized nonconforming (NC-H) method uses the local function spaces
[TABLE]
just as in the CG-H method. The trace spaces are
[TABLE]
and the local flux functions are
[TABLE]
Unlike CG-H, is generally not in , so we cannot conclude that equals on , except in the weak sense of (11c).
Theorem 4.5**.**
The NC-H method is strongly multisymplectic.
Proof.
The flux is that considered in Theorem 3.2, so it suffices to show that the hypothesis of that theorem holds, i.e.: for all , there exists such that for . Given , this condition is satisfied by , i.e., the projection of onto the unit normal, so the NC-H method is multisymplectic.
Next, if is an interior facet, then the definition of implies that \widehat{\sigma}\rvert_{e^{\pm}}\in\bigl{[}\mathcal{P}_{r-1}(e)\bigr{]}^{n}, so \llbracket\widehat{\sigma}\rrbracket\rvert_{e}\in\bigl{[}\mathcal{P}_{r-1}(e)\bigr{]}^{n}. Since this holds for all , the extension by zero of to is in . Therefore, the NC-H method is strongly conservative, so Theorem 3.3 implies that it is strongly multisymplectic. ∎
4.6. The IP-H methods
We finally consider the special case of the hybridized interior penalty method (IP-H), which—unlike the methods considered above—is somewhat idiosyncratic to semilinear elliptic systems. Consider a system of the form
[TABLE]
which generalizes the scalar () semilinear PDEs discussed in Section 2 to . Here, is a symmetric, positive-definite matrix with inverse a^{ij}_{\mu\nu}(x)\coloneqq\bigl{(}a_{ij}^{\mu\nu}(x)\bigr{)}^{-1}. These are the de Donder–Weyl equations for the Hamiltonian
[TABLE]
so in particular (21) is a canonical multisymplectic system of PDEs.
For such a system, the IP-H method uses the local function spaces
[TABLE]
For both methods, the trace spaces are taken to be
[TABLE]
Based on the observation that the classical solution satisfies , these methods take the local flux functions to be
[TABLE]
Thus, the IP-H and “IP-H-like” methods are essentially the LDG-H methods (17b) and (17c), respectively, except with replaced by in the local flux functions. As with LDG-H methods, the penalty function is taken to be piecewise constant on for each , and on internal facets , the constants need not be equal to one another. The flux condition (11c) states that
[TABLE]
so we may eliminate (11c) and substitute the expression on the right-hand side wherever appears in the remaining equations. We also assume, following Cockburn et al. [13], that is constant on each .
Theorem 4.6**.**
For the semilinear system (21) where is constant on each , the IP-H and “IP-H-like” methods are strongly multisymplectic.
Proof.
To prove that the methods are multisymplectic, Section 3.2 states that it suffices to show that (13) is satisfied on each . Observe that
[TABLE]
We have previously seen that
[TABLE]
by the symmetry of and the antisymmetry of . Therefore, it remains to show that the terms involving vanish as well. Integrating (11a) by parts gives
[TABLE]
and since this holds for all , we can write
[TABLE]
Taking the exterior derivative of both sides yields
[TABLE]
where by the symmetry of and the antisymmetry of . On the other hand, taking for , we have
[TABLE]
and since this holds for all , we can write
[TABLE]
Note that we need to be constant on in order for \tau=a\operatorname{grad}v\in\bigl{[}\mathcal{P}_{r-1}(K)\bigr{]}^{mn}\subset\Sigma(K) to be an admissible test function for both methods (22a)–(22b). Taking the exterior derivative of both sides yields
[TABLE]
where again we have used the symmetry of and the antisymmetry of . Rearranging this last equality yields
[TABLE]
which is precisely (13). Hence, the IP-H method is multisymplectic.
To show strong multisymplecticity, let be an internal facet. Then
[TABLE]
so \llbracket\widehat{\sigma}\rrbracket\rvert_{e}\in\bigl{[}\mathcal{P}_{r}(e)\bigr{]}^{n}. (Here, we use that and are constant.) Hence, may be extended by zero to an element of , so both methods are strongly conservative and thus, by Theorem 3.3, strongly multisymplectic. ∎
5. Conclusion
We have generalized the flux formulation and HDG framework of Cockburn et al. [13] to the much larger family of canonical systems of PDEs (1), which includes nonlinear systems. Within this framework, we have established the multisymplecticity of several HDG methods, when such methods are applied to canonical Hamiltonian systems (2). These methods include “hybridized” versions of several widely-used classes of finite element methods, suggesting that—when multisymplectic structure preservation is desired—these general purpose methods may be used instead of the specialized methods constructed in previous work, which are often limited in their order of accuracy and/or use on unstructured meshes.
It is perhaps not surprising that so many finite element methods are multisymplectic. Indeed, like the Ritz–Galerkin method, the multisymplectic conservation law is intimately related to variational principles (cf. Lawruk et al. [24], Kijowski and Tulczyjew [23], Marsden et al. [27], Gotay et al. [19, 18], Vankerschaver et al. [42]). However, any construction of multisymplectic finite element methods must address two difficulties: first, that the multisymplectic conservation law holds for smooth solutions, while finite element spaces are nonsmooth; and second, that finite element basis functions can have support on several elements, posing an obstacle to expressing a localized, per-element conservation law. The flux formulation of Section 3 provides a solution to both of these difficulties. Hybridization (i.e., introducing separate spaces of boundary traces and fluxes) provides a way to express the multisymplectic conservation law on individual elements, while the exact flux formulation of Section 3.4 provides a bridge between the smooth and non-smooth cases (particularly Theorem 3.4 and Section 3.4).
There are two final points we wish to emphasize about these results, by comparison to the previous work discussed in Section 1.
- (1)
Multisymplectic HDG methods may be applied to systems of the form (1), whether or not the user is aware of any canonical multisymplectic/Hamiltonian structure. Yet, if such a structure is present, it will automatically be preserved. This is analogous to the case for certain classes of symplectic integrators for ODEs (e.g., symplectic partitioned Runge–Kutta methods), but contrasts with previously-studied multisymplectic methods for PDEs on unstructured meshes (e.g., Lagrangian variational methods). 2. (2)
Many of the previously-constructed multisymplectic methods merely satisfy a “discrete version” of the multisymplectic conservation law, e.g., a finite-difference version of (4) on a lattice. This is true even for the previous work on multisymplectic finite element methods [21, 44, 11], which are only “multisymplectic” in a finite-difference sense on the lattice of degrees of freedom. Moreover, this discrete multisymplectic conservation law may differ from method to method, depending on how the divergence operator is discretized.
By contrast, the multisymplectic conservation law (12) satisfied by these HDG methods is exactly the integral multisymplectic conservation law (5), restricted to the numerical traces and fluxes on for each element , while (16) extends this to arbitrary unions of elements. Furthermore, this multisymplectic conservation law does not differ from method to method: it has precisely the same form for weak solutions, in the exact flux formulation of Section 3.4, as it does for each of the HDG methods of Section 4.
One direction for future work is the application of multisymplectic HDG methods to Hamiltonian time-evolution PDEs. There are two natural ways in which such work might proceed. First, a multisymplectic HDG method might be used to semidiscretize the PDE in space, resulting in a finite-dimensional system of ODEs. Sánchez et al. [41] have recently shown that, when an LDG-H method is used to semidiscretize the acoustic wave equation, the resulting system of ODEs is Hamiltonian, and one may then apply a symplectic integrator in time. Second, one might consider the application of spacetime HDG methods, as in Rhebergen and Cockburn [39, 40], Griesmaier and Monk [20]. In this approach, one would simultaneously discretize space and time by applying the flux formulation of Section 3 to the case where is a spacetime domain and a decomposition into spacetime elements . The results of Section 3 are formulated in sufficient generality to include such methods, so one might apply them to investigate the multisymplecticity of specific spacetime HDG methods.
Acknowledgments
This research was supported in part by the Marsden Fund of the Royal Society of New Zealand and by the Simons Foundation (award #279968 to Ari Stern). We also wish to thank the anonymous referees for their helpful comments and suggestions.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1Abraham and Marsden [1978] R. Abraham and J. E. Marsden , Foundations of mechanics , Benjamin/Cummings Publishing Co. Inc. Advanced Book Program, Reading, Mass., 1978. Second edition, revised and enlarged, With the assistance of Tudor Raţiu and Richard Cushman.
- 2Abraham et al. [1988] R. Abraham, J. E. Marsden, and T. Ratiu , Manifolds, tensor analysis, and applications , vol. 75 of Applied Mathematical Sciences, Springer-Verlag, New York, second ed., 1988.
- 3Agoshkov [1988] V. I. Agoshkov , Poincaré-Steklov’s operators and domain decomposition methods in finite-dimensional spaces , in First International Symposium on Domain Decomposition Methods for Partial Differential Equations (Paris, 1987), SIAM, Philadelphia, PA, 1988, pp. 73–112.
- 4Arnold et al. [2001/02] D. N. Arnold, F. Brezzi, B. Cockburn, and L. D. Marini , Unified analysis of discontinuous Galerkin methods for elliptic problems , SIAM J. Numer. Anal., 39 (2001/02), pp. 1749–1779.
- 5Ascher and Mc Lachlan [2004] U. M. Ascher and R. I. Mc Lachlan , Multisymplectic box schemes and the korteweg–de vries equation , Applied Numerical Mathematics, 48 (2004), pp. 255–269.
- 6Belishev and Sharafutdinov [2008] M. Belishev and V. Sharafutdinov , Dirichlet to Neumann operator on differential forms , Bull. Sci. Math., 132 (2008), pp. 128–145.
- 7Brezzi and Fortin [1991] F. Brezzi and M. Fortin , Mixed and hybrid finite element methods , vol. 15 of Springer Series in Computational Mathematics, Springer-Verlag, New York, 1991.
- 8Bridges [1996] T. J. Bridges , Symplecticity, reversibility and elliptic operators , in Nonlinear dynamical systems and chaos (Groningen, 1995), vol. 19 of Progr. Nonlinear Differential Equations Appl., Birkhäuser, Basel, 1996, pp. 1–20.
