Next Article in Journal
On a New Generalization of Banach Contraction Principle with Application
Next Article in Special Issue
Computing the Matrix Exponential with an Optimized Taylor Polynomial Approximation
Previous Article in Journal
Inertial-Like Subgradient Extragradient Methods for Variational Inequalities and Fixed Points of Asymptotically Nonexpansive and Strictly Pseudocontractive Mappings
Previous Article in Special Issue
R-Adaptive Multisymplectic and Variational Integrators
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Variational Partitioned Runge–Kutta Methods for Lagrangians Linear in Velocities

by
Tomasz M. Tyranowski
1,2,*,† and
Mathieu Desbrun
2,†
1
Max-Planck-Institut für Plasmaphysik, Boltzmannstraße 2, 85748 Garching, Germany
2
Department of Computing and Mathematical Sciences, California Institute of Technology, Pasadena, CA 91125, USA
*
Author to whom correspondence should be addressed.
These authors contributed equally to this work.
Mathematics 2019, 7(9), 861; https://doi.org/10.3390/math7090861
Submission received: 20 August 2019 / Revised: 10 September 2019 / Accepted: 10 September 2019 / Published: 18 September 2019
(This article belongs to the Special Issue Geometric Numerical Integration)

Abstract

:
In this paper, we construct higher-order variational integrators for a class of degenerate systems described by Lagrangians that are linear in velocities. We analyze the geometry underlying such systems and develop the appropriate theory for variational integration. Our main observation is that the evolution takes place on the primary constraint and the “Hamiltonian” equations of motion can be formulated as an index-1 differential-algebraic system. We also construct variational Runge–Kutta methods and analyze their properties. The general properties of Runge–Kutta methods depend on the “velocity” part of the Lagrangian. If the “velocity” part is also linear in the position coordinate, then we show that non-partitioned variational Runge–Kutta methods are equivalent to integration of the corresponding first-order Euler–Lagrange equations, which have the form of a Poisson system with a constant structure matrix, and the classical properties of the Runge–Kutta method are retained. If the “velocity” part is nonlinear in the position coordinate, we observe a reduction of the order of convergence, which is typical of numerical integration of DAEs. We verified our results through numerical experiments for various dynamical systems.

1. Introduction

Geometric integrators are numerical methods that preserve geometric structures and properties of the flow of a differential equation. Structure-preserving integrators have attracted considerable interest due to their excellent numerical behavior, especially for long-time integration of equations possessing geometric properties (see [1,2,3]).
An important class of structure-preserving integrators are variational integrators. This type of numerical schemes is based on discrete variational principles and provides a natural framework for the discretization of Lagrangian systems, including forced, dissipative, constrained, or stochastic ones. For an overview of variational integration, see [4] (see also [5,6,7,8,9,10,11,12,13,14,15,16,17,18]). Variational integrators were introduced in the context of finite-dimensional mechanical systems, but were later generalized to Lagrangian field theories (see [19]) and applied in many computations, for example in elasticity, electrodynamics, or fluid dynamics (see [20,21,22,23,24]).
Theoretical aspects of variational integration are well understood in the case when the Lagrangian describing the considered system is regular, that is, when the corresponding Legendre transform is (at least locally) invertible. However, the corresponding theory for degenerate Lagrangian systems is less developed. The analysis of degenerate systems becomes more cumbersome, because the Euler–Lagrange equations may cease to be second order, or may not even make any sense at all. In the latter case, one needs to determine if there exists a submanifold of the configuration bundle T Q on which consistent equations of motion can be derived. This can be accomplished by applying the Dirac theory of constraints or the pre-symplectic constraint algorithm (see [25,26]).
A particularly simple case of degeneracy occurs when the Lagrangian is linear in velocities. In that case, the dynamics of the system is defined on the configuration manifold Q itself, rather than its tangent bundle T Q , provided that some regularity conditions are satisfied. Such systems arise in many physical applications, including interacting point vortices in the plane (see [17,18,27]), guiding center dynamics (see [28,29,30,31,32]), or partial differential equations such as the nonlinear Schrödinger [33], KdV [34,35] or Camassa–Holm equations [36,37]. In Section 5, we show how certain Poisson systems can be recast as Lagrangian systems whose Lagrangians are linear in velocities. Therefore, our approach offers a new perspective on geometric integration of Poisson systems, which often arise as semi-discretizations of integrable nonlinear partial differential equations, e.g., the Toda or Volterra lattice equations, and play an important role in the modeling of many physical phenomena (see [38,39,40]).
This paper is organized as follows. In Section 2, we introduce a proper geometric setup and discuss the properties of systems that are linear in velocities. In Section 3, we analyze the general properties of variational integrators and point out how the relevant theory differs from the non-degenerate case. In Section 4, we introduce variational partitioned Runge–Kutta methods and discuss their relation to numerical integration of differential-algebraic systems. In Section 5, we present the results of our numerical experiments for Kepler’s problem, a system of two interacting vortices, and the Lotka–Volterra model. We summarize our work and discuss possible extensions in Section 6.

2. Geometric Setup

Let Q be the configuration manifold and T Q its tangent bundle. Throughout this work, we assume that the dimension of the configuration manifold dim Q = n is even. We further assume Q is a vector space and by a slight abuse of notation we denote by q both an element of Q and the vector of its coordinates q = ( q 1 , , q n ) in a local chart on Q. It is clear from the context which definition is invoked. Consider the Lagrangian L : T Q R given by
L ( v q ) = α , v q H ( q ) ,
where α : Q T * Q is a smooth one-form, H : Q R is the Hamiltonian, and v q T q Q . Let ( q μ , q ˙ μ ) denote canonical coordinates on T Q , where μ = 1 , , n . In these coordinates, we can consider
L ( q , q ˙ ) = α μ ( q ) q ˙ μ H ( q ) ,
where summation over repeated Greek indices is implied.

2.1. Equations of Motion

The Lagrangian in Equation (1) is degenerate, since the associated Legendre transform
F L : T Q v q α q T * Q
is not invertible. The local representation of the Legendre transform is
F L ( q μ , q ˙ μ ) = q μ , L q ˙ μ = q μ , α μ ( q ) ,
that is,
p μ = α μ ( q ) ,
where ( q μ , p μ ) denote canonical coordinates on T * Q . The dynamics is defined by the action functional
S [ q ( t ) ] = a b L q ( t ) , q ˙ ( t ) d t
and Hamilton’s principle, which seeks the curves q ( t ) such that the functional S [ q ( t ) ] is stationary under variations of q ( t ) with fixed endpoints, i.e., we seek q ( t ) such that
d S [ q ( t ) ] · δ q ( t ) = d d ϵ | ϵ = 0 S [ q ϵ ( t ) ] = 0
for all δ q ( t ) with δ q ( a ) = δ q ( b ) = 0 , where q ϵ ( t ) is a smooth family of curves satisfying q 0 = q and d d ϵ | ϵ = 0 q ϵ = δ q . The resulting Euler–Lagrange equations
M μ ν ( q ) q ˙ ν = μ H ( q )
form a system of first-order ODEs, where we assume that the even-dimensional antisymmetric matrix M μ ν ( q ) = μ α ν ( q ) ν α μ ( q ) is invertible for all q Q . Without loss of generality, we can further assume that the coordinate mapping p μ = α μ ( q ) is invertible and its inverse is smooth: if the Jacobian α μ / q ν is singular, we can redefine α μ ( q ) α μ ( q ) + b μ ( q μ ) , where b μ ( q μ ) are arbitrary functions; the Euler–Lagrange equations remain the same, and with the right choice of the functions b μ ( q μ ) , the redefined Jacobian can be made nonsingular. Using B = M 1 , Equation (8) can be equivalently written as the Poisson system
q ˙ μ = B μ ν ( q ) ν H ( q ) .
The Euler–Lagrange Equation (8) can also be formulated as the implicit “Hamiltonian” system
p μ = α μ ( q ) , p ˙ μ = μ α ν ( q ) q ˙ ν μ H ( q ) .
Since the Lagrangian L is degenerate, Equation (10) is an index-1 system of differential-algebraic equations (DAE), rather than a Hamiltonian ODE system: the Legendre transform is an algebraic equation and has to be differentiated once with respect to time in order to turn this system into Equation (8). This reflects the fact that the evolution of the considered degenerate system takes place on the primary constraint N = F L ( T Q ) T * Q . It is easy to see that the primary constraint N is (locally) diffeomorphic to the configuration manifold Q, where the diffeomorphism η : Q q α q N is locally, in the coordinates on T * Q , given by
η ( q ) = ( q , α ( q ) ) ,
where by a slight abuse of notation α ( q ) = ( α 1 ( q ) , , α n ( q ) ) . This shows that q μ can also be used as local coordinates on N. Note that η is simply the restriction of α to N, i.e., η = α | Q N .

2.2. Symplectic Forms

The spaces Q, T Q , T * Q and N can be equipped with several symplectic or pre-symplectic forms. It is instructive to investigate the relationships among them in order to later avoid confusion regarding the sense in which variational integrators for Lagrangians linear in velocities are symplectic. On the configuration space Q, we can define the two-form
Ω = d α ,
which in local coordinates can be expressed as
Ω = d α μ d q μ = M μ ν ( q ) d q μ d q ν .
The two-form Ω is symplectic if it is nondegenerate, i.e., if the matrix M μ ν is invertible for all q.
The cotangent bundle T * Q is equipped with the canonical Cartan one-form Θ ˜ : T * Q T * T * Q , which is intrinsically defined by the formula
Θ ˜ ( ω ) = ( π T * Q ) * ω
for any ω T * Q , where π T * Q : T * Q Q is the cotangent bundle projection. In canonical coordinates, we have
Θ ˜ = p μ d q μ .
We further have the canonical symplectic two-form
Ω ˜ = d Θ ˜ = d q μ d p μ .
The symplectic forms Ω and Ω ˜ are related by
Ω = α * Ω ˜ .
This follows from the simple calculation
α * Θ ˜ · v q = Θ ˜ ( α q ) · T α ( v q ) = α q · T π T * Q T α ( v q ) = α q · T ( π T * Q α ) ( v q ) = α q · v q ,
where we used Equation (14) and the fact that π T * Q α = id Q . Hence, α * Θ ˜ = α , and taking the exterior derivative on both sides we obtain Equation (17).
Using the Legendre transform (Equation (3)) we can define the Lagrangian two-form Ω ˜ L on T Q by Ω ˜ L = F L * Ω ˜ , which in canonical coordinates ( q μ , q ˙ μ ) is given by
Ω ˜ L = d q μ d α μ = M μ ν ( q ) d q μ d q ν .
The Lagrangian form Ω ˜ L is only pre-symplectic, because it is degenerate. Noting that F L = α π T Q , where π T Q : T Q Q is the tangent bundle projection, we can relate Ω and Ω ˜ L through the formula
Ω ˜ L = ( π T Q ) * α * Ω ˜ = ( π T Q ) * Ω .
The symplectic structure on N can be introduced in two ways: by pushing forward Ω from Q, or pulling back Ω ˜ from T * Q . Both ways are equivalent, with
Ω ˜ N = η * Ω = i * Ω ˜ ,
where i : N T * Q is the inclusion map. This follows from the calculation
η * Ω = ( η 1 ) * α * Ω ˜ = ( α η 1 ) * Ω ˜ = i * Ω ˜ ,
where we used α = i η . If we use q μ as coordinates on N, then the local representation of Ω ˜ N is given by Equation (13).

