Integrators leapfrog

The application in [24] is to celestial mechanics, in which the reduced problem for consists of the Keplerian motion of planets around the sun and in which the impulses account for interplanetary interactions. Application to MD is explored in [14]. It is not easy to find a reduced problem that can be integrated analytically however. The choice /f = 0 is always possible and this yields the simple but effective leapfrog/Stormer/Verlet method, whose use according to [22] dates back to at least 1793 [5]. This connection should allay fears concerning the quality of an approximation using Dirac delta functions. 

The simplest of the numerical techniques for the integration of equations of motion is leapfrog-Verlet algorithm (LFV), which is known to be symplectic and of second order. The name leapfrog steams from the fact that coordinates and velocities are calculated at different times. 

Equations (4) are called quasi-Hamiltonian because, even though they employ generalized velocities, they describe the motion in the space of canonical variables. Accordingly, numerical trajectories computed with appropriate integrators will conserve the symplectic structure. Eor example, an implicit leapfrog integrator can be expressed as... 

After the momenta are selected from the distribution (8.39), the dynamics is propagated by a standard leapfrog algorithm (any symplectic and time-reversible integrator is suitable). The move is then accepted or rejected according to a criterion based on the detailed balance condition... 

Now we are able to substitute B/t) in Eq. 8 from Eq. 9. After replacing the acceleration Rj (t) with the force F/ (t) we finally obtain Eq. 6. There are several others algorithms to integrate the equations of motion (e.g., leapfrog, Verlet). The consequences of different equation of motion integration schemes with regard to AMD are discussed in the excellent review of Remler and Madden (54). 

Note that in die leapfrog method, position depends on the velocities as computed one-half time step out of phase, dins, scaling of the velocities can be accomplished to control temperature. Note also that no force-deld calculations actually take place for the fractional time steps. Eorces (and thus accelerations) in Eq. (3.24) are computed at integral time steps, halftime-step-forward velocities are computed therefrom, and these are then used in Eq. (3.23) to update the particle positions. The drawbacks of the leapfrog algorithm include ignoring third-order terms in the Taylor expansions and the half-time-step displacements of the position and velocity vectors - both of these features can contribute to decreased stability in numerical integration of the trajectoiy. 

For the time-marching procedure, the leapfrog integration may be substituted by the fourth-order Runge-Kutta one, which staggers the variables in space but not in time. Thus, for dU/dt = /( /), it is derived... 

Higher Order Nonstandard Leapfrog-Type Integrators... 

An efficient way to circumvent this difficulty is to devise a gradually extending leapfrog algorithm, which can be reliably employed for any K value. For illustration, the fourth-order integrator is given by... 

Vectors 521, for ( = 1,2,3, in (3.56), are temporary storage quantities for the intermediate values of the progressive integration. In an analogous manner, the remaining part of the leapfrog scheme is completed as... 

FIGURE 3.2 Schematic depiction of the fourth-order nonstandard leapfrog-type integrator... 

The explicit integration methods, such as leapfrog, prediction-correction or Runge-Kutta methods, are usually used to integrate SPH equations for fluid flows. The explicit time integration is conditionally stable. The time step should satisfy the convective stabihty constraint, i.e., the so-caUed Courant-Friedrichs-Lewy (CFL) condition,... 

We used the results of a molecular dynamics simulation to interpret the II-A isotherms. The evolution of the many-particle system can be described by integrating Newton s equations of motion. To integrate the differential equation system we used the leapfrog method [40]. The simulation of the compression was performed for 1,000 particles in a rectangular cell with periodic boundary conditions. The size distribution of the particles could be set... 

---