<p>This command sets parameters that affect the building of pairwise
neighbor lists. All atom pairs within a neighbor cutoff distance
equal to the their force cutoff plus the <em>skin</em> distance are stored in
the list. Typically, the larger the skin distance, the less often
neighbor lists need to be built, but more pairs must be checked for
possible force interactions every timestep. The default value for
<em>skin</em> depends on the choice of units for the simulation; see the
default values below.</p>
<p>The <em>skin</em> distance is also used to determine how often atoms migrate
to new processors if the <em>check</em> option of the
<aclass="reference internal"href="neigh_modify.html"><spanclass="doc">neigh_modify</span></a> command is set to <em>yes</em>. Atoms are
migrated (communicated) to new processors on the same timestep that
neighbor lists are re-built.</p>
<p>The <em>style</em> value selects what algorithm is used to build the list.
The <em>bin</em> style creates the list by binning which is an operation that
scales linearly with N/P, the number of atoms per processor where N =
total number of atoms and P = number of processors. It is almost
always faster than the <em>nsq</em> style which scales as (N/P)^2. For
unsolvated small molecules in a non-periodic box, the <em>nsq</em> choice can
sometimes be faster. Either style should give the same answers.</p>
<p>The <em>multi</em> style is a modified binning algorithm that is useful for
systems with a wide range of cutoff distances, e.g. due to different
size particles. For the <em>bin</em> style, the bin size is set to 1/2 of
the largest cutoff distance between any pair of atom types and a
single set of bins is defined to search over for all atom types. This
can be inefficient if one pair of types has a very long cutoff, but
other type pairs have a much shorter cutoff. For style <em>multi</em> the
bin size is set to 1/2 of the shortest cutoff distance and multiple
sets of bins are defined to search over for different atom types.
This imposes some extra setup overhead, but the searches themselves
may be much faster for the short-cutoff cases. See the <aclass="reference internal"href="comm_modify.html"><spanclass="doc">comm_modify mode multi</span></a> command for a communication option option
that may also be beneficial for simulations of this kind.</p>
<p>The <aclass="reference internal"href="neigh_modify.html"><spanclass="doc">neigh_modify</span></a> command has additional options
that control how often neighbor lists are built and which pairs are
stored in the list.</p>
<p>When a run is finished, counts of the number of neighbors stored in
the pairwise list and the number of times neighbor lists were built
are printed to the screen and log file. See <aclass="reference internal"href="Section_start.html#start-8"><spanclass="std std-ref">this section</span></a> for details.</p>
Built with <ahref="http://sphinx-doc.org/">Sphinx</a> using a <ahref="https://github.com/snide/sphinx_rtd_theme">theme</a> provided by <ahref="https://readthedocs.org">Read the Docs</a>.