Cluster Algorithm Renormalization Group Method
Abstract
We present a self consistent method based on cluster algorithms and Renormalization Group on the lattice to study critical systems numerically. We illustrate it by means of the 2D Ising model. We compute the critical exponents and and the renormalization group flow of the probability density function of the magnetization. The results, compared to the standard Monte Carlo Renormalization Group proposed by Swendsen [1], are very accurate and the method works faster by a factor which grows monotonically with the lattice size. This allows to simulate larger lattices in reachable computational times.
Keywords
Cite
@article{arxiv.0911.5670,
title = {Cluster Algorithm Renormalization Group Method},
author = {Guillermo Palma and David Zambrano},
journal= {arXiv preprint arXiv:0911.5670},
year = {2009}
}
Comments
7 pages, 6 figures, Presented at the 26th International Symposium on Lattice Field Theory (Lattice 2008), Williamsburg, Virginia, USA, July 14-19, 2008