Performance of a worm algorithm in $φ^4$ theory at finite quartic coupling
Authors:
Preprint
Abstract
Worm algorithms have been very successful with the simulation of sigma models with fixed length spins which result from scalar field theories in the limit of infinite quartic coupling lambda. Here we investigate closer their algorithmic efficiency at finite and even vanishing lambda for the one component model in dimensions D = 2, 3, 4.Keywords
All Related Versions
- Version 1, 2011-01-18, ArXiv
- Published version: Computer Physics Communications, 182 (7), 1477.
This publication has 4 references indexed in Scilit:
- Precision check on the triviality of thetheory by a new simulation methodPhysical Review D, 2009
- Simulating the all-order strong coupling expansion I: Ising model demoNuclear Physics B, 2009
- Dynamic Critical Behavior of the Worm Algorithm for the Ising ModelPhysical Review Letters, 2007
- Monte Carlo errors with less errorsComputer Physics Communications, 2004