Professional Documents
Culture Documents
Why do we do Simulation?
1
08-10-2022
Kinds of Simulation
Kind of Simulation
▪ Quantum Mechanics (QM)/Ab-
initio/DFT
• Electronic Structure (Schrodinger)
• Accurate, but extremely expensive
• For smaller systems
2
08-10-2022
Molecular Dynamics
▪ Molecular dynamics simulations calculate the motion of the
atoms in a molecular assembly using Newtonian dynamics to
determine the net force and acceleration experienced by each
atom. Each atom i at position ri, is treated as a point with a mass
mi and a fixed charge qi.
Molecular Dynamics
3
08-10-2022
Molecular Dynamics
▪ Molecular Dynamics Process:
• So we determine the trajectory and motion of the atoms by using
the following expression.
▪ Ab-initio:
One can perform direct electronic-structure (quantum-mechanics-based)
calculations of forces during so-called Ab-Initio Molecular Dynamics
(AIMD) simulation.
4
08-10-2022
10
5
08-10-2022
11
12
6
08-10-2022
13
14
7
08-10-2022
15
16
8
08-10-2022
17
18
9
08-10-2022
Forcefields
▪ Examples on different
forcefields:
• AMBER
• CHARMM
• GROMOS
• OPLS
• MMFF
19
20
10
08-10-2022
21
Numerical Integration:
VelocityVerlet Algorithm
▪ The velocity Verlet algorithm (Verlet 1968) is one of the most
frequently implemented methods in MD
22
11
08-10-2022
Timesteps
▪ We need to determine the timestep of the numerical integration of
the simulations trajectories, in which every unit of this time step we
do the integration
▪ The Timestep of MD simulations is limited by the event which has
the smallest time (Why!!)
23
Timesteps: 1 fs barrier
▪ Atoms in a solid lattice vibrate in the range of 10−14
24
12
08-10-2022
Molecular Dynamics
Ensembles
▪ In a simulation box of an MD run, each atom moves and behaves
differently, and a new microstate of the system is generated in
every timestep
▪ An ensemble is the collection of possible systems that belongs to
the different microscopic states but with an identical macroscopic
or thermodynamic state.
25
Molecular Dynamics
Ensembles
▪ As with actual experiments in a lab, we impose these external
constraints on ensembles to have particular properties out after a
run.
▪ Thermodynamic properties such as entropy S, Helmholtz free
energy F, Gibbs free energy G, and the chemical potential μ can
be derived from data obtained from these prearranged ensembles
26
13
08-10-2022
27
Minimization
▪ Minimization is a procedure that attempts to minimize the potential
energy of the system to the lowest possible point.
28
14
08-10-2022
Minimization: Steepest
Descent
▪ Steepest Descent is a method for obtaining local stationary points of a
multi-dimensional function
• X0 initial structure
• Compute U(R) and ∇𝑈(𝑅) Energy and Gradient
• Update Xi+1= Xi - γi ∇𝑈(𝑅) Displacement
• Check for Convergence
if Yes: Done Xf = Xi
if No: Return to step 2
▪ Convergence Check:
• | ∇𝑈 𝑅 | ≈ 0 Gradient
• | 𝑈 𝑥𝑖 − 𝑈(𝑥𝑖−1) | ≈ 0 Energy
• |𝑥𝑖 − 𝑥𝑖−1| ≈ 0 Displacement
BITS Pilani, Pilani Campus
29
Minimization: Conjugate
Gradient
▪ Conjugate Gradient is a more advanced energy minimization
algorithm than steepest descent. It uses step history to accelerate
convergence
30
15
08-10-2022
MD Algorithm
1. Assign initial
2. Compute
3. Update
4. Update
5. Repeat until
6. Compute Desired
Properties
31
Limitations of MD
▪ Timescales: Require shorter timesteps for numerical stability
• Usually 1 fs (1 × 10-15s)
32
16
08-10-2022
33
34
17
08-10-2022
35
36
18
08-10-2022
THANK YOU
BITS Pilani
Pilani Campus
37
19