Abstract
A general framework for the numerical approximation of evolution problems is presented that allows to preserve an underlying dissipative Hamiltonian or gradient structure exactly. The approach relies on rewriting the evolution problem in a particular form that complies with the underlying geometric structure. The Galerkin approximation of a corresponding variational formulation in space then automatically preserves this structure which allows to deduce important properties for appropriate discretization schemes including projection based model order reduction. We further show that the underlying structure is preserved also under time discretization by a Petrov–Galerkin approach. The presented framework is rather general and allows the numerical approximation of a wide range of applications, including nonlinear partial differential equations and port-Hamiltonian systems. Some examples will be discussed for illustration of our theoretical results, and connections to other discretization approaches will be highlighted.
1 Introduction
The modeling of dynamical systems often leads to problems with a generalized Hamiltonian or gradient structure and various examples have been studied intensively in the literature. In this paper, we consider abstract evolution problems of the form
which include Hamiltonian and gradient systems as special cases.
Here
Equation (1.1) is rather general and may represent finite- or infinite-dimensional systems, including ordinary and partial differential equations and differential-algebraic problems.
Questions of existence and uniqueness of solutions can hardly be addressed on this general level.
However, properties of sufficiently regular solutions can be derived, if they exist.
Any classical solution
for all
which holds for all
of the problem with
We briefly mention two important particular cases of problem (1.1) that will be covered automatically by our considerations.
If
Energy identities (1.2) and (1.3) play a fundamental role in the analysis of evolution problem (1.1), and they encode important physical principles. Therefore, much research has been devoted to the construction and analysis of numerical methods that still satisfy similar identities even after discretization. In [19], the discrete derivative methods, also often called discrete gradient methods, were introduced, which, applied to (1.1), lead to time-stepping schemes of the form
Particular approximations
In a recent paper [13], we studied the systematic approximation of dissipative nonlinear dynamical systems of another canonical form, namely
by means of Galerkin approximation in space and discontinuous Galerkin discretization in time.
In this system, the operator
As a first step of our analysis, we will show that the particular structure of the problem is preserved exactly by Galerkin projection of the corresponding variational formulation (1.4) in space. Such discretization strategies are frequently used for the semi-discretization of evolutionary partial differential equations, see e.g. [16, 30], and also for model order reduction of dynamical systems [4, 7]. Let us mention [1, 5, 6, 11, 28] as particular examples addressing the structure-preserving model reduction of dissipative Hamiltonian systems. Note that the structure preservation under Galerkin projection in space does in general not hold for other, seemingly equivalent formulations of the evolution problem, like
which are often considered in the literature; see [10, 19, 20, 26] for instance.
In a finite-dimensional setting, the gradient
which, apart from the identification of
As a second step of our analysis, we will show that the energy identities in the integral form (1.3) remain valid after time-discretization of (1.1) or its variational form (1.4) by certain Petrov–Galerkin methods. This is again strongly linked to the particular structure of the evolution problem under investigation, which should therefore be taken into account already in the modeling stage. We will demonstrate by examples that this can be achieved without difficulties for typical problems of rather different origin. We will also discuss in detail the connection of our approach to the discrete derivative and the average vector field collocation methods mentioned earlier, which can in fact be viewed as special instances or inexact realizations of the methods proposed in this paper. Our considerations may therefore provide further insight also into the analysis and generalization of these methods and the construction of new schemes.
The remainder of the manuscript is organized as follows. In Section 2, we discuss the space discretization of problem (1.1) by Galerkin approximation of the corresponding variational form (1.4). In addition, we discuss inexact variants of the resulting methods, which may be more convenient for a practical realization. In Section 3, we then study the time discretization by a Petrov–Galerkin approach, and we highlight the connection to other methods that have been discussed in the literature. Again, some level of inexactness is allowed in the realization which may facilitate the actual numerical implementation. The wide applicability of our methods will be demonstrated in Section 4, where we discuss some typical test problems in finite and infinite dimensions. Corresponding numerical results are presented in Section 5 for illustration of our theoretical results.
2 Space Discretization
Let
This equation is assumed to hold for all
Theorem 1.
Let
holds for all
for all
Proof.
The first identity follows by formal differentiation of
After semi-discretization in space, equation (2.1) amounts to a finite-dimensional system of ordinary or differential-algebraic equations.
Sufficient conditions on
Remark 1.
Let us emphasize that the structure preservation under Galerkin projection is a direct consequence of the particular canonical form of the evolution problem under consideration. This would not be the case if the discretization was based on a different formulation; compare with (1.5) and the corresponding remarks in the introduction.
Remark 2.
A similar result can be obtained if certain approximations for the individual terms in the discrete variational problem (2.1) are used. As an example, we may consider an inexact Galerkin approximation of the form
Energy identities similar to (2.2) or (1.3) then hold with
3 Time Discretization
We now turn to the time discretization. Since the variational form (1.4) of the problem is inherited by Galerkin approximation in space, see the previous section, the following arguments also cover problems that have already been semi-discretized in space.
Let
satisfying
for all
Remark 3.
It suffices to consider scalar-valued test functions
which now has to be understood as an equation in
With arguments similar to the previous sections, we now obtain the following result.
Theorem 2.
Let
for all time instances
Proof.
From the fundamental theorem of calculus, we can deduce
By choice of the trial and test spaces, the time derivative
This proves the result for
Remark 4.
Similar to the corresponding result for the semi-discretization in space, the proof and validity of the discrete energy identity above strongly relies on the particular structure of problem (1.1) and its variational formulation (1.4). Further, note that the energy identity here only holds at specific points in time and, in general, we do not have a pointwise energy identity like (1.2) or (2.2) for the time discrete approximation.
Let us next comment on the connection to other approximation schemes that have been proposed for the time discretization of Hamiltonian and gradient systems.
Remark 5.
Consider the case
with averages
here we used
Remark 6.
If
and the anti-symmetry of the operator
with intermediate time points
4 Examples
We now illustrate the viability of the proposed discretization strategies in space and time by discussing their application for some typical problems we have in mind.
4.1 Magneto-Quasistatics
As a first test problem, we consider the equations of magneto-quasistatics, which arise in the eddy current approximation of Maxwell’s equations at low frequency [3].
The magnetic flux density
Here σ denotes the electric conductivity, ν is the incremental magnetic reluctivity tensor, and
For ease of presentation, we further assume that σ is bounded and uniformly positive.
Then
which is supposed to hold for all t of relevance and for all functions
for
which expresses the fact that the magnetic energy of the system is only altered by the power supplied through excitation currents and the dissipation caused by eddy currents.
By setting
We then consider the Galerkin approximation in space using an appropriate finite element space
and the time discretization of this system by a Petrov–Galerkin approximation, as proposed in Section 3, leads to a fully discrete scheme which satisfies a corresponding energy identity in integral form (1.3) at discrete points
Remark 7.
Before closing this section, let us briefly comment on some obvious generalizations.
Without any complications, one can consider other types of boundary conditions and a field dependent conductivity
4.2 Cahn–Hilliard Equation
A simple mathematical model for the phase separation in binary fluids is given by the Cahn–Hilliard equation; see e.g. [15]. After elimination of the chemical potential, the simplest form of the problem can be phrased as
Here u represents the difference of the phase fractions of the two components, ψ is a double well potential with two minima, and
which implies that
For any sufficiently regular f with zero average, this equation has a unique weak solution
which will be the basis for further considerations. The weak form of this problem reads
which is assumed to hold for any sufficiently regular test function v and for any time t under consideration.
Here
We next recall that, besides the conservation of mass, the solutions of the Cahn–Hilliard problem also are governed by decay of the free energy
In the second step, we used the weak form of the problem with test function
Let us note that a standard Galerkin approximation of the weak form of the Cahn–Hilliard system leads to an approximation
While theoretically sound, such a method is not very useful in practice since the application of the inverse Laplacian
Again, a zero average condition for the right-hand side f and the solution
which is again required to hold for all
which shows that the energy of semi-discrete solutions again decreases until a steady state is reached. This approach corresponds to an inexact Galerkin approximation in space, as discussed in Remark 2. Further approximations, e.g., numerical quadrature for the nonlinear terms, may be used to facilitate the numerical implementation; see Section 5.
For the subsequent time discretization, we can employ a Petrov–Galerkin approximation as outlined in Section 3. Since the dissipation term here is linear and the force term vanishes, this coincides with a particular average vector field collocation method based on Gauss quadrature; see [21], and refer to Remark 6 for discussion in this direction.
4.3 Constrained Hamiltonian Systems
As another relevant class of applications, we consider finite-dimensional Hamiltonian systems with holonomic constraints given by
Such systems arise, for instance, in the modeling of multibody dynamics: see, e.g., [14, Chapter 1], [25, Chapter 7] or [29, Chapter 13].
Here p and q are, respectively, the vectors of generalized coordinates and momenta,
By differentiating (4.3) with respect to time, we obtain the linearized constraint
which is equivalent to the nonlinear constraint (4.3) up to a constant factor that can be fixed by an appropriate initial condition.
We further introduce the principal function of the Lagrange multiplier
These identities are assumed to hold for all test vectors v, w, η of appropriate size, and any time
In the last step, we used that
After rearrangement of terms, one can see that system (4.1), (4.2) with linearized constraint (4.4) is again of the abstract form
Hence all results about the approximation by Galerkin methods in space and the Petrov–Galerkin method in time obtained in Sections 2 and 3 apply immediately.
In particular, the Galerkin projection of (4.5)–(4.7) into a conforming subspace
Remark 8.
In the Petrov–Galerkin scheme (3.1), we may use test functions of the form
The original constraint (4.3) thus remains valid for all time points
5 Numerical Tests
For illustration of our theoretical results and in order to demonstrate the practicability of the proposed methods, we now briefly discuss their application and numerical realization for the test problems mentioned in the previous section.
5.1 Magneto-Quasistatics
We consider a geometry
We assume that
As magnetic reluctivity function for our tests, we take
with I, ω prescribed, and
In the middle of Figure 1, we show the potential
with symbols
are the average supply and loss power at time step k. For a better evaluation, we list in Table 1 the maximal discrepancy in the above energy identity obtained with the proposed Petrov–Galerkin time discretization and the Crank–Nicolson scheme.
τ | Lobatto (
|
PG (
|
Lobatto (
|
PG (
|
0.1 |
|
|
|
|
0.05 |
|
|
|
|
0.01 |
|
|
|
|
As predicted, the Petrov–Galerkin method preserves the energy identity on the discrete level up to roundoff errors which may accumulate with the number of time steps. In contrast to that, the Crank–Nicolson scheme is not able to exactly reproduce the underlying energy-dissipation structure on the discrete level.
5.2 Cahn–Hilliard Equation
As a second test problem, we consider the Cahn–Hilliard equation with a logarithmic potential
and Neumann boundary conditions; see Section 4.2.
For our computations, we use
Here we used
for abbreviation.
Note that this average vector field approximation automatically results from the Petrov–Galerkin time integration of lowest order.
In the terms characterized by
For our computations, we utilize a uniform triangulation with mesh size
In Figure 2, we display some snapshots of the numerical solution, and we depict the evolution of the discrete free energy, which is defined by
Here
5.3 Constrained Hamiltonian Dynamics
As a simple example for a constrained dynamical system, we consider a pendulum with a mass
which comprises a differential-algebraic system of index 3; see [22, 24] for details.
This example fits into the class of problems considered in Section 4.3 with
In the derivation, the algebraic constraint was differentiated once, and the Lagrange multiplier was integrated.
The resulting system turns out to be an equivalent index-1 reformulation of the original problem.
In compact notation, the above system can be written as
For the time-discretization, we use a Petrov–Galerkin method as outlined in Section 4.3.
Since
with
For our numerical tests, we chose the initial conditions as
In Figure 3, we display some snapshots of the numerical solution and the evolution of the energy and the position as well as length over time. As predicted by our theoretical results, scheme (5.1) is exactly energy preserving and, despite the fact that the constraint was differentiated, does not suffer from the drift-off phenomenon; see Remark 8. In our computations, the length of the pendulum as well as the total energy of the system are conserved up to machine precision even over hundreds of periods.
6 Discussion
We proposed an abstract framework for the numerical approximation of evolution problems with an underlying Hamiltonian or gradient structure, and we showed that this underlying geometric structure can be preserved exactly under discretization with Galerkin methods in space and Petrov–Galerkin approximation in time if the evolution problem was written in a canonical form already on the continuous level.
We also illustrated that some inexactness in the numerical realization of the Galerkin approximations is possible which may facilitate the numerical realization.
The discrete derivative and average vector field collocation methods could be interpreted as such inexact realizations of the Petrov–Galerkin time-discretization.
The viability of the proposed approach and the practicability of the resulting discretization schemes was demonstrated for some typical test problems.
We note that, in case of complex non-quadratic Hamiltonians, the efficient numerical handling of the term
Funding source: Deutsche Forschungsgemeinschaft
Award Identifier / Grant number: TRR 146 project C3
Award Identifier / Grant number: TRR 154 project C04
Award Identifier / Grant number: Eg-331/2-1
Funding statement: The work of the author was supported by the “Excellence Initiative” of the German Federal and State Governments via the Center of Computational Engineering GSC 233 at TU Darmstadt and by the German Research Foundation (DFG) via grants TRR 146 project C3, TRR 154 project C04, and Eg-331/2-1 within SPP 2256.
References
[1] B. M. Afkham and J. S. Hesthaven, Structure-preserving model-reduction of dissipative Hamiltonian systems, J. Sci. Comput. 81 (2019), no. 1, 3–21. 10.1007/s10915-018-0653-6Search in Google Scholar
[2] G. Akrivis, C. Makridakis and R. H. Nochetto, Galerkin and Runge–Kutta methods: Unified formulation, a posteriori error estimates and nodal superconvergence, Numer. Math. 118 (2011), no. 3, 429–456. 10.1007/s00211-011-0363-6Search in Google Scholar
[3] A. Alonso Rodríguez and A. Valli, Eddy Current Approximation of Maxwell Equations. Theory, Algorithms and Applications, Model. Simul. Appl. 4, Springer, Milan, 2010. 10.1007/978-88-470-1506-7Search in Google Scholar
[4] A. C. Antoulas, Approximation of Large-Scale Dynamical Systems, Adv. Des. Control 6, Society for Industrial and Applied Mathematics, Philadelphia, 2005. 10.1137/1.9780898718713Search in Google Scholar
[5] C. Beattie and S. Gugercin, Interpolatory projection methods for structure-preserving model reduction, Systems Control Lett. 58 (2009), no. 3, 225–232. 10.1016/j.sysconle.2008.10.016Search in Google Scholar
[6] C. Beattie and S. Gugercin, Structure-preserving model reduction for nonlinear port-Hamiltonian systems, 50th IEEE Conference on Decision and Control and European Control Conference (CDC-ECC), IEEE Press, Piscataway (2011), 6564–6569. 10.1109/CDC.2011.6161504Search in Google Scholar
[7] P. Benner, V. Mehrmann and D. C. Sorensen, Dimension Reduction of Large-Scale Systems, Lect. Notes Comput. Sci. Eng. 45, Springer, Berlin, 2005. 10.1007/3-540-27909-1Search in Google Scholar
[8] E. Celledoni, S. L. Eidnes, B. Owren and T. R. Ringholm, Dissipative numerical schemes on Riemannian manifolds with applications to gradient flows, SIAM J. Sci. Comput. 40 (2018), no. 6, A3789–A3806. 10.1137/18M1190628Search in Google Scholar
[9] E. Celledoni, S. L. Eidnes, B. Owren and T. R. Ringholm, Energy-preserving methods on Riemannian manifolds, Math. Comp. 89 (2020), no. 322, 699–716. 10.1090/mcom/3470Search in Google Scholar
[10] E. Celledoni and E. H. Hoiseth, Energy-preserving and passivity-consistent numerical discretization of port-Hamiltonian systems, preprint (2017), https://arxiv.org/abs/1706.08621. Search in Google Scholar
[11] S. Chaturantabut, C. Beattie and S. Gugercin, Structure-preserving model reduction for nonlinear port-Hamiltonian systems, SIAM J. Sci. Comput. 38 (2016), no. 5, B837–B865. 10.1137/15M1055085Search in Google Scholar
[12] D. Cohen and E. Hairer, Linear energy-preserving integrators for Poisson systems, BIT 51 (2011), no. 1, 91–101. 10.1007/s10543-011-0310-zSearch in Google Scholar
[13] H. Egger, Structure preserving approximation of dissipative evolution problems, Numer. Math. 143 (2019), no. 1, 85–106. 10.1007/s00211-019-01050-wSearch in Google Scholar
[14] E. Eich-Soellner and C. Führer, Numerical Methods in Multibody Dynamics, Eur. Consort. Math. Ind., B. G. Teubner, Stuttgart, 1998. 10.1007/978-3-663-09828-7Search in Google Scholar
[15] C. M. Elliott, The Cahn–Hilliard model for the kinetics of phase separation, Mathematical Models for Phase Change Problems (Óbidos 1988), Internat. Ser. Numer. Math. 88, Birkhäuser, Basel (1989), 35–73. 10.1007/978-3-0348-9148-6_3Search in Google Scholar
[16] A. Ern and J.-L. Guermond, Theory and Practice of Finite Elements, Appl. Math. Sci. 159, Springer, New York, 2004. 10.1007/978-1-4757-4355-5Search in Google Scholar
[17] D. Furihata and T. Matsuo, Discrete Variational Derivative Method, Chapman & Hall/CRC Numer. Anal. Sci. Comput., CRC Press, Boca Raton, 2011. 10.1201/b10387Search in Google Scholar
[18] C. W. Gear, B. Leimkuhler and G. K. Gupta, Automatic integration of Euler–Lagrange equations with constraints, J. Comput. Appl. Math. 12–13 (1985), 77–90. 10.1016/0377-0427(85)90008-1Search in Google Scholar
[19] O. Gonzalez, Time integration and discrete Hamiltonian systems, J. Nonlinear Sci. 6 (1996), no. 5, 449–467. 10.1007/978-1-4612-1246-1_10Search in Google Scholar
[20] E. Hairer, Energy-preserving variant of collocation methods, JNAIAM. J. Numer. Anal. Ind. Appl. Math. 5 (2010), no. 1–2, 73–84. Search in Google Scholar
[21] E. Hairer and C. Lubich, Energy-diminishing integration of gradient systems, IMA J. Numer. Anal. 34 (2014), no. 2, 452–461. 10.1093/imanum/drt031Search in Google Scholar
[22] E. Hairer, C. Lubich and M. Roche, The Numerical Solution of Differential-Algebraic Systems by Runge–Kutta methods, Lecture Notes in Math. 1409, Springer, Berlin, 1989. 10.1007/BFb0093947Search in Google Scholar
[23] E. Hairer, C. Lubich and G. Wanner, Geometric Numerical Integration, Springer Ser. Comput. Math. 31, Springer, Heidelberg, 2010. Search in Google Scholar
[24] P. Kunkel and V. Mehrmann, Differential-Algebraic Equations. Analysis and Numerical Solution, EMS Textbk. Math., European Mathematical Society, Zürich, 2006. 10.4171/017Search in Google Scholar
[25] B. Leimkuhler and S. Reich, Simulating Hamiltonian Dynamics, Cambridge Monogr. Appl. Comput. Math. 14, Cambridge University, Cambridge, 2004. 10.1017/CBO9780511614118Search in Google Scholar
[26] R. I. McLachlan, G. R. W. Quispel and N. Robidoux, Geometric integration using discrete gradients, R. Soc. Lond. Philos. Trans. Ser. A Math. Phys. Eng. Sci. 357 (1999), no. 1754, 1021–1045. 10.1098/rsta.1999.0363Search in Google Scholar
[27] P. Monk, Finite Element Methods for Maxwell’s Equations, Numer. Math. Sci. Comput., Oxford University, New York, 2003. 10.1093/acprof:oso/9780198508885.001.0001Search in Google Scholar
[28] R. V. Polyuga, Discussion on: “Passivity and structure preserving order reduction of linear port-Hamiltonian systems using Krylov subspaces” [mr2731511], Eur. J. Control 16 (2010), no. 4, 407–409. 10.1016/S0947-3580(10)70672-5Search in Google Scholar
[29] K. Strehmel and R. Weiner, Numerik gewöhnlicher Differentialgleichungen, Teubner Math. Textb., B. G. Teubner, Stuttgart, 1995. Search in Google Scholar
[30] V. Thomée, Galerkin Finite Element Methods for Parabolic Problems, 2nd ed., Springer Ser. Comput. Math. 25, Springer, Berlin, 2006. Search in Google Scholar
© 2021 Walter de Gruyter GmbH, Berlin/Boston