اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدMake life simple: unleash the full power of the parallel tempering algorithm
117
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We introduce a new update scheme to systematically improve the efficiency of parallel tempering simulations. We show that by adapting the number of sweeps between replica exchanges to the canonical autocorrelation time, the average round-trip time of a replica in temperature space can be significantly decreased. The temperatures are not dynamically adjusted as in previous attempts but chosen to yield a 50% exchange rate of adjacent replicas. We illustrate the new algorithm with results for the Ising model in two and the Edwards-Anderson Ising spin glass in three dimensions
قيم البحث
اقرأ أيضاً
In finite-size scaling analyses of Monte Carlo simulations of second-order phase transitions one often needs an extended temperature range around the critical point. By combining the parallel tempering algorithm with cluster updates and an adaptive r
outine to find the temperature window of interest, we introduce a flexible and powerful method for systematic investigations of critical phenomena. As a result, we gain one to two orders of magnitude in the performance for 2D and 3D Ising models in comparison with the recently proposed Wang-Landau recursion for cluster algorithms based on the multibondic algorithm, which is already a great improvement over the standard multicanonical variant.
We review several parallel tempering schemes and examine their main ingredients for accuracy and efficiency. The present study covers two selection methods of temperatures and several choices for the exchange of replicas, including a recent novel all
-pair exchange method. We compare the resulting schemes and measure specific heat errors and efficiency using the two-dimensional (2D) Ising model. Our tests suggest that, an earlier proposal for using numbers of local moves related to the canonical correlation times is one of the key ingredients for increasing efficiency, and protocols using cluster algorithms are found to be very effective. Some of the protocols are also tested for efficiency and ground state production in 3D spin glass models where we find that, a simple nearest-neighbor approach using a local n-fold way algorithm is the most effective. Finally, we present evidence that the asymptotic limits of the ground state energy for the isotropic case and that of an anisotropic case of the 3D spin-glass model are very close and may even coincide.
We study the applicability of the {it parallel tempering method} (PT) in the investigation of first- order phase transitions. In this method, replicas of the same system are simulated simultaneously at different temperatures and the configurations of
two randomly chosen replicas can occasionally be interchanged. We apply the PT for the Blume-Emery-Griffiths (BEG) model, which displays strong first-order transitions at low temperatures. A precise estimate of coexistence lines is obtained, revealing that the PT may be a successful tool for the characterization of discontinuous transitions.
We present a study of the parallel tempering (replica exchange) Monte Carlo method, with special focus on the feedback-optimized parallel tempering algorithm, used for generating an optimal set of simulation temperatures. This method is applied to a
lattice simulation of a homopolymer chain undergoing a coil-to-globule transition upon cooling. We select the optimal number of replicas for different chain lengths, N = 25, 50 and 75, using replicas round-trip time in temperature space, in order to determine energy, specific heat, and squared end-to-end distance of the hopolymer chain for the selected temperatures. We also evaluate relative merits of this optimization method.
We study the performance of QCD simulations with dynamical Wilson fermions by combining the Hybrid Monte Carlo algorithm with parallel tempering on $10^4$ and $12^4$ lattices. In order to compare tempered with standard simulations, covariance matrice
s between sub-ensembles have to be formulated and evaluated using the general properties of autocorrelations of the parallel tempering algorithm. We find that rendering the hopping parameter $kappa$ dynamical does not lead to an essential improvement. We point out possible reasons for this observation and discuss more suitable ways of applying parallel tempering to QCD.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
