1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
|
.. _algorithms:
Algorithms
==========
In this chapter we first give describe some general concepts used in
|Gromacs|: *periodic boundary conditions* (sec. :ref:`pbc`) and the *group
concept* (sec. :ref:`groupconcept`). The MD algorithm is described in
sec. :ref:`MD`: first a global form of the algorithm is given, which is
refined in subsequent subsections. The (simple) EM (Energy Minimization)
algorithm is described in sec. :ref:`EM`. Some other algorithms for
special purpose dynamics are described after this.
A few issues are of general interest. In all cases the *system* must be
defined, consisting of molecules. Molecules again consist of particles
with defined interaction functions. The detailed description of the
*topology* of the molecules and of the *force field* and the calculation
of forces is given in chapter :ref:`ff`. In the present chapter we
describe other aspects of the algorithm, such as pair list generation,
update of velocities and positions, coupling to external temperature and
pressure, conservation of constraints. The *analysis* of the data
generated by an MD simulation is treated in chapter :ref:`analysis`.
.. toctree::
:maxdepth: 2
periodic-boundary-conditions
group-concept
molecular-dynamics
shell-molecular-dynamics
constraint-algorithms
simulated-annealing
stochastic-dynamics
brownian-dynamics
energy-minimization
normal-mode-analysis
free-energy-calculations
replica-exchange
essential-dynamics
expanded-ensemble
parallelization-domain-decomp
|