2.3. Symplectic Flows

Let φ t : Q Q denote the flow of Equation (8) or Equation (9). This flow is symplectic on Q, that is
φ t * Ω = Ω .
This fact can be proven by considering the Hamiltonian or Poisson properties of Equation (8) or Equation (9) (see [1,26]). It also follows directly from the action principle in Equation (7) (see [17]).
Since the Lagrangian in Equation (1) is degenerate, the dynamics of the system is defined on Q rather than T Q . However, we can obtain the associated flow on T Q through lifting φ t by its tangent map T φ t : T Q T Q . This flow preserves the Lagrangian two-form
( T φ t ) * Ω ˜ L = Ω ˜ L .
This can be seen from the calculation
( T φ t ) * Ω ˜ L = ( T φ t ) * ( π T Q ) * Ω = ( π T Q T φ t ) * Ω = ( φ t π T Q ) * Ω = ( π T Q ) * φ t * Ω = Ω ˜ L ,
where we use Equations (20) and (23), and the property π T Q T φ t = φ t π T Q .
The flow φ t induces the flow φ ˜ t : N N in a natural way as
φ ˜ t = η φ t η 1 .
This flow is symplectic on N, i.e.,
φ ˜ t * Ω ˜ N = Ω ˜ N ,
which can be established through the simple calculation
φ ˜ t * Ω ˜ N = ( η φ t η 1 ) * η * Ω = ( η 1 ) * φ t * η * ( η 1 ) * Ω = η * φ t * Ω = Ω ˜ N ,
where we use Equations (21) and (23). The flow φ ˜ t can be interpreted as the symplectic flow for the “Hamiltonian” DAE in Equation (10).

3. Veselov Discretization and Discrete Mechanics

3.1. Discrete Mechanics

For a Veselov-type discretization, we consider the discrete state space Q × Q , which serves as a discrete approximation of the tangent bundle (see [4]). We define a discrete Lagrangian L d as a smooth map L d : Q × Q R and the corresponding discrete action
S = k = 0 N 1 L d ( q k , q k + 1 ) .
The variational principle now seeks a sequence q 0 , q 1 , , q N that extremizes S for variations holding the endpoints q 0 and q N fixed. The Discrete Euler–Lagrange equations follow
D 2 L d ( q k 1 , q k ) + D 1 L d ( q k , q k + 1 ) = 0 .
Assuming that these equations can be solved for q k + 1 , i.e., L d is non-degenerate, they implicitly define the discrete Lagrangian map F L d : Q × Q Q × Q such that F L d ( q k 1 , q k ) = ( q k , q k + 1 ) . Let ( q μ , q ¯ μ ) denote local coordinates on Q × Q . We can define the discrete Legendre transforms F L d + , F L d : Q × Q T * Q , which in local coordinates on Q × Q and T * Q are, respectively, given by
F + L d ( q , q ¯ ) = q ¯ , D 2 L d ( q , q ¯ ) , F L d ( q , q ¯ ) = q , D 1 L d ( q , q ¯ ) ,
where q = ( q 1 , , q n ) and q ¯ = ( q ¯ 1 , , q ¯ n ) . The Discrete Euler–Lagrange Equation (30) can be equivalently written as
F + L d ( q k 1 , q k ) = F L d ( q k , q k + 1 ) .
Using either of the transforms, one can define the discrete Lagrange two-form on Q × Q by ω L d = ( F ± L d ) * Ω ˜ , which in coordinates gives
ω L d = 2 L d q μ q ¯ ν d q μ d q ¯ ν .
It then follows that the discrete flow F L d is symplectic, i.e., F L d * ω L d = ω L d . Using the Legendre transforms, we can pass to the cotangent bundle and define the discrete Hamiltonian map F ˜ L d : T * Q T * Q by F ˜ L d = F ± L d F L d ( F ± L d ) 1 . This map is also symplectic, i.e., F ˜ L d * Ω ˜ = Ω ˜ .

3.2. Exact Discrete Lagrangian

To relate discrete and continuous mechanics, it is necessary to introduce a timestep h R . If the continuous Lagrangian L is non-degenerate, it is possible to define a particular choice of discrete Lagrangian which gives an exact correspondence between discrete and continuous systems (see [4]), the so-called exact discrete Lagrangian
L d E ( q , q ¯ ) = 0 h L q E ( t ) , q ˙ E ( t ) d t ,
where q E ( t ) is the solution to the continuous Euler–Lagrange equations associated with L such that it satisfies the boundary conditions q E ( 0 ) = q and q E ( h ) = q ¯ . Note, however, that in the case of a regular Lagrangian, the associated Euler–Lagrange equations are second order, therefore boundary value problems are solvable, at least for sufficiently small h and q ¯ sufficiently close to q. In the case of the Lagrangian defined in Equation (1) the associated Euler–Lagrange Equation (8) is first order in time, therefore we have the freedom to choose an initial condition either at t = 0 or t = h , but not both. An exact discrete Lagrangian analogous to Equation (34) cannot thus be defined on the whole space Q × Q . We therefore assume the following definition:
Definition 1.
Let Γ ( φ h ) = q , φ h ( q ) Q × Q be the graph of φ h . The exact discrete Lagrangian L d E : Γ ( φ h ) R for the Lagrangian given in Equation (1) is
L d E ( q , q ¯ ) = 0 h L q E ( t ) , q ˙ E ( t ) d t ,
where q E ( t ) is the solution to Equation (8) that satisfies the initial condition q E ( 0 ) = q .
Note that in this definition we automatically have q E ( h ) = q ¯ .

3.3. Singular Perturbation Problem

As mentioned above, the purpose of introducing an exact discrete Lagrangian is to establish an exact correspondence between the continuous and discrete systems. For a regular Lagrangian L and its exact discrete Lagrangian L d E , one can show that the exact discrete Hamiltonian map F ˜ L d E is equal to φ ˜ h , where φ ˜ t is the symplectic flow for the Hamiltonian system associated with L. The problem is that the exact discrete Lagrangian given in Equation (35) is not defined on the whole space Q × Q , so the discrete Euler–Lagrange Equation (30) does not make sense, and it is not entirely clear how to define the associated discrete Lagrangian map F L d E . One possible way to deal with this issue is to consider a singular perturbation problem. Assume that Q is a Riemannian manifold equipped with the nondegenerate scalar product . , . . Define the ϵ -regularized Lagrangian
L ϵ ( v q ) = ϵ 2 v q , v q + α , v q H ( q ) ,
or in coordinates
L ϵ ( q , q ˙ ) = ϵ 2 g μ ν q ˙ μ q ˙ ν + α μ ( q ) q ˙ μ H ( q ) ,
where g μ ν denotes the local coordinates of the metric tensor. Without loss of generality assume that in the chosen coordinates g μ μ = 1 and g μ ν = 0 if μ ν . For ϵ > 0 , this Lagrangian is nondegenerate and the Legendre transform F L ϵ : T Q T * Q is given by
F L ( q μ , q ˙ μ ) = q μ , ϵ g μ ν q ˙ ν + α μ ( q ) ,
that is,
p μ = ϵ g μ ν q ˙ ν + α μ ( q ) .
The Euler–Lagrange equations
ϵ g μ ν q ¨ ν = M μ ν ( q ) q ˙ ν μ H ( q )
are second order. The corresponding Hamiltonian equations (in implicit form) are
p μ = ϵ g μ ν q ˙ ν + α μ ( q ) , p ˙ μ = μ α ν ( q ) q ˙ ν μ H ( q ) .
There is no reason to expect that the solutions of Equation (40) or Equation (41) unconditionally approximate the solutions of Equation (8) or Equation (10), respectively. Equation (41) is a system of first-order ordinary differential equations, and therefore it is possible to specify arbitrary initial conditions q ( 0 ) = q i n i t and p ( 0 ) = p i n i t , whereas initial conditions for Equation (10) have to satisfy the algebraic constraint p i n i t = α ( q i n i t ) . Under certain restrictive analytic assumptions, for some singular perturbation problems it is possible to show that, in order to satisfy the initial conditions, the solutions initially develop a steep boundary layer, but then rapidly converge to the solution of the corresponding DAE system (see [41]). On the other hand, for other singular perturbation problems, when the initial conditions do not satisfy the algebraic constraint, it may happen that the solutions do not converge to the solution of the DAE, but instead rapidly oscillate (see [42,43]). We expect the latter behavior for Equation (41), as demonstrated by a simple example in Section 3.5. Since our main goal here is to show how the notion of a discrete Legendre transform can be introduced for the exact discrete Lagrangian in Equation (35), we make two intuitive, although nontrivial, assumptions. We refer the interested reader to [41,42] for techniques that can be used to prove these statements rigorously.
Assumption 1.
Let q ( t ) , p ( t ) and q ϵ ( t ) , p ϵ ( t ) be the unique smooth solutions of Equations (10) and (41) on the interval [ 0 , T ] satisfying the initial conditions q ( 0 ) = q i n i t , q ϵ ( 0 ) = q i n i t and p ϵ ( 0 ) = p i n i t , where p i n i t = α ( q i n i t ) . Then, q ϵ ( t ) q ( t ) , p ϵ ( t ) p ( t ) and q ˙ ϵ ( t ) q ˙ ( t ) , p ˙ ϵ ( t ) p ˙ ( t ) uniformly on [ 0 , T ] as ϵ 0 + .
Assumption 2.
Let q ( t ) be the unique smooth solution of Equation (8) on the interval [ 0 , T ] satisfying the initial condition q ( 0 ) = q i n i t and let q ϵ ( t ) be the unique smooth solution of Equation (40) on the interval [ 0 , T ] satisfying the boundary conditions q ϵ ( 0 ) = q i n i t , q ϵ ( T ) = q f i n a l , where q f i n a l = q ( T ) . Then, q ϵ ( t ) q ( t ) and q ˙ ϵ ( t ) q ˙ ( t ) uniformly on [ 0 , T ] as ϵ 0 + .
With these assumptions, one can easily see that
L d E ( q , q ¯ ) = lim ϵ 0 + L d ϵ , E ( q , q ¯ ) ,
where L d ϵ , E is the exact discrete Lagrangian corresponding to the Lagrangian given in Equation (36).

3.4. Exact Discrete Legendre Transform

