Next: Dissemination of methods and
Up: Scalable biased hybrid Monte
Previous: Scaling of plain hybrid
Symplectic integrators integrate a modified Hamiltonian system that is close to
the Hamiltonian of interest [78].
A cheap approximation to the modified Hamiltonian has been introduced
recently. It is called the shadow Hamiltonian method [82]
and it can
achieve arbitrary accuracy in calculating the modified Hamiltonian using
available values of forces and energies, with an accuracy
, that is
.
The hybrid Monte Carlo partition function is [56]
Using any symplectic integrator to integrate the Hamiltonian's equation gives
. Expanding in powers of
gives
Using the shadow Hamiltonian for the MD trajectory and the acceptance
rule, the computational effort moving from one configuration to an
approximately independent configuration is proportional to
(if we do not count the additional computational
cost on calculating the shadow Hamiltonian). The asymptotic behavior
can be improved towards linear in a systematic way. Using the shadow
Hamiltonian, one would expect a speedup in the order of
. As
grows this
method will gain a speedup of
. Because the shadow
Hamiltonian method uses
values of forces and energies which are
already available during the integration of equation of motion, the
additional computational cost is low and
is only slightly larger
than unity. There is an additional memory requirement to form the
shadow Hamiltonian.
For
, we would expect a speedup over plain HMC of
. For
the speedup would be
. More importantly, the
speedup will grow with
, which makes this method a scalable
algorithm. For
the speedup with an eigth order accurate
shadow Hamiltonian will be
Note that the use of the
shadow Hamiltonian introduces a bias that has to be removed in the
acceptance rule of Monte Carlo [69].
Next: Dissemination of methods and
Up: Scalable biased hybrid Monte
Previous: Scaling of plain hybrid
Jesus Izaguirre
2001-07-27