Related papers: Order-N Cluster Monte Carlo Method for Spin System…
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…
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 have developed an efficient Monte Carlo algorithm, which accelerates slow Monte Carlo dynamics in quasi-one-dimensional Ising spin systems. The loop algorithm of the quantum Monte Carlo method is applied to the classical spin models with…
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…
A new Monte-Carlo method for long-range interacting systems is presented. This method consists of eliminating interactions stochastically with the detailed balance condition satisfied. When a pairwise interaction $V_{ij}$ of a $N$-particle…
Monte Carlo simulations are methods for simulating statistical systems. The aim is to generate a representative ensemble of configurations to access thermodynamical quantities without the need to solve the system analytically or to perform…
A quantum Monte Carlo algorithm for the transverse Ising model with arbitrary short- or long-range interactions is presented. The algorithm is based on sampling the diagonal matrix elements of the power series expansion of the density…
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…
We use an efficient method that eases the daunting task of simulating dynamics in spin systems with long-range interaction. Our Monte Carlo simulations of the long-range Ising model for the nonequilibrium phase ordering dynamics in two…
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…
We describe a novel switching algorithm based on a ``reverse'' Monte Carlo method, in which the potential is stochastically modified before the system configuration is moved. This new algorithm facilitates a generalized formulation of…
We discuss an efficient approach to the calculation of the internal energy in numerical simulations of spin systems with long-range interactions. Although, since the introduction of the Luijten-Bl\"ote algorithm, Monte Carlo simulations of…
We study the influence of Ohmic dissipation on the random transverse-field Ising chain by means of large-scale Monte-Carlo simulations. To this end, we first map the Hamiltonian onto a classical Ising model with long-range $1/\tau^2$…
Simulating long-range interacting systems is a challenging task due to its computational complexity that the computational effort for each local update is of order $\cal{O}$$(N)$, where $N$ is the size of system. Recently, a technique,…
We present a Monte Carlo method that efficiently computes the density of states for spin models having any number of interaction per spin. By combining a random-walk in the energy space with collective updates controlled by the…
Monte Carlo simulation using the standard single-spin flip algorithm often fails to sample over the entire configuration space at low temperatures for frustrated spin systems. A typical example is a class of spin-ice type Ising models. In…
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…
A cluster weight Ising model is proposed by introducing an additional cluster weight in the partition function of the traditional Ising model. It is equivalent to the O($n$) loop model or $n$-component face cubic loop model on the…
Using D-theory we construct a new efficient cluster algorithm for the Ising model. The construction is very different from the standard Swendsen-Wang algorithm and related to worm algorithms. With the new algorithm we have measured the…
I present a cluster Monte Carlo algorithm that gives direct access to the interface free energy of Ising models. The basic idea is to simulate an ensemble that consists of both configurations with periodic and with antiperiodic boundary…