Since L ϵ is regular, L d ϵ , E is properly defined on the whole space Q × Q (or at least in a neighborhood of Γ ( φ h ) ) and the associated exact discrete Legendre transforms satisfy the properties (see [4])
F + L d ϵ , E ( q , q ¯ ) = F L ϵ q E ϵ ( h ) , q ˙ E ϵ ( h ) = ( q ¯ , ϵ q ¯ ˙ ϵ + α ( q ¯ ) ) , F L d ϵ , E ( q , q ¯ ) = F L ϵ q E ϵ ( 0 ) , q ˙ E ϵ ( 0 ) = ( q , ϵ q ˙ ϵ + α ( q ) ) ,
where q E ϵ ( t ) is the solution to the regularized Euler–Lagrange Equation (40) satisfying the boundary conditions q E ϵ ( 0 ) = q and q E ϵ ( h ) = q ¯ , and we denote q ˙ ϵ = q ˙ E ϵ ( 0 ) , q ¯ ˙ ϵ = q ˙ E ϵ ( h ) . In the spirit of Equation (42), we can assume the following definitions of the exact discrete Legendre transforms F ± L d E : Γ ( φ h ) T * Q
F + L d E ( q , q ¯ ) = lim ϵ 0 + F + L d ϵ , E ( q , q ¯ ) = ( q ¯ , α ( q ¯ ) ) , F L d E ( q , q ¯ ) = lim ϵ 0 + F L d ϵ , E ( q , q ¯ ) = ( q , α ( q ) ) ,
where ϵ q ˙ ϵ 0 and ϵ q ¯ ˙ ϵ 0 by uniform convergence of q ˙ E ϵ ( t ) . Note that F ± L d E = α π ± , where π + : Γ ( φ h ) ( q , q ¯ ) q ¯ Q and π : Γ ( φ h ) ( q , q ¯ ) q Q are projections (both π ± are diffeomorphisms). This is a close analogy to F L = α π T Q (see Section 2). We also note the property
F + L d E ( q , q ¯ ) = F L q E ( h ) , q ˙ E ( h ) , F L d E ( q , q ¯ ) = F L q E ( 0 ) , q ˙ E ( 0 ) ,
where q E ( t ) is the solution of Equation (8) satisfying the initial condition q E ( 0 ) = q . This further indicates that our definition of the exact discrete Legendre transforms is sensible. Note that F ± L d E ( Γ ( φ h ) ) = N . It is convenient to redefine F ± L d E : Γ ( φ h ) N , that is F ± L d E = η π ± , so that both transforms are diffeomorphisms between Γ ( φ h ) and N.
The discrete Euler–Lagrange equations for L d E can be obtained as the limit of the discrete Euler–Lagrange equations for L d ϵ , E , that is, one can substitute L d ϵ , E in Equation (32) and take the limit ϵ 0 + on both sides to obtain
F + L d E ( q k 1 , q k ) = F L d E ( q k , q k + 1 ) .
This equation implicitly defines the exact discrete Lagrangian map F L d E : Γ ( φ h ) ( q k 1 , q k ) ( q k , q k + 1 ) Γ ( φ h ) , which, given our definitions, necessarily takes the form F L d E ( q k 1 , q k ) = ( q k , φ h ( q k ) ) . Using the discrete Legendre transforms F ± L d E , we can define the corresponding exact discrete “Hamiltonian” map F ˜ L d E : N N as F ˜ L d E = F ± L d E F L d E ( F ± L d E ) 1 . The simple calculation
F ˜ L d E = η π ± F L d E ( π ± ) 1 η 1 = η φ h η 1 = φ ˜ h
shows that the discrete “Hamiltonian” map associated with the exact discrete Lagrangian L d E is equal to the “Hamiltonian” flow φ ˜ h for Equation (10), i.e., the evolution of the discrete systems described by L d E coincides with the evolution of the continuous system described by L at times t k = k h , k = 0 , 1 , 2 ,

3.5. Example

Let us illustrate these ideas with a very simple example for which analytic solutions are known. Let Q = R 2 and let ( x , y ) denote local coordinates on Q. The tangent bundle is T Q = R 2 × R 2 , and the induced local coordinates are ( x , y , x ˙ , y ˙ ) . Consider the Lagrangian
L ( x , y , x ˙ , y ˙ ) = 1 2 y x ˙ 1 2 x y ˙ .
The corresponding Euler–Lagrange Equation (8) is simply
x ˙ = 0 , y ˙ = 0 ,
so the flow φ t : Q Q is the identity, i.e., φ t ( x , y ) = ( x , y ) . Let ( x , y , p x , p y ) denote canonical coordinates on the cotangent bundle T * Q R 2 × R 2 . The Legendre transform is
F L ( x , y , x ˙ , y ˙ ) = x , y , 1 2 y , 1 2 x .
Let h be a timestep. Note Γ ( φ h ) = { ( x , y , x , y ) | ( x , y ) Q } . The exact discrete Lagrangian define in Equation (35) is therefore
L d E ( x , y , x , y ) = 0 .
Let us now consider the ϵ -regularized Lagrangian
L ϵ ( x , y , x ˙ , y ˙ ) = ϵ 2 x ˙ 2 + ϵ 2 y ˙ 2 + 1 2 y x ˙ 1 2 x y ˙ .
The corresponding Euler–Lagrange Equation (40) takes the form
ϵ x ¨ + y ˙ = 0 , ϵ y ¨ + x ˙ = 0 .
One can easily verify analytically that
x ϵ ( t ) = 1 2 ( x i + x f ) ( y f y i ) cot T 2 ϵ + 1 2 ( y f y i ) + ( x f x i ) cot T 2 ϵ sin t ϵ 1 2 ( x f x i ) ( y f y i ) cot T 2 ϵ cos t ϵ , y ϵ ( t ) = 1 2 ( y i + y f ) + ( x f x i ) cot T 2 ϵ 1 2 ( x f x i ) ( y f y i ) cot T 2 ϵ sin t ϵ 1 2 ( y f y i ) + ( x f x i ) cot T 2 ϵ cos t ϵ ,
is the solution to Equation (53) satisfying the boundary conditions ( x ϵ ( 0 ) , y ϵ ( 0 ) ) = ( x i , y i ) and ( x ϵ ( T ) , y ϵ ( T ) ) = ( x f , y f ) . Note that, if x i x f or y i y f , then as ϵ 0 + this solution is rapidly oscillatory and not convergent. However, if ( x f , y f ) = φ T ( x i , y i ) = ( x i , y i ) (cf. Assumption 2), then we have
x ϵ ( t ) = x i , y ϵ ( t ) = y i ,
and this solution converges uniformly (in this simple example it is in fact equal) to the solution of Equation (49) with the same initial condition. We can also find an analytic expression for the exact discrete Lagrangian defined in Equation (34) associated with the Lagrangian considered in Equation (52) as
L d ϵ , E ( x , y , x ¯ , y ¯ ) = x ¯ y x y ¯ 2 + ( x ¯ x ) 2 + ( y ¯ y ) 2 4 cot T 2 ϵ .
Restricting the domain to Γ ( φ h ) we get L d ϵ , E ( x , y , x , y ) = 0 , and comparing to Equation (51) we verify that Equation (42) indeed holds. The discrete Legendre transforms in Equation (31) associated with L d ϵ , E take the form
F + L d ϵ , E ( x , y , x ¯ , y ¯ ) = x ¯ , y ¯ , y 2 + x ¯ x 2 cot T 2 ϵ , x 2 + y ¯ y 2 cot T 2 ϵ , F L d ϵ , E ( x , y , x ¯ , y ¯ ) = x , y , y ¯ 2 + x ¯ x 2 cot T 2 ϵ , x ¯ 2 + y ¯ y 2 cot T 2 ϵ .
Restricting the domain to Γ ( φ h ) and taking the limit ϵ 0 + as in Equation (44), we can define the exact discrete Legendre transforms associated with Equation (51)
F + L d E ( x , y , x , y ) = x , y , y 2 , x 2 , F L d E ( x , y , x , y ) = x , y , y 2 , x 2 .
Comparing with Equation (50), we see that the property described in Equation (45) is satisfied, which replicates the analogous property for regular Lagrangians.

3.6. Variational Error Analysis

For a given continuous system described by the Lagrangian L, a variational integrator is constructed by choosing a discrete Lagrangian L d which approximates the exact discrete Lagrangian L d E . We can define the order of accuracy of the discrete Lagrangian in a way similar to that for discrete Lagrangians resulting from regular continuous Lagrangians (see [4]).
Definition 2.
A discrete Lagrangian L d : Q × Q R is of order r if there exists an open subset U Q with compact closure and constants C > 0 and h ¯ > 0 such that
| L d q ( 0 ) , q ( h ) L d E q ( 0 ) , q ( h ) | C h r + 1
for all solutions q ( t ) of the Euler–Lagrange Equation (8) with initial conditions q ( 0 ) U and for all h h ¯ .
We always assume that the discrete Lagrangian L d is non-degenerate, so that the discrete Euler–Lagrange Equation (30) can be solved for q k + 1 . This defines the discrete Lagrangian map F L d : Q × Q Q × Q and the associated discrete Hamiltonian map F ˜ L d : T * Q T * Q , as in Section 3.1. Of particular interest is the rate of convergence of F ˜ L d to φ ˜ h . One usually considers a local error (error made after one step) and a global error (error made after many steps). We assume the following definitions, which are appropriate for differential-algebraic systems (see [1,4,41,44]).
Definition 3.
A discrete Hamiltonian map F ˜ L d is of order r if there exists an open set U N and constants C > 0 and h ¯ > 0 such that
F ˜ L d ( q , p ) φ ˜ h ( q , p ) C h r + 1
for all ( q , p ) U and h h ¯ .
Definition 4.
A discrete Hamiltonian map F ˜ L d is convergent of order r if there exists an open set U N and constants C > 0 , h ¯ > 0 and T ¯ > 0 such that
( F ˜ L d ) K ( q , p ) φ ˜ T ( q , p ) C h r + 1 ,
where h = T / K , for all ( q , p ) U , h h ¯ , and T T ¯ .
If the Lagrangian L is regular, then one can show that a discrete Lagrangian L d is of order r if and only if the corresponding Hamiltonian map F ˜ L d is of order r (see [4]). In addition, the associated Hamiltonian equations are a set of ordinary differential equations, and under some smoothness assumptions one can show that if F ˜ L d is of order r, then it is also convergent of order r (see [44]). However, in the case of the Lagrangian defined in Equation (1) it is not true in general—both the order of the discrete Lagrangian and the local order of the discrete Hamiltonian map may be different than the actual global order of convergence (see [41,45]), as demonstrated in Section 4.
Example: Midpoint Rule. In a simple example, we demonstrate that the variational order of accuracy of a discretization method is unaffected by a degeneracy of a Lagrangian L. To calculate the order of a discrete Lagrangian L d , we can expand L d ( q ( 0 ) , q ( h ) ) in a Taylor series in h and compare it to the analogous expansion for L d E . If the two expansions agree up to r terms, then L d is of order r. Expanding q ( t ) in a Taylor series about t = 0 and substituting it into Equation (35), we get the expression
L d E q ( 0 ) , q ( h ) = h L + h 2 2 L q q ˙ + L q ˙ q ¨ + h 3 6 L q q ¨ + L q ˙ q + q ˙ T 2 L q 2 q ˙ + 2 q ˙ T 2 L q q ˙ q ¨ + q ¨ T 2 L q ˙ 2 q ¨ + o ( h 3 ) ,
where we denote q = q ( 0 ) , q ˙ = q ˙ ( 0 ) , etc., and the Lagrangian L and its derivatives are computed at ( q , q ˙ ) . For the Lagrangian given in Equation (1), the values of q ˙ , q ¨ , and q are determined by differentiating Equation (8) sufficiently many times and substituting the initial condition q ( 0 ) . Note that in case of regular Lagrangians the value of q ˙ is determined by the boundary conditions q ( 0 ) , q ( h ) , and the higher-order derivatives by differentiating the corresponding Euler–Lagrange equations, but apart from that Equation (62) remains qualitatively unaffected.
The midpoint rule is an integrator obtained by defining the discrete Lagrangian
L d ( q , q ¯ ) = h L q + q ¯ 2 , q ¯ q h .
Calculating the expansion in h yields
L d q ( 0 ) , q ( h ) = h L + h 2 2 L q q ˙ + L q ˙ q ¨ + h 3 1 4 L q q ¨ + 1 6 L q ˙ q + 1 8 q ˙ T 2 L q 2 q ˙ + 1 4 q ˙ T 2 L q q ˙ q ¨ + 1 8 q ¨ T 2 L q ˙ 2 q ¨ + o ( h 3 ) .
Comparing this to Equation (62) shows that the discrete Lagrangian defined by the midpoint rule is second order regardless of the degeneracy of L. However, as mentioned before, if L is degenerate we cannot conclude about the global order of convergence of the corresponding discrete Hamiltonian map. The midpoint rule can be formulated as a Runge–Kutta method, namely the 1-stage Gauss method. We discuss Gauss and other Runge–Kutta methods and their convergence properties in more detail in Section 4. Note that low-order variational integrators based on the midpoint rule for Lagrangians as in Equation (1) have been studied in [17,18] in the context of the dynamics of point vortices.

