# Molecular Simulation/Periodic Boundary Conditions

Macroscopic systems are extremely large and are, therefore, expensive to compute by molecular simulations. For instance, one gram of water has about 3 x 10^{22} molecules, a number too large to be calculated, even on computers. Fortunately, periodic boundary conditions enable us to mimic an infinite system by treating a relatively small part of a system to achieve a reasonable representation of the infinite system. The particles of this small subsystem are controlled by a set of boundary conditions called a unit cell (e.g., a three-dimensional box). During the simulation, particles are free to move in the central (original) cell; therefore, their periodic images of the adjacent cells move in an identical way. This means any particle that crosses one boundary of the cell, will reappear on the opposite side.

## Non-Bonded Interactions Under Periodic Boundary Conditions

editA particle in a periodic cell has non-bonded interactions with the other particles both in the original cell, and also in the surrounding cells (the periodic images of the original cell). The non-bonded potential energy ( ) can be written as:

where , and is a translational vector to different cell images. For a periodic cubic cell of length , becomes

where , , and are vectors of integers. The number of possible translational vectors, , are infinite. This will lead us to an infinite number of non-bonded interactions. Thus, we need to perform some approximations to deal with this problem.

The first term of the is the Lennard-Jones potential. This potential has an attractive component ( ) for London dispersion, which is a short range interaction. Accordingly, if the distance between interacting particles increases (i.e., r > 10 Å), the interaction becomes very weak. Thus, the interactions can be truncated for distances greater than 10 A. However, the potential will lose its continuity because of the unexpected truncation. This problem can be fixed by employing a switching function, which will smoothly scale down van der Waals interactions to zero at the cutoff distance. For faster computation, pair lists are designed to search for particles that could be inside the cutoff area within a specified range ( is ~2 Å larger than ), and, during the simulation, lists are updated.

The second term of the represents the long rang ( ) electrostatic potential, which cannot be truncated the same way as the Lennard-Jones potential. However, the particle mesh Ewald method could be used for treating the long range interaction part.

## Minimum Image Convention

editThe periodic boundary conditions use the minimum image convention to calculate distances between particles in the system. Let us consider that we have four particles ( , , , and ) in a cubic box of length . Then, the potential interactions will be calculated between the particle ( ) and the nearest periodic images of the other particles ( , , and ). The minimum image convention was first used by Metropolis and coworkers.^{[1]}

## Periodic Boundary Conditions with NAMD

editNAMD software requires three cell basis vectors to provide the periodic cell its size and shape: cellBasisVector1, cellBasisVector2, and cellBasisVector3. Each vector is perpendicular to the other two. The coordinates of the center of the periodic cell can be specified by the “cellOrigin” command. In addition, the “wrapAll on” command is usually used to ensure that any particle that crosses the boundary of the original cell will be imaged back into the cell.

## References

edit- ↑ Metropolis, N.; Rosenbluth, A. W.; Rosenbluth, M. N.; Teller, A. H; Teller, E. J (1953). "Equation of State Calculations by Fast
Computing Machines".
*The Journal of Chemical Physics*.**21**: 1078–1092.`{{cite journal}}`

: Cite has empty unknown parameter:`|1=`

(help); line feed character in`|title=`

at position 39 (help)

## Further Reading

editAllen, M. P.; Tildesley, D. J. Computer Simulation of Liquids; Oxford University Press: New York, 1989.

Tuckerman, M. Statistical Mechanics: Theory and Molecular Simulation; Oxford University Press: New York, 2010.