ON THE WANG–LANDAU METHOD USING THE N-FOLD WAY

Abstract

We present a variation of the N-fold way algorithm, which improves efficiency when one combines the Wang–Landau method with the N-fold way. It is shown that the new version of the N-fold way algorithm has good performance when used for importance sampling and compared with the usual N-fold version or the Metropolis algorithm. The new N-fold algorithm combined with the Wang–Landau method is applied to the square Ising model using a multi-range approach. A comparative study is presented for all these algorithms, Wang–Landau and the two combined versions with the N-fold way. The role of boundary effects is discussed.