Fast, hierarchical, and adaptive algorithm for Metropolis Monte Carlo simulations of long-range interacting systems (2207.14670v1)
Abstract: We present a fast, hierarchical, and adaptive algorithm for Metropolis Monte Carlo simulations of systems with long-range interactions that reproduces the dynamics of a standard implementation exactly, i.e., the generated configurations and consequently all measured observables are identical, allowing in particular for nonequilibrium studies. The method is demonstrated for the power-law interacting long-range Ising model with nonconserved order parameter and a Lennard-Jones system both in two dimensions. The measured runtimes support an average complexity $O(N\log N)$, where $N$ is the number of spins or particles. Importantly, prefactors of this scaling behavior are small, which in practice manifests in speedup factors larger than $104$. The method is general and will allow the treatment of large systems that were out of reach before, likely enabling a more detailed understanding of physical phenomena rooted in long-range interactions.
Sponsor
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.