Related papers: Rejection-free Geometric Cluster Algorithm for Com…
A detailed description is provided of a new Worm Algorithm, enabling the accurate computation of thermodynamic properties of quantum many-body systems in continuous space, at finite temperature. The algorithm is formulated within the…
Modern parallel computing devices, such as the graphics processing unit (GPU), have gained significant traction in scientific and statistical computing. They are particularly well-suited to data-parallel algorithms such as the particle…
This review gives an overview on the research of algorithms for dynamical fermions used in large scale lattice QCD simulations. First a short overview on the state-of-the-art of ensemble generation at the physical point is given. Followed…
We present computer simulations of a dynamic Monte Carlo algorithm for polymer chains on the FCC lattice which takes explicitly into account the possibility to overcome topological constraints by controlling the rate at which nearby polymer…
We compare numerically the performance of reversible and non-reversible Markov Chain Monte Carlo algorithms for high dimensional oil reservoir problems; because of the nature of the problem at hand, the target measures from which we sample…
In this paper, we introduce a dynamical Monte Carlo algorithm for spin models in which the number of the spins fluctuates from zero to a given number by addition and deletion of spins with a probabilistic rule. Such simulations are realized…
Phase transitions of fluid mixtures of the type introduced by Stillinger and Helfand are studied using a continuum version of the invaded cluster algorithm. Particles of the same species do not interact, but particles of different types…
A new computational method is presented to resolve hydrodynamic interactions acting on solid particles immersed in incompressible host fluids. In this method, boundaries between solid particles and host fluids are replaced with a continuous…
The past few years have seen considerable progress in algorithmic development for the generation of gauge fields including the effects of dynamical fermions. The Rational Hybrid Monte Carlo (RHMC) algorithm, where Hybrid Monte Carlo is…
We describe a Monte Carlo procedure for the simulation of dynamically triangulate random surfaces with a boundary (topology of a disk). The algorithm keeps the total number of triangles fixed, while the length of the boundary is allowed to…
For a long time, people have been focusing on how to extract more information, such as off-diagonal observables, from the quantum Monte Carlo (QMC) simulation of the partition function, but there have been numerous difficulties, and many of…
Reverse Monte Carlo (RMC) is an algorithm that incorporates stochastic modification of the action as part of the process that updates the fields in a Monte Carlo simulation. Such update moves have the potential of lowering or eliminating…
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…
While recent work towards the development of tight-binding and ab-initio algorithms has focused on molecular dynamics, Monte Carlo methods can often lead to better results with relatively little effort. We present here a multi-step Monte…
The Kinetic-Diffusion Monte Carlo (KDMC) method is a powerful tool for simulating neutral particles in fusion reactors. It is a hybrid fluid-kinetic method that is significantly faster than pure kinetic methods at the cost of a small bias…
We present a universal quantum Monte Carlo algorithm for simulating arbitrary high-spin (spin greater than 1/2) Hamiltonians, based on the recently developed permutation matrix representation (PMR) framework. Our approach extends a…
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 present an exact Monte Carlo algorithm designed to sample theories where the energy is a sum of many couplings of decreasing strength. The algorithm avoids the computation of almost all non-leading terms. Its use is illustrated by…
We discuss in detail a recently proposed hybrid particle-continuum scheme for complex fluids and evaluate it at the example of a confined homopolymer solution in slit geometry. The hybrid scheme treats polymer chains near the impenetrable…
A microscopic model of adsorption in cluster forming systems with competing interaction is considered. The adsorption process is described by the master equation and modelled by a kinetic Monte Carlo method. The evolution of the particle…