Related papers: Symplectic GARK methods for partitioned Hamiltonia…
In this paper, we present a framework to construct general stochastic Runge-Kutta Lawson schemes. We prove that the schemes inherit the consistency and convergence properties of the underlying Runge-Kutta scheme, and confirm this in some…
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…
Explicit Runge-Kutta schemes with large stable step sizes are developed for integration of high order spectral difference spatial discretization on quadrilateral grids. The new schemes permit an effective time step that is substantially…
We propose an implementation of symplectic implicit Runge-Kutta schemes for highly accurate numerical integration of non-stiff Hamiltonian systems based on fixed point iteration. Provided that the computations are done in a given floating…
The numerical solution of an ordinary differential equation can be interpreted as the exact solution of a nearby modified equation. Investigating the behaviour of numerical solutions by analysing the modified equation is known as backward…
Explicit symplectic integrators have been important tools for accurate and efficient approximations of mechanical systems with separable Hamiltonians. For the first time, the article proposes for arbitrary Hamiltonians similar integrators,…
Accelerated gradient methods have had significant impact in machine learning -- in particular the theoretical side of machine learning -- due to their ability to achieve oracle lower bounds. But their heuristic construction has hindered…
A numerical algorithm to obtain the consistent conditions satisfied by singular arcs for singular linear-quadratic optimal control problems is presented. The algorithm is based on the presymplectic constraint algorithm (PCA) by Gotay-Nester…
Multi-symplectic integrators are typically regarded as a discretization of the Hamiltonian partial differential equations. This is due to the fact that, for generic finite-dimensional Hamiltonian systems, there exists only one independent…
Fully implicit Runge-Kutta (IRK) methods have many desirable accuracy and stability properties as time integration schemes, but high-order IRK methods are not commonly used in practice with large-scale numerical PDEs because of the…
Computing Gaussian ground states via variational optimization is challenging because the covariance matrices must satisfy the uncertainty principle, rendering constrained or Riemannian optimization costly, delicate, and thus difficult to…
In this paper, we present error estimates of fully discrete Runge--Kutta discontinuous Galerkin (DG) schemes for linear time-dependent partial differential equations. The analysis applies to explicit Runge--Kutta time discretizations of any…
We study a class of general purpose linear multisymplectic integrators for Hamiltonian wave equations based on a diamond-shaped mesh. On each diamond, the PDE is discretized by a symplectic Runge--Kutta method. The scheme advances in time…
A new approach to the construction of difference schemes of any order for the many-body problem that preserves all its algebraic integrals is proposed. We introduced additional variables, namely, distances and reciprocal distances between…
This paper analyses the long-time behaviour of one-stage symplectic or symmetric extended Runge--Kutta--Nystr\"{o}m (ERKN) methods when applied to nonlinear wave equations. It is shown that energy, momentum, and all harmonic actions are…
Fractional-step methods are a popular and powerful divide-and-conquer approach for the numerical solution of differential equations. When the integrators of the fractional steps are Runge--Kutta methods, such methods can be written as…
In this paper, we extend the Paired-Explicit Runge-Kutta schemes by Vermeire et. al. to fourth-order of consistency. Based on the order conditions for partitioned Runge-Kutta methods we motivate a specific form of the Butcher arrays which…
Energy methods for constructing time-stepping algorithms are of increased interest in application to nonlinear problems, since numerical stability can be inferred from the conservation of the system energy. Alternatively, symplectic…
By exploiting the error functions of explicit symplectic integrators for solving separable Hamiltonians, I show that it is possible to develop explicit, time-reversible symplectic integrators for solving non-separable Hamiltonians of the…
The paper intends to lay out the first steps towards constructing a unified framework to understand the symplectic and spectral theory of finite dimensional integrable Hamiltonian systems. While it is difficult to know what the best…