4. Variational Partitioned Runge–Kutta Methods

4.1. VPRK Methods as PRK Methods for the “Hamiltonian” DAE

To construct higher-order variational integrators one may consider a class of partitioned Runge–Kutta (PRK) methods. Variational partitioned Runge–Kutta (VPRK) methods for regular Lagrangians are described in [1,4]. In this section, we show how VPRK methods can be applied to systems described by Lagrangians defined in Equation (1). As in the case of regular Lagrangians, we construct an s-stage variational partitioned Runge–Kutta integrator for the Lagrangian given in Equation (1) by considering the discrete Lagrangian
L d ( q , q ¯ ) = h i = 1 s b i L ( Q i , Q ˙ i ) ,
where the internal stages Q i , Q ˙ i , i = 1 , , s , satisfy the relation
Q i = q + h j = 1 s a i j Q ˙ j ,
and are chosen so that the right-hand side of Equation (65) is extremized under the constraint
q ¯ = q + h i = 1 s b i Q ˙ i .
A variational integrator is then obtained by forming the corresponding discrete Euler–Lagrange Equation (30).
Theorem 1.
The s-stage variational partitioned Runge–Kutta method based on the discrete Lagrangian defined in Equation (65) with the coefficients a i j and b i is equivalent to the following partitioned Runge–Kutta method applied to the “Hamiltonian” DAE in Equation (10):
P i = α ( Q i ) , i ) ] T Q ˙ i D H ( Q i ) , i = 1 , , s ,
P ˙ i = [ D α ( Q i ) ] T Q ˙ i D H ( Q i ) , i = 1 , , s ,
Q i = q + h j = 1 s a i j Q ˙ j , D H ( Q i ) , i = 1 , , s ,
P i = p + h j = 1 s a ¯ i j P ˙ j , D H ( Q i ) , i = 1 , , s ,
q ¯ = q + h j = 1 s b j Q ˙ j ,
p ¯ = p + h j = 1 s b j P ˙ j ,
where the coefficients satisfy the condition
b i a ¯ i j + b j a j i = b i b j , i , j = 1 , , s ,
and ( q , p ) denote the current values of position and momentum, ( q ¯ , p ¯ ) denote the respective values at the next time step, and D α = ( α μ / q ν ) μ , ν = 1 , , n , D H = ( H / q μ ) μ = 1 , , n , and Q i , Q ˙ i , P i , P ˙ i are the internal stages, with Q i = ( Q i μ ) μ = 1 , , n , and similarly for the others.
Proof. 
See Theorem VI.6.4 in [1] or Theorem 2.6.1 in [4]. The proof is essentially identical. The only qualitative difference is the fact that in our case the Lagrangian given in Equation (1) is degenerate, thus the corresponding Hamiltonian system is in fact the index-1 differential-algebraic system stated in Equation (10) rather than a typical system of ordinary differential equations. □

4.1.1. Existence and Uniqueness of the Numerical Solution

Given q and p, one can use Equations (68) to compute the new position q ¯ and momentum p ¯ . First, one needs to solve Equations (68a)–(68d) for the internal stages Q i , Q ˙ i , P i , and P ˙ i . This is a system of 4 s n equations for 4 s n variables, but one has to make sure these equations are independent, so that a unique solution exists. One may be tempted to calculate the Jacobian of this system for h = 0 , and then use the Implicit Function Theorem. However, even if we start with consistent initial values ( q 0 , p 0 ) , the numerical solution ( q k , p k ) for k > 0 will only approximately satisfy the algebraic constraint; thus, Q i = q and P i = p cannot be assumed to be the solution of Equations (68a)–(68d) for h = 0 , and, consequently, the Implicit Function Theorem will not yield a useful result. Let us therefore regard q and p as h-dependent, as they result from the previous iterations of the method with the timestep h. If the method is convergent, it is reasonable to expect that p α ( q ) is small and converges to zero as h is refined. The following approach was inspired by Theorem 4.1 in [45].
Theorem 2.
Let H and α be smooth in an h-independent neighborhood U of q and let the matrix
W ( ξ 1 , , ξ s ) = ( A ¯ I n ) { D α T } ( A I n ) { D α }
be invertible with the inverse bounded in U s , i.e., there exists C > 0 such that
W 1 ( ξ 1 , , ξ s ) C , ( ξ 1 , , ξ s ) U s ,
where A = ( a i j ) i , j = 1 , , s , A ¯ = ( a ¯ i j ) i , j = 1 , , s , I n is the n × n identity matrix, and { D α } denotes the block diagonal matrix
{ D α } ( ξ 1 , , ξ s ) = i = 1 s D α ( ξ i ) = blockdiag D α ( ξ 1 ) , , D α ( ξ s ) .
Suppose also that ( q , p ) satisfy
p α ( q ) = O ( h ) .
Then, there exists h ¯ > 0 such that the nonlinear system described by Equations (68a)(68d) has a solution for h h ¯ . The solution is locally unique and satisfies
Q i q = O ( h ) , P i p = O ( h ) , Q ˙ i = O ( 1 ) , P ˙ i = O ( 1 ) .
Proof. 
Substitute Equation (68c) and Equation (68d) into Equation (68a) and Equation (68b) to obtain
0 = α ( Q i ) p h j = 1 s a ¯ i j P ˙ j , P ˙ i = D α T ( Q i ) Q ˙ i D H ( Q i ) ,
for i = 1 , , s , where for notational convenience we left the Q i ’s as arguments of α , D α T and D H , but we keep in mind they are defined by Equation (68c), so that Equation (75) is a nonlinear system for Q ˙ i and P ˙ i . Let us consider the homotopy
0 = α ( Q i ) p h j = 1 s a ¯ i j P ˙ j ( τ 1 ) p α ( q ) , P ˙ i = D α T ( Q i ) Q ˙ i D H ( Q i ) ( τ 1 ) D H ( q ) ,
for i = 1 , , s . It is easy to see that, for τ = 0 , Equation (76) has the solution Q ˙ i = 0 and P ˙ i = 0 , and, for τ = 1 , it is equivalent to Equation (75). Let us treat Q ˙ i and P ˙ i as functions of τ , and differentiate Equation (76) with respect to this parameter. The resulting ODE system can be written as
{ D α } ( A I n ) d Q ˙ d τ A ¯ I n d P ˙ d τ = 1 h 𝟙 s p α ( q ) ,
d P ˙ d τ = { D α T } + h { B } ( A I n ) d Q ˙ d τ 𝟙 s D H ( q ) ,
where for compactness we introduced the following notations: Q ˙ = ( Q ˙ 1 , , Q ˙ s ) T , similarly for P ˙ ; 𝟙 s = ( 1 , , 1 ) T is the s-dimensional vector of ones; { D α } = { D α } ( Q 1 , , Q s ) , and, similarly, { B } denotes the block diagonal matrix
{ B } = blockdiag B ( Q 1 , Q ˙ 1 ) , , B ( Q s , Q ˙ s )
with B ( Q i , Q ˙ i ) = D 2 α β ( Q i ) Q ˙ i β D 2 H ( Q i ) , where D 2 denotes the Hessian matrix of the respective function, and summation over β is implied. Equation (77) is further simplified if we substitute Equation (77b) into Equation (77a). This way, we obtain an ODE system for the variables Q ˙ of the form
[ ( A ¯ I n ) { D α T } { D α } ( A I n ) + h ( A ¯ I n ) { B } ( A I n ) ] d Q ˙ d τ = ( A ¯ 𝟙 s ) D H ( q ) 1 h 𝟙 s p α ( q ) .
Since α is smooth, we have
{ D α } ( A I n ) i j = a i j D α ( Q i ) = a i j D α ( Q j ) + O ( δ ) = ( A I n ) { D α } i j + O ( δ ) ,
where Q i Q j δ for δ assumed small, but independent of h. Moreover, since α and H are smooth, the term { B } , as a function of Q ˙ , is bounded in a neighborhood of 0. Therefore, we can write Equation (79) as
W ( Q 1 , , Q s ) + O ( δ ) + O ( h ) d Q ˙ d τ = ( A ¯ 𝟙 s ) D H ( q ) 1 h 𝟙 s p α ( q ) .
By Equation (71), for sufficiently small h and δ , the matrix W ( Q 1 , , Q s ) + O ( δ ) + O ( h ) has a bounded inverse, provided that Q 1 , , Q s remain in U. Therefore, Equation (81) with the initial condition Q ˙ ( 0 ) = 0 has a unique solution Q ˙ ( τ ) on a non-empty interval [ 0 , τ ¯ ) , which can be extended until any of the corresponding Q i ( τ ) leaves U. Let us argue that for a sufficiently small h we have τ ¯ > 1 . Given Equations (71) and (73), Equation (81) implies that
d Q ˙ d τ = O ( 1 ) .
Therefore, we have
Q ˙ ( τ ) = 0 τ d Q ˙ d ζ d ζ = O ( τ )
and further
Q i ( τ ) = q + O ( τ h )
for τ < τ ¯ . This implies that all Q i ( τ ) remain in U for τ 1 if h is sufficiently small. Consequently, Equation (79) has a solution on the interval [ 0 , 1 ] . Then, Q ˙ i ( 1 ) and Q i ( 1 ) satisfy the estimates stated in Equation (74), and are a solution to the nonlinear system formed by Equations (68a)–(68d). The corresponding P ˙ i and P i can be computed using Equations (68b) and (68d), and the remaining estimates in Equation (74) can be proved using the fact that α and H are smooth. This completes the proof of the existence of a numerical solution to Equations (68a)–(68d).
To prove local uniqueness, we substitute the second equation of Equation (75) into the first one to obtain a nonlinear system for Q ˙ i , namely
0 = α ( Q i ) p h j = 1 s a ¯ i j D α T ( Q j ) Q ˙ j D H ( Q j ) ,
for i = 1 , , s , where we again left the Q i ’s for notational convenience. Suppose there exists another solution Q ¯ ˙ i that satisfies the estimates stated in Equation (74), and denote Δ Q ˙ i = Q ¯ ˙ i Q ˙ i . Based on the assumptions, we have Δ Q ˙ i = O ( 1 ) , i.e., it is at least bounded as h 0 . We show that for sufficiently small h we in fact have Δ Q ˙ i = 0 . Since Q ¯ ˙ i satisfy Equation (85), we have
0 = α ( Q ¯ i ) p h j = 1 s a ¯ i j D α T ( Q ¯ j ) Q ¯ ˙ j D H ( Q ¯ j )
for i = 1 , , s . Subtract Equation (85) from Equation (86), and linearize around Q ˙ i . Based on the fact that Δ Q ˙ i = O ( 1 ) , and using the notation introduced above, we get
0 = h { D α } ( A I n ) ( A ¯ I n ) { D α T } Δ Q ˙ + O ( h 2 Δ Q ˙ ) .
By a similar argument as above, for sufficiently small h the matrix { D α } ( A I n ) ( A ¯ I n ) { D α T } has a bounded inverse, therefore Equation (87) implies Δ Q ˙ = O ( h Δ Q ˙ ) , that is,
Δ Q ˙ C ˜ h Δ Q ˙ ( 1 C ˜ h ) Δ Q ˙ 0
for some constant C ˜ > 0 . Note that for h < 1 / C ˜ we have ( 1 C ˜ h ) > 0 , and therefore Δ Q ˙ = 0 , which completes the proof of the local uniqueness of a numerical solution to Equations (68a)–(68d). □

