9 research outputs found
R-adaptive multisymplectic and variational integrators
Moving mesh methods (also called r-adaptive methods) are space-adaptive
strategies used for the numerical simulation of time-dependent partial
differential equations. These methods keep the total number of mesh points
fixed during the simulation, but redistribute them over time to follow the
areas where a higher mesh point density is required. There are a very limited
number of moving mesh methods designed for solving field-theoretic partial
differential equations, and the numerical analysis of the resulting schemes is
challenging. In this paper we present two ways to construct r-adaptive
variational and multisymplectic integrators for (1+1)-dimensional Lagrangian
field theories. The first method uses a variational discretization of the
physical equations and the mesh equations are then coupled in a way typical of
the existing r-adaptive schemes. The second method treats the mesh points as
pseudo-particles and incorporates their dynamics directly into the variational
principle. A user-specified adaptation strategy is then enforced through
Lagrange multipliers as a constraint on the dynamics of both the physical field
and the mesh points. We discuss the advantages and limitations of our methods.
Numerical results for the Sine-Gordon equation are also presented.Comment: 65 pages, 13 figure
New variational and multisymplectic formulations of the Euler-Poincar\'e equation on the Virasoro-Bott group using the inverse map
We derive a new variational principle, leading to a new momentum map and a
new multisymplectic formulation for a family of Euler--Poincar\'e equations
defined on the Virasoro-Bott group, by using the inverse map (also called
`back-to-labels' map). This family contains as special cases the well-known
Korteweg-de Vries, Camassa-Holm, and Hunter-Saxton soliton equations. In the
conclusion section, we sketch opportunities for future work that would apply
the new Clebsch momentum map with -cocycles derived here to investigate a
new type of interplay among nonlinearity, dispersion and noise.Comment: 19 page
Symplectic model reduction methods for the Vlasov equation
Particle-based simulations of the Vlasov equation typically require a large
number of particles, which leads to a high-dimensional system of ordinary
differential equations. Solving such systems is computationally very expensive,
especially when simulations for many different values of input parameters are
desired. In this work we compare several model reduction techniques and
demonstrate their applicability to numerical simulations of the Vlasov
equation. The necessity of symplectic model reduction algorithms is illustrated
with a simple numerical experiment.Comment: 15 pages, 4 figure
Variational Partitioned Runge–Kutta Methods for Lagrangians Linear in Velocities
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
Variational Partitioned Runge–Kutta Methods for Lagrangians Linear in Velocities
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
Variational Partitioned Runge–Kutta Methods for Lagrangians Linear in Velocities
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