  Three possibilities to speed up the Hybrid Monte Carlo algorithm are
investigated. Changing the step-size adaptively brings no practical gain. On
the other hand, substantial improvements result from using an approximate
Hamiltonian or a preconditioned action.
