相关论文: Cluster Monte Carlo study of magnetic dipoles

A cluster Monte Carlo method for systems of classical spins with purely dipolar couplings is presented. It is tested and applied for finite arrays of perpendicular Ising dipoles on the triangular lattice. This model is a modification with…

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…

We present cluster Monte Carlo algorithms for the $XYZ$ quantum spin models. In the special case of $S=1/2$, the new algorithm can be viewed as a cluster algorithm for the 8-vertex model. As an example, we study the $S=1/2$ $XY$ model in…

We review efficient Monte Carlo methods for simulating quantum systems which couple to a dissipative environment. A brief introduction of the Caldeira-Leggett model and the Monte Carlo method will be followed by a detailed discussion of…

We investigate local update algorithms for the fully frustrated XY model on a square lattice. In addition to the standard updating procedures like the Metropolis or heat bath algorithm we include overrelaxation sweeps, implemented through…

A new Monte Carlo algorithm for 2-dimensional spin glasses is presented. The use of clusters makes possible global updates and leads to a gain in speed of several orders of magnitude. As an example, we study the 2-dimensional +/-J…

We present an algorithm for Monte Carlo simulations of a nearest-neighbor spin ice model based on its cluster representation. To assess its performance, we estimate a relaxation time, and find that, in contrast to the Metropolis algorithm,…

We review the background of the cluster algorithms in Monte Carlo simulation of statistical physics problems. One of the first such successful algorithm was developed by Swendsen and Wang eight years ago. In contrast to the local…

We propose a Monte Carlo method which performs a random walk in energy space using cluster-like collective updates. By imposing that bond probabilities depend continuously on the microcanonical temperature, we obtain dynamic exponents close…

An efficient Monte Carlo algorithm for the simulation of spin models with long-range interactions is discussed. Its central feature is that the number of operations required to flip a spin is independent of the number of interactions…

We present an optimized version of a cluster labeling algorithm previously introduced by the authors. This algorithm is well suited for large-scale Monte Carlo simulations of spin models using cluster dynamics on parallel computers with…

We introduce a multiscale Monte Carlo algorithm to simulate dense simple fluids. The probability of an update follows a power law distribution in its length scale. The collective motion of clusters of particles requires generalization of…

We describe a Monte Carlo simulation study of the magnetic phase diagram of diluted magnetic semiconductors doped with shallow impurities in the low concentration regime. We show that because of a wide distribution of interaction strengths,…

We propose a new effective cluster algorithm of tuning the critical point automatically, which is an extended version of Swendsen-Wang algorithm. We change the probability of connecting spins of the same type, $p = 1 - e^{- J/ k_BT}$, in…

In recent years, a better understanding of the Monte Carlo method has provided us with many new techniques in different areas of statistical physics. Of particular interest are so called cluster methods, which exploit the considerable…

Dilute dipolar Ising magnets remain a notoriously hard problem to tackle both analytically and numerically because of long-ranged interactions between spins as well as rare region effects. We study a new type of anisotropic dilute dipolar…

Generalized rules for building and flipping clusters in the quantum Monte Carlo loop algorithm are presented for the XXZ-model in a uniform magnetic field along the Z-axis. As is demonstrated for the Heisenberg antiferromagnet it is…

An efficient O(N) cluster Monte Carlo method for Ising models with long-range interactions is presented. Our novel algorithm does not introduce any cutoff for interaction range and thus it strictly fulfills the detailed balance. The…

We describe a number of recently developed cluster-flipping algorithms for the efficient simulation of classical spin models near their critical temperature. These include the algorithms of Wolff, Swendsen and Wang, and Niedermeyer, as well…

We show that addition of Metropolis single spin-flips to the Wolff cluster flipping Monte Carlo procedure leads to a dramatic {\bf increase} in performance for the spin-1/2 Ising model. We also show that adding Wolff cluster flipping to the…