Next: The Boltzmann annealing mode
Up: Beyond automation
Previous: Constant temperature run
Contents
The slow-cooling mode
In this mode you define
a starting temperature T0 and a finishing temperature Tf, with T0 > Tf. At any
time step t during the minimisation,
the temperature T will be given by
T = T0 - t(T0 - Tf)/ttotal, where
ttotal is the total number of time steps for the minimisation.
In the slow cooling mode the maximum move sizes (as defined above) are linearly dependent
on both time and the current R-factor, with
max() = 0.5Rt/ttotal and
max() = Rt/ttotal, where R is the current R-factor,
t is the current time step and
ttotal is the total number of time steps for the
minimisation. The dependence on R is justified on the grounds that as we approach a
minimum of the target function, we should be sampling the configurational space on a
finer grid19. The time dependence
follows from a similar argument.
Footnotes
- ... grid19
- The word ``grid'' is used here metaphorically. For all practical
purposes the values returned by the random number generator in the 0.0-1.0 range are
continuous (if the generator returns values in the range 0 to 231 - 1, then the `grid
size' on
for example, is only 0.00000008 degrees)
Next: The Boltzmann annealing mode
Up: Beyond automation
Previous: Constant temperature run
Contents
NMG, January 2005