Cell lists work by subdividing the simulation domain into cells with an edge length greater than or equal to the cut-off radius of the interaction to be computed. The particles are sorted into these cells and the interactions are computed between particles in the same or neighbouring cells.

In its most basic form, the non-bonded interactions for a cut-off distance ${\displaystyle r_{c}}$  are computed as follows:

for all neighbouring cell pairs ${\displaystyle (C_{\alpha },C_{\beta })}$  do

for all ${\displaystyle p_{\alpha }\in C_{\alpha }}$  do

for all ${\displaystyle p_{\beta }\in C_{\beta }}$  do

${\displaystyle r^{2}=\|\mathbf {x} [p_{\alpha }]-\mathbf {x} [p_{\beta }]\|_{2}^{2}}$ 

if ${\displaystyle r^{2}\leq r_{c}^{2}}$  then

Compute the interaction between ${\displaystyle p_{\alpha }}$  and ${\displaystyle p_{\beta }}$ .

end if

end for

end for

end for

Since the cell length is at least ${\displaystyle r_{c}}$  in all dimensions, no particles within ${\displaystyle r_{c}}$  of each other can be missed.

Given a simulation with ${\displaystyle N}$  particles with a homogeneous particle density, the number of cells ${\displaystyle m}$  is proportional to ${\displaystyle N}$  and inversely proportional to the cut-off radius (i.e. if ${\displaystyle N}$  increases, so does the number of cells). The average number of particles per cell ${\displaystyle {\overline {c}}=N/m}$  therefore does not depend on the total number of particles. The cost of interacting two cells is in ${\displaystyle {\mathcal {O}}({\overline {c}}^{2})}$ . The number of cell pairs is proportional to the number of cells which is again proportional to the number of particles ${\displaystyle N}$ . The total cost of finding all pairwise distances within a given cut-off is in ${\displaystyle {\mathcal {O}}(Nc)\in {\mathcal {O}}(N)}$ , which is significantly better than computing the ${\displaystyle {\mathcal {O}}(N^{2})}$  pairwise distances naively.

In most simulations, periodic boundary conditions are used to avoid imposing artificial boundary conditions. Using cell lists, these boundaries can be implemented in two ways.

Ghost cells edit

In the ghost cells approach, the simulation box is wrapped in an additional layer of cells. These cells contain periodically wrapped copies of the corresponding simulation cells inside the domain.

Although the data—and usually also the computational cost—is doubled for interactions over the periodic boundary, this approach has the advantage of being straightforward to implement and very easy to parallelize, since cells will only interact with their geographical neighbours.

Periodic wrapping edit

Instead of creating ghost cells, cell pairs that interact over a periodic boundary can also use a periodic correction vector ${\displaystyle \mathbf {q} _{\alpha \beta }}$ . This vector, which can be stored or computed for every cell pair ${\displaystyle (C_{\alpha },C_{\beta })}$ , contains the correction which needs to be applied to "wrap" one cell around the domain to neighbour the other. The pairwise distance between two particles ${\displaystyle p_{\alpha }\in C_{\alpha }}$  and ${\displaystyle p_{\beta }\in C_{\beta }}$  is then computed as

${\displaystyle r^{2}=\|\mathbf {x} [p_{\alpha }]-\mathbf {x} [p_{\beta }]-\mathbf {q} _{\alpha \beta }\|_{2}^{2}}$ .

This approach, although more efficient than using ghost cells, is less straightforward to implement (the cell pairs need to be identified over the periodic boundaries and the vector ${\displaystyle \mathbf {q} _{\alpha \beta }}$  needs to be computed/stored).

Despite reducing the computational cost of finding all pairs within a given cut-off distance from ${\displaystyle {\mathcal {O}}(N^{2})}$  to ${\displaystyle {\mathcal {O}}(N)}$ , the cell list algorithm listed above still has some inefficiencies.

Consider a computational cell in three dimensions with edge length equal to the cut-off radius ${\displaystyle r_{c}}$ . The pairwise distance between all particles in the cell and in one of the neighbouring cells is computed. The cell has 26 neighbours: 6 sharing a common face, 12 sharing a common edge and 8 sharing a common corner. Of all the pairwise distances computed, only about 16% will actually be less than or equal to ${\displaystyle r_{c}}$ . In other words, 84% of all pairwise distance computations are spurious.

One way of overcoming this inefficiency is to partition the domain into cells of edge length smaller than ${\displaystyle r_{c}}$ . The pairwise interactions are then not just computed between neighboring cells, but between all cells within ${\displaystyle r_{c}}$  of each other (first suggested in ^[1] and implemented and analysed in ^[2][3] and ^[4]). This approach can be taken to the limit wherein each cell holds at most one single particle, therefore reducing the number of spurious pairwise distance evaluations to zero. This gain in efficiency, however, is quickly offset by the number of cells ${\displaystyle C_{\beta }}$  that need to be inspected for every interaction with a cell ${\displaystyle C_{\alpha }}$ , which, for example in three dimensions, grows cubically with the inverse of the cell edge length. Setting the edge length to ${\displaystyle r_{c}/2}$ , however, already reduces the number of spurious distance evaluations to 63%.

Another approach is outlined and tested in Gonnet,^[5] in which the particles are first sorted along the axis connecting the cell centers. This approach generates only about 40% spurious pairwise distance computations, yet carries an additional cost due to sorting the particles.

• Verlet list