Dynamically optimized Wang-Landau sampling with adaptive trial moves and modification factors
نویسندگان
چکیده
منابع مشابه
Wang-Landau sampling with self-adaptive range.
We report a self-adapting version of the Wang-Landau algorithm that is ideally suited for application to systems with a complicated structure of the density of states. Applications include determination of two-dimensional densities of states and high-precision numerical integration of sharply peaked functions on multidimensional integration domains.
متن کاملImproving Wang-Landau sampling with adaptive windows.
Wang-Landau sampling (WLS) of large systems requires dividing the energy range into "windows" and joining the results of simulations in each window. The resulting density of states (and associated thermodynamic functions) is shown to suffer from boundary effects in simulations of lattice polymers and the five-state Potts model. Here, we implement WLS using adaptive windows. Instead of defining ...
متن کاملWang-Landau Sampling in Three-Dimensional Polymers
Monte Carlo simulations using Wang-Landau sampling are performed to study three-dimensional chains of homopolymers on a lattice. We confirm the accuracy of the method by calculating the thermodynamic properties of this system. Our results are in good agreement with those obtained using Metropolis importance sampling. This algorithm enables one to accurately simulate the usually hardly accessibl...
متن کاملAvoiding boundary effects in Wang-Landau sampling.
A simple modification of the "Wang-Landau sampling" algorithm removes the systematic error that occurs at the boundary of the range of energy over which the random walk takes place in the original algorithm.
متن کاملSearch space analysis with Wang-Landau sampling and slow adaptive walks
Two complementary techniques for analyzing search spaces are proposed: (i) an algorithm to detect search points with potential to be local optima; and (ii) a slightly adjusted Wang-Landau sampling algorithm to explore larger search spaces. The detection algorithm assumes that local optima are points which are easier to reach and harder to leave by a slow adaptive walker. A slow adaptive walker ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review E
سال: 2013
ISSN: 1539-3755,1550-2376
DOI: 10.1103/physreve.88.053302