4.1.2. Remarks

The condition given in Equation (71) may be tedious to verify, especially if one uses a Runge–Kutta method with many stages. However, this condition is significantly simplified in the following special cases:
  • For a non-partitioned Runge–Kutta method, we have A = A ¯ , and the condition in Equation (71) is satisfied if A is invertible, and the mass matrix M ( q ) = D α T ( q ) D α ( q ) , as defined in Section 2.1, is invertible in U and its inverse is bounded.
  • If D α is antisymmetric, then the condition in Equation (71) is satisfied if ( A + A ¯ ) is invertible, and the matrix D α ( q ) is invertible in U and its inverse is bounded.

4.2. Linear α μ ( q )

An interesting special case is obtained if we have, in some local chart on Q, α μ ( q ) = 1 2 Λ μ ν q ν for some constant matrix Λ . Without loss of generality assume that Λ is invertible and antisymmetric. The Lagrangian given in Equation (2) then takes the form
L ( q , q ˙ ) = 1 2 Λ μ ν q ˙ μ q ν H ( q ) ,
the Euler–Lagrange Equation (8) becomes
Λ q ˙ = D H ( q ) ,
and the “Hamiltonian” DAE system in Equation (10) is
p = 1 2 Λ q , p ˙ = 1 2 Λ q ˙ D H ( q ) .
Let us consider a special case of the method defined by Equation (68) with a i j = a ¯ i j , i.e., a non-partitioned Runge–Kutta method. Applying it to Equation (91), we get
P i = 1 2 Λ Q i , i = 1 , , s ,
P ˙ i = 1 2 Λ Q ˙ i D H ( Q i ) , i = 1 , , s ,
Q i = q + h j = 1 s a i j Q ˙ j , i = 1 , , s ,
P i = p + h j = 1 s a i j P ˙ j , i = 1 , , s ,
q ¯ = q + h j = 1 s b j Q ˙ j ,
p ¯ = p + h j = 1 s b j P ˙ j .
Since Λ is antisymmetric and invertible, by Theorem 2, this scheme yields a unique numerical solution to Equation (91) if the Runge–Kutta matrix A = ( a i j ) is invertible.
Theorem 3.
Suppose A = ( a i j ) is invertible and p = 1 2 Λ q . Then, the method defined in Equation (92) is equivalent to the same Runge–Kutta method applied to Equation (90).
Proof. 
Substitute Equations (92c) and (92d) into Equation (92a), and use the fact p = 1 2 Λ q to obtain
j = 1 s a i j P ˙ j + 1 2 Λ Q ˙ j = 0 , i = 1 , , s .
Since A is invertible, this implies
P ˙ i = 1 2 Λ Q ˙ i , i = 1 , , s .
Substituting this into Equation (92b) yields
Λ Q ˙ i = D H ( Q i ) , i = 1 , , s .
Together with Equations (92c) and (92e), this gives a Runge–Kutta method for Equation (90). Moreover, substituting Equation (94) and p = 1 2 Λ q into Equation (92f), and using Equation (92e), one has
p ¯ = 1 2 Λ q + h j = 1 s b j 1 2 Λ Q ˙ j = 1 2 Λ q ¯ ,
that is, ( q ¯ , p ¯ ) satisfy the algebraic constraint. □
Corollary 1.
The numerical flow on T * Q defined by Equation (92) leaves the primary constraint N invariant, i.e., if ( q , p ) N , then ( q ¯ , p ¯ ) N .
If the coefficients of the method defined in Equation (92) satisfy the condition in Equation (69), then Equation (92) is a variational integrator and the associated discrete Hamiltonian map F ˜ L d is symplectic on T * Q , as explained in Section 3.1. Given Corollary 1, we further have:
Corollary 2.
If the coefficients a i j and b i in Equation (92) satisfy the condition stated in Equation (69), then the discrete Hamiltonian map F ˜ L d associated with Equation (65) is symplectic on the primary constraint N, that is, F ˜ L d | N * Ω ˜ N = Ω ˜ N .

4.2.1. Convergence

Various Runge–Kutta methods and their classical orders of convergence, that is, orders of convergence when applied to (non-stiff) ordinary differential equations, are discussed in many textbooks on numerical analysis, for instance [41,44]. When applied to differential-algebraic equations, the order of convergence of a Runge–Kutta method may be reduced (see [41,43,46]). However, in the case of Equation (91) Theorem 3 implies that the classical order of convergence of non-partitioned Runge–Kutta methods defined by Equation (92) is retained.
Theorem 4.
A Runge–Kutta method with the coefficients a i j and b i applied to the DAE system in Equation (91) retains its classical order of convergence.
Proof. 
Let r be the classical order of the considered Runge–Kutta method, ( q , p ) N an initial condition, ( q E ( t ) , p E ( t ) ) the exact solution to Equation (91) such that ( q E ( 0 ) , p E ( 0 ) ) = ( q , p ) , and ( q k , p k ) the numerical solution obtained by applying the method given in Equation (92) iteratively k times with ( q 0 , p 0 ) = ( q , p ) . Theorem 3 states that the method given in Equation (92) is equivalent to applying the same Runge–Kutta method to the ODE system in Equation (90). Hence, we obtain convergence of order r in the q variable, that is, for a fixed time T > 0 and an integer K such that h = T / K , we have the estimate
q K q ( T ) C h r + 1
for some constant C > 0 (cf. Definition 4). By Corollary 1, we know that p K = 1 2 Λ q K , thus we have the estimate
p K p ( T ) 1 2 Λ q K q ( T ) 1 2 Λ C h r + 1 ,
which completes the proof, since Λ < + . □
Of particular interest to us are Runge–Kutta methods that satisfy the condition stated in Equation (69), for instance symplectic diagonally-implicit Runge–Kutta methods (DIRK) or Gauss collocation methods (see [1]). The s-stage Gauss method is of classical order 2 s , therefore we have:
Corollary 3.
The s-stage Gauss collocation method applied to the DAE system in Equation (91) is convergent of order 2 s .
As mentioned in Section 3.6, the midpoint rule is a 1-stage Gauss method, therefore it retains its classical second order of convergence.

4.2.2. Backward Error Analysis

Equation (90) can be rewritten as the Poisson system
q ˙ = Λ 1 D H ( q )
with the structure matrix Λ 1 (see [1,26]). The flow φ t for this equation is a Poisson map, that is, it satisfies the property
D φ t ( q ) Λ 1 [ D φ t ( q ) ] T = Λ 1 ,
which is in fact equivalent to the symplecticity property stated in Equation (23) or Equation (27) written in local coordinates on Q or N, respectively. Let F h : Q Q represent the numerical flow defined by some numerical algorithm applied to Equation (99). We say this flow is a Poisson integrator if
D F h ( q ) Λ 1 [ D F h ( q ) ] T = Λ 1 .
The left-hand side of Equation (100) can be regarded as a quadratic invariant of Equation (99). By Theorem 3, the method given in Equation (92) is equivalent to applying the same Runge–Kutta method to Equation (99). If its coefficients also satisfy the condition in Equation (69), then it can be shown that the method preserves quadratic invariants (see Theorem IV.2.2 in [1]). Therefore, we have:
Corollary 4.
If A = ( a i j ) is invertible, the coefficients a i j and b i satisfy the condition stated in Equation (69), and p = 1 2 Λ q , then the method defined by Equation (92) is a Poisson integrator for Equation (99).
The true power of symplectic integrators for Hamiltonian equations is revealed through their backward error analysis: a symplectic integrator for a Hamiltonian system with the Hamiltonian H ( q , p ) defines the exact flow for a nearby Hamiltonian system, whose Hamiltonian can be expressed as the asymptotic series
H ˜ ( q , p ) = H ( q , p ) + h H 2 ( q , p ) + h 2 H 3 ( q , p ) +
Owing to this fact, under some additional assumptions, symplectic numerical schemes nearly conserve the original Hamiltonian H ( q , p ) over exponentially long time intervals (see [1] for details). A similar result holds for Poisson integrators for Poisson systems: a Poisson integrator defines the exact flow for a nearby Poisson system, whose structure matrix is the same and whose Hamiltonian has the asymptotic expansion as in Equation (102) (see Theorem IX.3.6 in [1]). Therefore, if the condition in Equation (69) is satisfied, we expect the non-partitioned Runge–Kutta schemes defined by Equation (92) to demonstrate good preservation of the original Hamiltonian H. See Section 5 for numerical examples.
Partitioned Runge–Kutta methods do not seem to have special properties when applied to systems with linear α μ ( q ) , therefore we describe them in the general case next.

4.3. Nonlinear α μ ( q )

When the coordinates α μ ( q ) are nonlinear functions of q, then the Runge–Kutta methods discussed in Section 4.2 lose some of their properties: a theorem similar to Theorem 3 cannot be proved, most of the Runge–Kutta methods (whether non-partitioned or partitioned) do not preserve the algebraic constraint p = α ( q ) , i.e., the numerical solution does not stay on the primary constraint N, and therefore their order of convergence is reduced, unless they are stiffly accurate.

