Wang-Landau sampling: Saving CPU time

doi:10.1016/j.jcp.2018.01.003

Return

Wang-Landau sampling: Saving CPU time

2018-04-01

PRE

DOI：10.1016/j.jcp.2018.01.003

Original

Original request for help

Save

Abstract

En 中文

In this work we propose an improvement to the Wang-Landau (WL) method that allows an economy in CPU time of about 60% leading to the same results with the same accuracy. We used the 2D Ising model to show that one can initiate all WL simulations using the outputs of an advanced WL level from a previous simulation. We showed that up to the seventh WL level (f(6)) the simulations are not biased yet and can proceed to any value that the simulation from the very beginning would reach. As a result the initial WL levels can be simulated just once. It was also observed that the saving in CPU time is larger for larger lattice sizes, exactly where the computational cost is considerable. We carried out high-resolution simulations beginning initially from the first WL level (f(0)) and another beginning from the eighth WL level (f(7)) using all the data at the end of the previous level and showed that the results for the critical temperature T-c and the critical static exponents beta and gamma coincide within the error bars. Finally we applied the same procedure to the 1/2-spin Baxter-Wu model and the economy in CPU time was of about 64%. (C) 2018 Elsevier Inc. All rights reserved.

Keywords:

Wang-Landau method

CPU time

Threshold of convergence

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.