![]() |
| |||||||||||||||||||||||||||||||||||||||
|
|
Next: Constant-pressure integration with isotropic Up: Mechanics Previous: Extended Systems for other Contents
|
|||||||||||||||||||||||||||||||||||||||
![]() |
(4.22) |
| (4.23) |
![]() |
(4.24) |
In eq.(4.21),
is the time constant for
relaxation of the temperature to the target value. To set values for
or
in a simulation, one would use the
tauThermostat and targetTemperature keywords in the
meta-data file. The units for tauThermostat are fs, and the
units for the targetTemperature are degrees K. The integration
of the equations of motion is carried out in a velocity-Verlet style 2
part algorithm:
moveA:
![]() |
||
![]() |
||
![]() |
Here
is the same symplectic Trotter
factorization of the three rotation operations that was discussed in
the section on the DLM integrator. Note that this operation modifies
both the rotation matrix
and the angular momentum
. moveA propagates velocities by a half time step, and
positional degrees of freedom by a full time step. The new positions
(and orientations) are then used to calculate a new set of forces and
torques in exactly the same way they are calculated in the doForces portion of the DLM integrator.
Once the forces and torques have been obtained at the new time step, the temperature, velocities, and the extended system variable can be advanced to the same time value.
moveB:
![]() |
||
![]() |
||
![]() |
Since
and
are required to calculate
as well as
, they indirectly depend on their
own values at time
. moveB is therefore done in an
iterative fashion until
becomes self-consistent. The
relative tolerance for the self-consistency check defaults to a value
of
10
, but OOPSE will terminate the iteration
after 4 loops even if the consistency check has not been satisfied.
The Nosé-Hoover algorithm is known to conserve a Hamiltonian for the extended system that is, to within a constant, identical to the Helmholtz free energy,[46]
![]() |
(4.25) |
Bond constraints are applied at the end of both the moveA and moveB portions of the algorithm. Details on the constraint algorithms are given in section 4.7.1.
|
|
Updated on January 16, 2006