4.3.1. Runge–Kutta Methods

Let us again consider non-partitioned methods with a i j = a ¯ i j . Convergence results for some classical Runge–Kutta schemes of interest can be obtained by transforming Equation (10) into a semi-explicit index-2 DAE system. Let us briefly review this approach. More details can be found in [41,45].
Equation (10) can be written as the quasi-linear DAE
C ( y ) y ˙ = f ( y ) ,
where y = ( q , p ) and
C ( y ) = [ D α ( q ) ] T I n 0 0 , f ( y ) = D H ( q ) p α ( q ) ,
where I n denotes the n × n identity matrix. Let us introduce a slack variable z and rewrite Equation (103) as the index-2 DAE system
y ˙ = z ,
0 = C ( y ) z f ( y ) .
This system is of index 2, because it has 4 n dependent variables, but only 2 n differential equations (Equation (105a)), and some components of the algebraic equations (Equation (105b)) have to be differentiated twice with respect to time in order to derive the missing differential equations for z. Note that C ( y ) is a singular matrix of constant rank n, therefore it can be decomposed (using Gauss elimination or the singular value decomposition) as
C ( y ) = S ( y ) I n 0 0 0 T ( y )
for some non-singular matrices S ( y ) and T ( y ) . Since α ( q ) is assumed to be smooth, one can choose S and T so that they are also smooth (at least in a neighborhood of y). Premultiplying both sides of Equation (105b) by S 1 ( y ) turns Equation (105) into
y ˙ 1 = z 1 ,
y ˙ 2 = z 2 ,
0 = T 11 ( y ) z 1 + T 12 ( y ) z 2 f ˜ 1 ( y ) ,
0 = f ˜ 2 ( y ) ,
where we introduce the block structure y = ( y 1 , y 2 ) , z = ( z 1 , z 2 ) , and
T ( y ) = T 11 T 12 T 21 T 22 , S 1 ( y ) f ( y ) = f ˜ 1 ( y ) f ˜ 2 ( y ) .
Since T ( y ) is invertible, we can assume without loss of generality that the block T 11 ( y ) is invertible, too (one can always permute the columns of T ( y ) otherwise). Let us compute z 1 from Equation (107c) and substitute it into Equation (107a). The resulting system,
y ˙ 1 = T 11 ( y ) 1 f ˜ 1 ( y ) T 12 ( y ) z 2 ,
y ˙ 2 = z 2 ,
0 = f ˜ 2 ( y ) ,
has the form of a semi-explicit index-2 DAE
y ˙ = F ( y , z 2 ) , 0 = G ( y ) ,
provided that
D y G D z 2 F = D y 1 f ˜ 2 T 11 1 T 12 + D y 2 f ˜ 2
has a bounded inverse.
It is an elementary exercise to show that the partitioned Runge–Kutta method defined by Equation (68) is invariant under the presented transformation, that is, it defines a numerically equivalent partitioned Runge–Kutta method for Equation (109). Runge–Kutta methods for semi-explicit index-2 DAEs have been studied and some convergence results are available. Convergence estimates for the y component of Equation (109) can be readily applied to the solution of Equation (103).
As in Section 4.2, of particular interest to us are variational Runge–Kutta methods, i.e., methods satisfying the condition stated in Equation (69), for example Gauss collocation methods (see [1,44]). However, in the case when α ( q ) is a nonlinear function, the solution generated by the Gauss methods does not stay on the primary constraint N and this affects their rate of convergence, as will be shown below. For comparison, we will also consider the Radau IIA methods (see [41]), which, although not variational/symplectic, are stiffly accurate, that is, their coefficients satisfy a s j = b j for j = 1 , , s , so the numerical value of the solution at the new time step is equal to the value of the last internal stage, and therefore the numerical solution stays on the submanifold N. We cite the following convergence rates for the y component of Equation (110) after [41,45]:
  • s-stage Gauss method—convergent of order s + 1 for s odd s for s even ; and
  • s-stage Radau IIA method—convergent of order 2 s 1 .
With the exception of the midpoint rule ( s = 1 ), we see that the order of convergence of the Gauss methods is reduced. On the other hand, the Radau IIA methods retain their classical order 2 s 1 .
Symplecticity. Since the Gauss methods satisfy the condition in Equation (69), they generate a flow which preserves the canonical symplectic form Ω ˜ on T * Q , as explained in Section 3.1. However, since the primary constraint N is not invariant under this flow, a result analogous to Corollary 2 does not hold, i.e., the flow is not symplectic on N.

4.3.2. Partitioned Runge–Kutta Methods

In Section 5, we present numerical results for the Lobatto IIIA-IIIB methods (see [1]). Their numerical performance appears rather unattractive, therefore our theoretical results regarding partitioned Runge–Kutta methods are less complete. Below, we summarize the experimental orders of convergence of the Lobatto IIIA-IIIB schemes that we observed in our numerical computations (see Figures 2, 6 and 10):
  • 2-stage Lobatto IIIA-IIIB—inconsistent;
  • 3-stage Lobatto IIIA-IIIB—convergent of order 2; and
  • 4-stage Lobatto IIIA-IIIB—convergent of order 2.
Comments regarding the symplecticity of these schemes are the same as for the Gauss methods mentioned above in Section 4.3.1.

5. Numerical Experiments

In this section, we present the results of the numerical experiments we performed to test the methods discussed in Section 4. We consider Kepler’s problem, the dynamics of planar point vortices, and the Lotka–Volterra model, and we show how each of these models can be formulated as a Lagrangian system linear in velocities.

5.1. Kepler’s Problem

A particle or a planet moving in a central potential in two dimensions can be described by the Hamiltonian
H ( x , y , p x , p y ) = 1 2 p x 2 + 1 2 p x 2 1 x 2 + y 2 H 0 ,
where ( x , y ) denotes the position of the planet and ( p x , p y ) its momentum. H 0 is an arbitrary constant. The corresponding Lagrangian can be obtained in the usual way as
L = p x x ˙ + p y y ˙ H ( x , y , p x , p y ) .
If one performs the standard Legendre transform x ˙ = H / p x , y ˙ = H / p y , then L = L ( x , y , x ˙ , y ˙ ) will take the usual nondegenerate form, quadratic in velocities. However, one can also introduce the variable q = ( x , y , p x , p y ) and view L = L ( q , q ˙ ) as in Equation (2), that is, a Lagrangian linear in velocities (see [47]). Comparing Equation (113) and Equation (89), we see that the corresponding Λ is singular. Without loss of generality we replace Λ with its antisymmetric part ( Λ Λ T ) / 2 , which is invertible, and consider the Lagrangian
L = 1 2 q 3 q ˙ 1 + 1 2 q 4 q ˙ 2 1 2 q 1 q ˙ 3 1 2 q 2 q ˙ 4 H ( q ) .
As a test problem, we considered an elliptic orbit with eccentricity e = 0.5 and semi-major axis a = 1 . We took the initial condition at the pericenter, i.e., q i n i t 1 = ( 1 e ) a = 0.5 , q i n i t 2 = 0 , q i n i t 3 = 0 , q i n i t 4 = a ( 1 + e ) / ( 1 e ) 1.73 . This is a periodic orbit with period T p e r i o d = 2 π . A reference solution was computed by integrating Equation (90) until the time T = 7 using Verner’s method (a sixth-order explicit Runge–Kutta method; see [44]) with the small time step h = 2 × 10 7 . The reference solution is depicted in Figure 1.
We solved the same problem using several of the methods discussed in Section 4 for a number of time steps ranging from h = 3.5 × 10 3 to h = 3.5 × 10 1 . The value of the solutions at T = 7 was then compared against the reference solution. The max norm errors are depicted in Figure 2. We see that the rates of convergence of the Gauss and the 3-stage Radau IIA methods are consistent with Theorem 4 and Corollary 3. For the Lobatto IIIA-IIIB methods, we observe a reduction of order. The 2-stage Lobatto IIIA-IIIB method turns out to be inconsistent and is not depicted in Figure 2. Both the 3- and 4-stage methods converge only quadratically, while their classical orders of convergence are 4 and 6, respectively.
We also investigated the long-time behavior of our integrators and conservation of the Hamiltonian. For convenience, we set H 0 = 0.5 in Equation (112), so that H = 0 on the considered orbit. We applied the Gauss methods with the relatively large time step h = 0.1 and computed the numerical solution until the time T = 5 × 10 5 . Figure 3 shows that the Gauss integrators preserve the Hamiltonian very well, which is consistent with Corollary 4. We performed similar computations for the Lobatto IIIA-IIIB and Radau IIA methods, also with h = 0.1 . The results are depicted in Figure 4. The 3- and 4-stage Lobatto IIIA-IIIB schemes result in instabilities, the planet’s trajectory spirals down on the center of gravity, and the computations cannot be continued too far in time. The Hamiltonian shows major variations whose amplitude grows in time. The non-variational Radau IIA scheme yields an accurate solution, but it demonstrates a gradual energy dissipation.

5.2. Point Vortices

Point vortices in the plane are another interesting example of a system with linear α μ ( q ) (see [17,18,27]). A system of K interacting point vortices in two dimensions can be described by the Lagrangian
L ( x 1 , y 1 , , x K , y K , x ˙ 1 , y ˙ 1 , , x ˙ K , y ˙ K ) = 1 2 i = 1 K Γ i ( x i y ˙ i y i x ˙ i ) H ( x 1 , y 1 , , x K , y K )
with the Hamiltonian
H ( x 1 , y 1 , , x K , y K ) = 1 4 π i < j K Γ i Γ j log ( x i x j ) 2 + ( y i y j ) 2 H 0 ,
where ( x i , y i ) denotes the location of the i-th vortex, Γ i is its circulation, and H 0 is an arbitrary constant.
As a test problem, we considered the system of K = 2 vortices with circulations Γ 1 = 4 and Γ 2 = 2 , respectively, and distance D = 1 between them. The vortices rotate on concentric circles about their center of vorticity at x C = 0 and y C = 0 . We took the initial condition at x 1 ( 0 ) = Γ 2 D / ( Γ 1 + Γ 2 ) 0.33 , y 1 ( 0 ) = 0 , x 2 ( 0 ) = Γ 1 D / ( Γ 1 + Γ 2 ) 0.67 and y 2 ( 0 ) = 0 . The analytic solution can be found (see [27]) as
x 1 ( t ) = Γ 2 Γ 1 + Γ 2 D cos ω t , x 2 ( t ) = Γ 1 Γ 1 + Γ 2 D cos ω t , y 1 ( t ) = Γ 2 Γ 1 + Γ 2 D sin ω t , y 2 ( t ) = Γ 1 Γ 1 + Γ 2 D sin ω t ,
where ω = ( Γ 1 + Γ 2 ) / ( 2 π D 2 ) . This is a periodic solution with period T p e r i o d 6.58 (see Figure 5).
We performed similar convergence tests as presented in Section 5.1. The value of the numerical solutions at time T = 7 were compared against the exact solution given in Equation (117). The max norm errors are depicted in Figure 6. The results are qualitatively the same as for Kepler’s problem.
We set H 0 = 0 in Equation (116), so that H = 0 for the considered solution. Figure 7 and Figure 8 show the behavior of the numerical Hamiltonian over a long integration interval. The 3- and 4-stage Lobatto IIIA-IIIB integrators performed better than for Kepler’s problem. In the case of the Gauss methods, the Hamiltonian stayed virtually constant—the visible minor erratic oscillations are the result of round-off errors. The Radau IIA scheme demonstrated a slow but systematic drift.

