2017
DOI: 10.1140/epjst/e2016-60338-3
|View full text |Cite
|
Sign up to set email alerts
|

Cluster Monte Carlo and dynamical scaling for long-range interactions

Abstract: Many spin systems affected by critical slowing down can be efficiently simulated using cluster algorithms. Where such systems have long-range interactions, suitable formulations can additionally bring down the computational effort for each update from O(N 2 ) to O(N ln N ) or even O(N ), thus promising an even more dramatic computational speed-up. Here, we review the available algorithms and propose a new and particularly efficient single-cluster variant. The efficiency and dynamical scaling of the available a… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
10
0

Year Published

2017
2017
2020
2020

Publication Types

Select...
6

Relationship

1
5

Authors

Journals

citations
Cited by 11 publications
(10 citation statements)
references
References 43 publications
0
10
0
Order By: Relevance
“…Naturally, simulations of such systems with longrange interaction are computationally far more expensive than its short-range counterpart. For equilibrium studies, the advent of various collective updates based on the Swendsen-Wang cluster algorithm [8] allows one to perform efficient Monte Carlo (MC) simulations [9][10][11]. Conversely, for understanding the nonequilibrium ordering kinetics following a quench from the high-temperature disordered phase into the ordered phase below the critical temperature T c , one is restricted to use only local moves, viz., single spin flips.…”
mentioning
confidence: 99%
See 1 more Smart Citation
“…Naturally, simulations of such systems with longrange interaction are computationally far more expensive than its short-range counterpart. For equilibrium studies, the advent of various collective updates based on the Swendsen-Wang cluster algorithm [8] allows one to perform efficient Monte Carlo (MC) simulations [9][10][11]. Conversely, for understanding the nonequilibrium ordering kinetics following a quench from the high-temperature disordered phase into the ordered phase below the critical temperature T c , one is restricted to use only local moves, viz., single spin flips.…”
mentioning
confidence: 99%
“…When simulating a long-range interacting system using periodic boundary conditions (via minimum-image convention), one encounters strong finite-size effects. We circumvent this problem by using Ewald summation [11,24,27] for calculating the effective interaction J(r ij ). To prepare an initial configuration that mimics a hightemperature paramagnetic phase (T ≫ T c ) we choose a square lattice having linear dimension L with randomly 50% up and 50% down spins.…”
mentioning
confidence: 99%
“…( 2). The resampling procedures in the extended cluster algorithms for long-range interactions and for quantum spin systems [21][22][23][24] can be understood as specific cases of the clock method.…”
Section: Which Requests An O(n ) Computation In the Metropolis Algorithmmentioning
confidence: 99%
“…Making use of the particular feature that each bond is treated independently in the cluster-update scheme [20], Luijten and Blöte [21] applied an efficient sampling procedure to place occupied bonds, instead of visiting each bond sequentially and throwing a random number to decide its status. The Luijten-Blöte cluster algorithm has O(1) complexity [21][22][23], and has been generalized to quantum systems [24]. Recently, an EC algorithm was proposed for long-range soft-sphere systems [25].…”
mentioning
confidence: 99%
“…While cluster updates for short-ranged interactions are standard textbook knowledge, this is less the case for methods for systems with long-ranged interactions. Flores-Sola et al review the available approaches and propose a new single-cluster update for spin systems with power-law interactions [4]. A recent new addition in the simulational toolbox that is particularly well suited for massively parallel architectures, population annealing, is discussed by Barash et al [5] with applications to the simulation of first-order phase transitions.…”
mentioning
confidence: 99%