The implementation used in the presented examples is based on the very fast simulated re-annealing
[107] algorithm by L. Ingber. Very fast simulated re-annealing differs from Boltzmann annealing in
that it defines a generation probability density which allows for an
exponentially decreasing time step function
 |
(5.16) |
without violating the global convergence. The original implementation by
L. Ingber was extended to support the parallel executions of simulation runs as
they are performed in SIESTA.
2003-03-27
