A -convergence result for variational integrators of lagrangians with quadratic growth
Following the -convergence approach introduced by Müller and Ortiz, the convergence of discrete dynamics for lagrangians with quadratic behavior is established.
Following the -convergence approach introduced by Müller and Ortiz, the convergence of discrete dynamics for lagrangians with quadratic behavior is established.
Following the Γ-convergence approach introduced by Müller and Ortiz, the convergence of discrete dynamics for Lagrangians with quadratic behavior is established.
We show that while Runge-Kutta methods cannot preserve polynomial invariants in general, they can preserve polynomials that are the energy invariant of canonical Hamiltonian systems.
In this paper, we consider C1,1 Hamiltonian systems. We prove the existence of a first derivative of the flow with respect to initial values and show that it satisfies the symplecticity condition almost everywhere in the phase-space. In a second step, we present a geometric integrator for such systems (called the SDH method) based on B-splines interpolation and a splitting method introduced by McLachlan and Quispel [Appl. Numer. Math. 45 (2003) 411–418], and we prove it is convergent, and that...
In long-time numerical integration of Hamiltonian systems, and especially in molecular dynamics simulation, it is important that the energy is well conserved. For symplectic integrators applied with sufficiently small step size, this is guaranteed by the existence of a modified Hamiltonian that is exactly conserved up to exponentially small terms. This article is concerned with the simplified Takahashi-Imada method, which is a modification of the Störmer-Verlet method that is as easy to implement...
In this paper, we study the linear Schrödinger equation over the d-dimensional torus, with small values of the perturbing potential. We consider numerical approximations of the associated solutions obtained by a symplectic splitting method (to discretize the time variable) in combination with the Fast Fourier Transform algorithm (to discretize the space variable). In this fully discrete setting, we prove that the regularity of the initial datum is preserved over long times, i.e. times that are...
We study the enclosing problem for discrete and continuous dynamical systems in the context of computer assisted proofs. We review and compare the existing methods and emphasize the importance of developing a suitable set arithmetic for efficient algorithms solving the enclosing problem.
The parareal in time algorithm allows for efficient parallel numerical simulations of time-dependent problems. It is based on a decomposition of the time interval into subintervals, and on a predictor-corrector strategy, where the propagations over each subinterval for the corrector stage are concurrently performed on the different processors that are available. In this article, we are concerned with the long time integration of Hamiltonian systems. Geometric, structure-preserving integrators are...