|
|
Next: Parallel Simulation Implementation
Up: OOPSE: An Object-Oriented Parallel
Previous: The Z-Constraint Method
Contents
Energy Minimization
As one of the basic procedures of molecular modeling, energy
minimization is used to identify local configurations that are stable
points on the potential energy surface. There is a vast literature on
energy minimization algorithms have been developed to search for the
global energy minimum as well as to find local structures which are
stable fixed points on the surface. We have included two simple
minimization algorithms: steepest descent, (SD) and conjugate
gradient (CG) to help users find reasonable local minima from
their initial configurations. Since OOPSE handles atoms and
rigid bodies which have orientational coordinates as well as
translational coordinates, there is some subtlety to the choice of
parameters for minimization algorithms.
Given a coordinate set
and a search direction
, a line
search algorithm is performed along
to produce
. In the steepest descent (SD) algorithm,
 |
(5.1) |
The gradient and the direction of next step are always orthogonal.
This may cause oscillatory behavior in narrow valleys. To overcome
this problem, the Fletcher-Reeves variant [52] of the
conjugate gradient (CG) algorithm is used to generate
via simple recursion:
 |
(5.2) |
where
 |
(5.3) |
The Polak-Ribiere variant [53] of the conjugate
gradient (
) is defined as
![$\displaystyle \gamma_{k}=\frac{[\nabla V(x_{k+1})-\nabla V(x)]^{T}\nabla V(x_{k+1})}{\nabla V(x_{k})^{T}\nabla V(x_{k})}%
$](img360.png) |
(5.4) |
It is widely agreed that the Polak-Ribiere variant gives better
convergence than the Fletcher-Reeves variant, so the conjugate
gradient approach implemented in OOPSE is the Polak-Ribiere
variant.
The conjugate gradient method assumes that the conformation is close
enough to a local minimum that the potential energy surface is very
nearly quadratic. When the initial structure is far from the minimum,
the steepest descent method can be superior to the conjugate gradient
method. Hence, the steepest descent method is often used for the first
10-100 steps of minimization. Another useful feature of minimization
methods in OOPSE is that a modified SHAKE algorithm can be
applied during the minimization to constraint the bond lengths if this
is required by the force field. Meta-data parameters concerning the
minimizer are given in Table 5.1
Table 5.1:
Meta-data Keywords: Energy Minimizer Parameters
 |
Next: Parallel Simulation Implementation
Up: OOPSE: An Object-Oriented Parallel
Previous: The Z-Constraint Method
Contents
|