Integration schemes in Molecular Dynamics
4 likes4,073 views
The document discusses several integration schemes used to model the time evolution of dynamical systems given their initial conditions and equations of motion. It describes the Verlet, leapfrog, and velocity Verlet algorithms, which are explicit integration methods that require only one force evaluation per time step. The document also outlines the Gear predictor-corrector algorithm, an implicit method that predicts positions and velocities before applying corrections.
![Derivation
r(t+h)=r(t)+v(t)h+1/2a(t)h2+O(h3)
v(t+h)=v(t)+a(t)h+1/2b(t)h2+O(h3) (1)
v(t)=v(t+h)-a(t+h)h+1/2b(t+h)h2+O(h3) (2)
Subtracting (2) from (1),
2v(t+h)=2v(t)+h[a(t)+a(t+h)]+1/2[b(t)-b(t+h)] h2
v(t+h)=v(t)+h/2[a(t)+a(t+h)]+O(h3)](https://image.slidesharecdn.com/integrationschemes-140303093151-phpapp01/85/Integration-schemes-in-Molecular-Dynamics-22-320.jpg)
Integration schemes in Molecular Dynamics
- 2. Revisiting some Familiar Concepts State of a System: The different configurations in which a system can exist Specifying the State of a system: State of a mechanical system is specified by the positions and momenta of all particles of the system
- 3. Phase space: a space in which all possible states of a system are represented, with each possible state of the system corresponding to one unique point in the phase space. •Every state is a point in the phase space and the dynamics of a system can be visualised as its movement through the phase space.
- 4. Integrators Algorithms used to model the time evolution of a system given its initial state using the equations of motion.
- 5. Characteristics of a good Integrator Minimal need to compute forces(a very expensive calculation) Small propagation error, allowing large time steps Accuracy Conserves energy and momentum Time reversible Area preserving(Symplectic)
- 7. Verlet Algorithm Sum the forward and backward expansions
- 8. Verlet Algorithm Subtract the backward expansion from the forward
- 9. Verlet Algorithm: Loose Ends How to get positon at “previous time step” when starting out? Simple approximation
- 10. Verlet Algorithm: Flow Chart
- 11. Verlet algorithm: Advantages Integration does not require the velocities, only position information is taken into account. Only a single force evaluation per integration cycle. (Force evaluation is the most computationally expensive part in the simulation). This formulation, which is based on forward and backward expansions, is naturally reversible in time (a property of the equation of motion).
- 13. Verlet Algorithm: Disadvantages Error in velocity approximation is of the order of time step squared(large errors). Need to know r(n+1)to calculate v(n). Numerical imprecision in adding small and large numbers.
- 14. Leap Frog Algorithm Evaluate velocities at the midpoint of the position evaluations and Vice versa.
- 15. 1. Use r(n) to calculate F(n). 2.Use F(n) and v(n-1/2)to calculate v (n+1/2). 3.Use r(n) and v(n+1/2) to calculate r(n+1).
- 16. Leap Frog: Flow Chart Given current position, and velocity at last half-step Compute current force
- 17. Compute velocity at next half-step Compute next position
- 18. Advance to next time step, repeat
- 19. Leap Frog : Advantages Eliminates addition of small numbers to large ones. Reduces the numerical error problem of the Verlet algorithm. Here O(Δt1) terms are added to O(Δt0) terms. Hence Improved evaluation of velocities. Direct evaluation of velocities gives a useful handle for controlling the temperature in the simulation.
- 20. Leap Frog : Disadvantages The velocities at time t are still approximate. Computationally a little more expensive than Verlet.
- 21. Velocity Verlet
- 22. Derivation r(t+h)=r(t)+v(t)h+1/2a(t)h2+O(h3) v(t+h)=v(t)+a(t)h+1/2b(t)h2+O(h3) (1) v(t)=v(t+h)-a(t+h)h+1/2b(t+h)h2+O(h3) (2) Subtracting (2) from (1), 2v(t+h)=2v(t)+h[a(t)+a(t+h)]+1/2[b(t)-b(t+h)] h2 v(t+h)=v(t)+h/2[a(t)+a(t+h)]+O(h3)
- 23. Given current position, velocity, and force Compute new position
- 24. Compute velocity at half step Compute force at new position
- 25. Compute velocity at full step Advance to next time step, repeat
- 26. Verlet Algorithm:Advantages is a second order integration scheme, i. e. the error term is O ((∂t)3). is explicit, i. e. without reference into the future: The system at time t+∂t can be calculated directly from quantities known at time t. is self-starting, i. e. without reference into the far past: The system at time ∂t can be calculated directly knowing only the system at time t = 0. allows ∂t to be chosen differently for each time. This can be very useful when the accelerations vary strongly over time. requires only one evaluation of the accelerations per timestep.
- 27. Gear Predictor-Corrector Algorithm Predict r(t+dt) from the Taylor expansion at the starting point. Using this value of r(t+dt), calculate ac(t+dt). Similarly calculate v(t+dt), a(t+dt),b(t+dt) at that point. The difference between the a(t+dt) and the predicted ac(t+dt):
- 29. The correction coefficients have been determined by gear and tabulated.
- 31. Gear Predictor-Corrector Algorithm: Disadvantages Not time reversible. Not symplectic, therefore does not conserve phase space volume. Not energy conserving, implies over time there is a gradual energy drift.
- 32. Thank You