Journal
COMPUTER PHYSICS COMMUNICATIONS
Volume 146, Issue 1, Pages 63-68Publisher
ELSEVIER SCIENCE BV
DOI: 10.1016/S0010-4655(02)00435-6
Keywords
cluster algorithm; Ising model; random spin systems
Ask authors/readers for more resources
We explain the idea of the probability-changing cluster (PCC) algorithm, which is an extended version of the Swendsen-Wang algorithm. With this algorithm, we can tune the critical point automatically. We show the effectiveness of the PCC algorithm for the case of the three-dimensional (3D) Ising model. We also apply this new algorithm to the study of the 3D diluted Ising model. Since we tune the critical point of each random sample automatically with the PCC algorithm, we can investigate the sample-dependent critical temperature and the sample average of physical quantities at each critical temperature, systematically. We have also applied another newly proposed algorithm, the Wang-Landau algorithm, to the study of the spin glass problem. (C) 2002 Elsevier Science B.V. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available