5.3. Lotka–Volterra Model

The dynamics of the growth of two interacting (predator/prey) species can be modeled by the Lotka–Volterra equations
u ˙ = u ( v 2 ) , v ˙ = v ( 1 u ) ,
where u ( t ) denotes the number of predators and v ( t ) the number of prey, and constants 1 and 2 were chosen arbitrarily. These equations can be rewritten as the Poisson system
u ˙ v ˙ = 0 u v u v 0 D H ( u , v ) ,
where the Hamiltonian is given by
H ( u , v ) = u log u + v 2 log v H 0
with an arbitrary constant H 0 (see [1]). Using an approach similar to the one presented in Section 5.1, one can easily verify that the Lagrangian
L ( q , q ˙ ) = log q 2 q 1 + q 2 q ˙ 1 + q 1 q ˙ 2 H ( q )
reproduces the same equations of motion, where q = ( u , v ) . The coordinates α μ ( q ) (cf. Equation (2)) were chosen, so that the assumptions of Theorem 2 are satisfied for the considered Runge–Kutta methods.
As a test problem, we considered the solution with the initial condition q i n i t 1 = 1 and q i n i t 2 = 1 (note that q = ( 1 , 2 ) is an equilibrium point). This is a periodic solution with period T p e r i o d 4.66 . A reference solution was computed by integrating Equation (90) until the time T = 5 using Verner’s method with the small time step h = 10 7 . The reference solution is depicted in Figure 9.
Convergence plots are shown in Figure 10. The convergence rates for the Gauss and Radau IIA methods are consistent with the theoretical results presented in Section 4.3.1—we see that the orders of the 2- and 3-stage Gauss schemes are reduced. The 2-stage Lobatto IIIA-IIIB scheme again proves to be inconsistent, and the 3- and 4-stage schemes converge quadratically, just as in Section 5.1 and Section 5.2.
We performed another series of numerical experiments with the time step h = 0.1 to investigate the long time behavior of the considered integrators. The results are shown in Figure 11 and Figure 12. We set H 0 = 2 in Equation (120), so that H = 0 for the considered solution. The 1- and 3-stage Gauss methods again show excellent Hamiltonian conservation over a long time interval. The 2-stage Gauss method, however, does not perform equally well—the Hamiltonian oscillates with an increasing amplitude over time, until the computations finally break down. The Lobatto IIIA-IIIB methods show similar problems as in Section 5.1. The non-variational Radau IIA method yields an accurate solution, but demonstrates a steady drift in the Hamiltonian.

6. Summary

We analyze a class of degenerate systems described by Lagrangians that are linear in velocities, and present a way to construct appropriate higher-order variational integrators. We point out how the theory underlying variational integration is different from the non-degenerate case and we made a connection with numerical integration of differential-algebraic equations. We also perform numerical experiments for several example models.
Our work can be extended in several ways. In Section 5.3, we present our numerical results for the Lotka–Volterra model, which is an example of a system for which the coordinate functions α μ ( q ) are nonlinear. The 1- and 3-stage Gauss methods perform exceptionally well and preserve the Hamiltonian over a very long integration time. It would be interesting to perform a backward error (or similar) analysis to check if this behavior is generic. If confirmed, our variational approach could provide a new way to construct geometric integrators for a broader class of Poisson systems. The study of modified Lagrangians recently presented in [48] is the first step towards a rigorous backward error analysis for the variational integrators considered in our work.
Another idea worth exploring is a construction of variational integrators that exactly satisfy the primary constraint. Certain advances in that direction were made in [49] by applying projection methods.
It would also be interesting to further consider constrained systems with Lagrangians that are linear in velocities and construct associated higher-order variational integrators. This would allow generalizing the space-adaptive methods presented in [24,50] to degenerate field theories, such as the nonlinear Schrödinger, KdV or Camassa–Holm equations.

Author Contributions

Our contributions were equally balanced in a true collaboration.

Funding

Early and partial funding was provided by NSF grant CCF-1011944.

Acknowledgments

We would like to thank Ernst Hairer and Joris Vankerschaver for useful comments and references. M.D. also acknowledges ShanghaiTech University, where he edited the final version of this paper.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Hairer, E.; Lubich, C.; Wanner, G. Geometric Numerical Integration: Structure-Preserving Algorithms for Ordinary Differential Equations; Springer Series in Computational Mathematics; Springer: New York, NY, USA, 2002. [Google Scholar]
  2. McLachlan, R.I.; Quispel, G.R.W. Geometric integrators for ODEs. J. Phys. A Math. Gen. 2006, 39, 5251–5285. [Google Scholar] [CrossRef] [Green Version]
  3. Sanz-Serna, J.M. Symplectic integrators for Hamiltonian problems: an overview. Acta Numer. 1992, 1, 243–286. [Google Scholar] [CrossRef]
  4. Marsden, J.E.; West, M. Discrete mechanics and variational integrators. Acta Numer. 2001, 10, 357–514. [Google Scholar] [CrossRef] [Green Version]
  5. Bou-Rabee, N.; Owhadi, H. Stochastic variational integrators. IMA J. Numer. Anal. 2009, 29, 421–443. [Google Scholar] [CrossRef]
  6. Bou-Rabee, N.; Owhadi, H. Stochastic Variational Partitioned Runge-Kutta Integrators for Constrained Systems. arXiv 2007, arXiv:0709.2222. [Google Scholar]
  7. Kraus, M.; Tyranowski, T.M. Variational integrators for stochastic dissipative Hamiltonian systems. arXiv 2019, arXiv:1904.06205. [Google Scholar]
  8. Hall, J.; Leok, M. Spectral Variational Integrators. Numer. Math. 2015, 130, 681–740. [Google Scholar] [CrossRef]
  9. Holm, D.D.; Tyranowski, T.M. Variational principles for stochastic soliton dynamics. Proc. R. Soc. Lond. A Math. Phys. Eng. Sci. 2016, 472. [Google Scholar] [CrossRef]
  10. Holm, D.D.; Tyranowski, T.M. Stochastic discrete Hamiltonian variational integrators. BIT Numer. Math. 2018, 58, 1009–1048. [Google Scholar] [CrossRef] [Green Version]
  11. Jay, L.O. Structure Preservation for Constrained Dynamics with Super Partitioned Additive Runge–Kutta Methods. SIAM J. Sci. Comput. 1998, 20, 416–446. [Google Scholar]
  12. Kane, C.; Marsden, J.E.; Ortiz, M.; West, M. Variational integrators and the Newmark algorithm for conservative and dissipative mechanical systems. Int. J. Numer. Methods Eng. 2000, 49, 1295–1325. [Google Scholar] [CrossRef]
  13. Leok, M.; Shingel, T. General techniques for constructing variational integrators. Front. Math. China 2012, 7, 273–303. [Google Scholar] [CrossRef] [Green Version]
  14. Leok, M.; Zhang, J. Discrete Hamiltonian variational integrators. IMA J. Numer. Anal. 2011, 31, 1497–1532. [Google Scholar] [CrossRef]
  15. Ober-Blöbaum, S. Galerkin variational integrators and modified symplectic Runge-Kutta methods. IMA J. Numer. Anal. 2017, 37, 375–406. [Google Scholar] [CrossRef]
  16. Ober-Blöbaum, S.; Saake, N. Construction and analysis of higher order Galerkin variational integrators. Adv. Comput. Math. 2015, 41, 955–986. [Google Scholar] [CrossRef]
  17. Rowley, C.W.; Marsden, J.E. Variational integrators for degenerate Lagrangians, with application to point vortices. In Proceedings of the 41st IEEE Conference on Decision and Control, Las Vegas, NV, USA, 10–13 December 2002; Volume 2, pp. 1521–1527. [Google Scholar]
  18. Vankerschaver, J.; Leok, M. A novel formulation of point vortex dynamics on the sphere: Geometrical and numerical aspects. J. Nonlin. Sci. 2014, 24, 1–37. [Google Scholar] [CrossRef]
  19. Marsden, J.E.; Patrick, G.W.; Shkoller, S. Multisymplectic geometry, variational integrators, and nonlinear PDEs. Commun. Math. Phys. 1998, 199, 351–395. [Google Scholar] [CrossRef]
  20. Holm, D.D.; Tyranowski, T.M. New variational and multisymplectic formulations of the Euler–Poincaré equation on the Virasoro–Bott group using the inverse map. Proc. R. Soc. Lond. A Math. Phys. Eng. Sci. 2018, 474. [Google Scholar] [CrossRef] [PubMed]
  21. Lew, A.; Marsden, J.E.; Ortiz, M.; West, M. Asynchronous variational integrators. Arch. Ration. Mech. Anal. 2003, 167, 85–146. [Google Scholar] [CrossRef]
  22. Pavlov, D.; Mullen, P.; Tong, Y.; Kanso, E.; Marsden, J.E.; Desbrun, M. Structure-preserving discretization of incompressible fluids. Phys. D Nonlinear Phenom. 2011, 240, 443–458. [Google Scholar] [CrossRef] [Green Version]
  23. Stern, A.; Tong, Y.; Desbrun, M.; Marsden, J.E. Variational integrators for Maxwell’s equations with sources. PIERS Online 2008, 4, 711–715. [Google Scholar] [CrossRef]
  24. Tyranowski, T.M.; Desbrun, M. R-Adaptive Multisymplectic and Variational Integrators. Mathematics 2019, 7, 642. [Google Scholar] [CrossRef]
  25. Gotay, M. Presymplectic Manifolds, Geometric Constraint Theory and the Dirac-Bergmann Theory of Constraints. Ph.D. Thesis, University of Maryland, College Park, MD, USA, 1979. [Google Scholar]
  26. Marsden, J.; Ratiu, T. Introduction to Mechanics and Symmetry. Texts in Applied Mathematics; Springer: New York, NY, USA, 1994; Volume 17. [Google Scholar]
  27. Newton, P. The N-Vortex Problem: Analytical Techniques; Applied Mathematical Sciences; Springer: New York, NY, USA, 2001; Volume 145. [Google Scholar]
  28. Ellison, C.L.; Finn, J.M.; Qin, H.; Tang, W.M. Development of variational guiding center algorithms for parallel calculations in experimental magnetic equilibria. Plasma Phys. Control. Fusion 2015, 57, 054007. [Google Scholar] [CrossRef]
  29. Ellison, C.L. Development of Multistep and Degenerate Variational Integrators for Applications in Plasma Physics. Ph.D. Thesis, Princeton University, Princeton, NJ, USA, 2016. [Google Scholar]
  30. Ellison, C.L.; Finn, J.M.; Burby, J.W.; Kraus, M.; Qin, H.; Tang, W.M. Degenerate variational integrators for magnetic field line flow and guiding center trajectories. Phys. Plasmas 2018, 25, 052502. [Google Scholar] [CrossRef] [Green Version]
  31. Qin, H.; Guan, X. Variational Symplectic Integrator for Long-Time Simulations of the Guiding-Center Motion of Charged Particles in General Magnetic Fields. Phys. Rev. Lett. 2008, 100, 035006. [Google Scholar] [CrossRef] [PubMed] [Green Version]
  32. Qin, H.; Guan, X.; Tang, W.M. Variational symplectic algorithm for guiding center dynamics and its application in tokamak geometry. Phys. Plasmas 2009, 16, 042510. [Google Scholar] [CrossRef]
  33. Faou, E. Geometric Numerical Integration and Schrödinger Equations; Zurich Lectures in Advanced Mathematics; European Mathematical Society: Zürich, Switzerland, 2012. [Google Scholar]
  34. Drazin, P.; Johnson, R. Solitons: An Introduction; Cambridge Computer Science Texts; Cambridge University Press: Cambridge, UK, 1989. [Google Scholar]
  35. Gotay, M. A multisymplectic approach to the KdV equation. In Differential Geometric Methods in Theoretical Physics; NATO Advanced Science Institutes Series C: Mathematical and Physical Sciences; Springer: Dordrecht, The Netherlands, 1988; Volume 250, pp. 295–305. [Google Scholar]
  36. Camassa, R.; Holm, D.D. An integrable shallow water equation with peaked solitons. Phys. Rev. Lett. 1993, 71, 1661–1664. [Google Scholar] [CrossRef] [PubMed] [Green Version]
  37. Camassa, R.; Holm, D.D.; Hyman, J. A new integrable shallow water equation. Adv. App. Mech. 1994, 31, 1–31. [Google Scholar]
  38. Ergenç, T.; Karasözen, B. Poisson integrators for Volterra lattice equations. Appl. Numer. Math. 2006, 56, 879–887. [Google Scholar] [CrossRef] [Green Version]
  39. Karasözen, B. Poisson integrators. Math. Comput. Model. 2004, 40, 1225–1244. [Google Scholar] [CrossRef]
  40. Suris, Y.B. Integrable discretizations for lattice system: local equations of motion and their Hamiltonian properties. Rev. Math. Phys. 1999, 11, 727–822. [Google Scholar] [CrossRef]
  41. Hairer, E.; Wanner, G. Solving Ordinary Differential Equations II: Stiff and Differential-Algebraic Problems, 2nd ed.; Springer Series in Computational Mathematics; Springer: Berlin, Gremany, 1996; Volume 14. [Google Scholar]
  42. Lubich, C. Integration of stiff mechanical systems by Runge-Kutta methods. Zeitschrift für Angewandte Mathematik und Physik ZAMP 1993, 44, 1022–1053. [Google Scholar] [CrossRef] [Green Version]
  43. Rabier, P.J.; Rheinboldt, W.C. Theoretical and Numerical Analysis of Differential-Algebraic Equations. In Handbook of Numerical Analysis; Ciarlet, P.G., Lion, J.L., Eds.; Elsevier Science B.V.: Amsterdam, The Netherlands, 2002; Volume 8, pp. 183–540. [Google Scholar]
  44. Hairer, E.; Nørsett, S.; Wanner, G. Solving Ordinary Differential Equations I: Nonstiff Problems, 2nd ed.; Springer Series in Computational Mathematics; Springer: Berlin, Germany, 1993; Volume 8. [Google Scholar]
  45. Hairer, E.; Lubich, C.; Roche, M. The Numerical Solution of Differential-algebraic Systems by Runge-Kutta Methods; Lecture Notes in Math. 1409; Springer: Berlin, Germany, 1989. [Google Scholar]
  46. Brenan, K.; Campbell, S.; Petzold, L. Numerical Solution of Initial-Value Problems in Differential-Algebraic Equations; Classics in Applied Mathematics; Society for Industrial and Applied Mathematics: Philadelphia, PA, USA, 1996. [Google Scholar]
  47. Faddeev, L.; Jackiw, R. Hamiltonian reduction of unconstrained and constrained systems. Phys. Rev. Lett. 1988, 60, 1692–1694. [Google Scholar] [CrossRef] [PubMed]
  48. Vermeeren, M. Modified equations for variational integrators applied to Lagrangians linear in velocities. J. Geom. Mech. 2019, 11, 1–22. [Google Scholar] [CrossRef] [Green Version]
  49. Kraus, M. Projected Variational Integrators for Degenerate Lagrangian Systems. arXiv 2017, arXiv:1708.07356. [Google Scholar]
  50. Tyranowski, T.M. Geometric Integration Applied to Moving Mesh Methods and Degenerate Lagrangians. Ph.D. Thesis, California Institute of Technology, Pasadena, CA, USA, 2014. [Google Scholar]
