An improved acceptance procedure for the hybrid Monte Carlo algorithm
暂无分享,去创建一个
Abstract The probability of accepting a candidate move in the hybrid Monte Carlo algorithm can be increased by considering a transition to be between windows of several states at the beginning and end of the trajectory, with a particular state within the selected window then being chosen according to the Boltzmann probabilities. The detailed balance condition used to justify the algorithm still holds with this procedure, provided the start state is randomly positioned within its window. The new procedure is shown empirically to significantly improve the acceptance rate for a test system of uncoupled oscillators. It also allows expectations to be estimated using data from all states in the windows, rather than just states that are accepted.
[1] S. Duane,et al. Hybrid Monte Carlo , 1987 .
[2] D. Toussaint. Introduction to algorithms for Monte Carlo simulations and their application to QCD , 1989 .
[3] H. C. Andersen. Molecular dynamics simulations at constant pressure and/or temperature , 1980 .
[4] A. Kennedy,et al. Acceptances and autocorrelations in hybrid Monte Carlo , 1991 .
[5] N. Metropolis,et al. Equation of State Calculations by Fast Computing Machines , 1953, Resonance.