Figure 1. The reference solution for Kepler’s problem computed by integrating Equation (90) until the time T = 7 using Verner’s method with the time step h = 2 × 10 7 .
Figure 1. The reference solution for Kepler’s problem computed by integrating Equation (90) until the time T = 7 using Verner’s method with the time step h = 2 × 10 7 .
Mathematics 07 00861 g001
Figure 2. Convergence of several Runge–Kutta methods for Kepler’s problem.
Figure 2. Convergence of several Runge–Kutta methods for Kepler’s problem.
Mathematics 07 00861 g002
Figure 3. Hamiltonian conservation for the 1-stage (top row), 2-stage (middle row) and 3-stage (bottom row) Gauss methods applied to Kepler’s problem with the time step h = 0.1 over the time interval [ 0 , 5 × 10 5 ] (right column), with a close-up on the initial interval [ 0 , 150 ] shown in (left column).
Figure 3. Hamiltonian conservation for the 1-stage (top row), 2-stage (middle row) and 3-stage (bottom row) Gauss methods applied to Kepler’s problem with the time step h = 0.1 over the time interval [ 0 , 5 × 10 5 ] (right column), with a close-up on the initial interval [ 0 , 150 ] shown in (left column).
Mathematics 07 00861 g003
Figure 4. Hamiltonian for the numerical solution of Kepler’s problem obtained with the 3- and 4-stage Lobatto IIIA-IIIB schemes (top,middle), respectively, and the non-variational Radau IIA method (bottom).
Figure 4. Hamiltonian for the numerical solution of Kepler’s problem obtained with the 3- and 4-stage Lobatto IIIA-IIIB schemes (top,middle), respectively, and the non-variational Radau IIA method (bottom).
Mathematics 07 00861 g004
Figure 5. The circular trajectories of the two point vortices rotating about their vorticity center at x C = 0 and y C = 0 .
Figure 5. The circular trajectories of the two point vortices rotating about their vorticity center at x C = 0 and y C = 0 .
Mathematics 07 00861 g005
Figure 6. Convergence of several Runge–Kutta methods for the system of two point vortices.
Figure 6. Convergence of several Runge–Kutta methods for the system of two point vortices.
Mathematics 07 00861 g006
Figure 7. Hamiltonian for the 1-stage (top), 2-stage (second) and 3-stage (third) Gauss, and the 3-stage Radau IIA (bottom) methods applied to the system of two point vortices with the time step h = 0.1 over the time interval [ 0 , 5 × 10 5 ] .
Figure 7. Hamiltonian for the 1-stage (top), 2-stage (second) and 3-stage (third) Gauss, and the 3-stage Radau IIA (bottom) methods applied to the system of two point vortices with the time step h = 0.1 over the time interval [ 0 , 5 × 10 5 ] .
Mathematics 07 00861 g007
Figure 8. Hamiltonian conservation for the 3-stage (top) and 4-stage (bottom) Lobatto IIIA-IIIB methods applied to the system of two point vortices with the time step h = 0.1 over the time interval [ 0 , 5 × 10 5 ] (right column), with a close-up on the initial interval [ 0 , 50 ] shown in (left column).
Figure 8. Hamiltonian conservation for the 3-stage (top) and 4-stage (bottom) Lobatto IIIA-IIIB methods applied to the system of two point vortices with the time step h = 0.1 over the time interval [ 0 , 5 × 10 5 ] (right column), with a close-up on the initial interval [ 0 , 50 ] shown in (left column).
Mathematics 07 00861 g008
Figure 9. The reference solution for the Lotka–Volterra equations computed by integrating Equation (90) until the time T = 5 using Verner’s method with the time step h = 10 7 .
Figure 9. The reference solution for the Lotka–Volterra equations computed by integrating Equation (90) until the time T = 5 using Verner’s method with the time step h = 10 7 .
Mathematics 07 00861 g009
Figure 10. Convergence of several Runge–Kutta methods for the Lotka–Volterra model.
Figure 10. Convergence of several Runge–Kutta methods for the Lotka–Volterra model.
Mathematics 07 00861 g010
Figure 11. Hamiltonian conservation for the 1-stage (top row) and 3-stage (bottom row) Gauss methods applied to the Lotka–Volterra model with the time step h = 0.1 over the time interval [ 0 , 5 × 10 5 ] (right column), with a close-up on the initial interval [ 0 , 100 ] shown in (left column).
Figure 11. Hamiltonian conservation for the 1-stage (top row) and 3-stage (bottom row) Gauss methods applied to the Lotka–Volterra model with the time step h = 0.1 over the time interval [ 0 , 5 × 10 5 ] (right column), with a close-up on the initial interval [ 0 , 100 ] shown in (left column).
Mathematics 07 00861 g011
Figure 12. Hamiltonian for the numerical solution of the Lotka–Volterra model obtained with the 2-stage Gauss method (top left), the 3- and 4-stage Lobatto IIIA-IIIB schemes (top right,bottom left), respectively, and the non-variational Radau IIA method (bottom right).
Figure 12. Hamiltonian for the numerical solution of the Lotka–Volterra model obtained with the 2-stage Gauss method (top left), the 3- and 4-stage Lobatto IIIA-IIIB schemes (top right,bottom left), respectively, and the non-variational Radau IIA method (bottom right).
Mathematics 07 00861 g012

Share and Cite

MDPI and ACS Style

Tyranowski, T.M.; Desbrun, M. Variational Partitioned Runge–Kutta Methods for Lagrangians Linear in Velocities. Mathematics 2019, 7, 861. https://doi.org/10.3390/math7090861

AMA Style

Tyranowski TM, Desbrun M. Variational Partitioned Runge–Kutta Methods for Lagrangians Linear in Velocities. Mathematics. 2019; 7(9):861. https://doi.org/10.3390/math7090861

Chicago/Turabian Style

Tyranowski, Tomasz M., and Mathieu Desbrun. 2019. "Variational Partitioned Runge–Kutta Methods for Lagrangians Linear in Velocities" Mathematics 7, no. 9: 861. https://doi.org/10.3390/math7090861

APA Style

Tyranowski, T. M., & Desbrun, M. (2019). Variational Partitioned Runge–Kutta Methods for Lagrangians Linear in Velocities. Mathematics, 7(9), 861. https://doi.org/10.3390/math7090861

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop