Related papers: Improved Algorithms for Simulating Crystalline Mem…
At fine lattice spacings, Markov chain Monte Carlo simulations of QCD and other gauge theories with or without fermions are plagued by slow modes that give rise to large autocorrelation times. This can lead to simulation runs that are…
We present a lattice Monte Carlo algorithm based on the one originally proposed by Maggs and Rossetto for simulating electrostatic interactions in inhomogeneous dielectric media. The original algorithm is known to produce attractive…
Metropolis Monte Carlo simulation is a powerful tool for studying the equilibrium properties of matter. In complex condensed-phase systems, however, it is difficult to design Monte Carlo moves with high acceptance probabilities that also…
We consider Monte Carlo simulations of classical spin models of statistical mechanics using the massively parallel architecture provided by graphics processing units (GPUs). We discuss simulations of models with discrete and continuous…
Implementation of basic local Monte-Carlo algorithms on ATI Graphics Processing Units (GPU) is investigated. The Ising model and pure SU(2) gluodynamics simulations are realized with the Compute Abstraction Layer (CAL) of ATI Stream…
We develop a parallel rejection algorithm to tackle the problem of low acceptance in Monte Carlo methods, and apply it to the simulation of the hopping conduction in Coulomb glasses using Graphics Processing Units, for which we also…
Monte Carlo computer simulations are virtually the only way to analyze the thermodynamic behavior of a system in a precise way. However, the various existing methods exhibit extreme differences in their efficiency, depending on model…
We investigate the properties of membranes under tension by Monte-Carlo simulations of a generic coarse-grained model for lipid bilayers. We give a comprising overview of the behavior of several membrane characteristics, such as the area…
Parallel tempering simulates at many quark masses simultaneously, by changing the mass during the simulation while remaining in equilibrium. The algorithm is faster than pure HMC if more than one mass is needed, and works better the smaller…
Among random sampling methods, Markov Chain Monte Carlo algorithms are foremost. Using a combination of analytical and numerical approaches, we study their convergence properties towards the steady state, within a random walk Metropolis…
Optical trapping techniques are an efficient way to probe limited quantities of rare isotopes. In order to achieve the highest possible measurement precision, it is critical to optimize the optical trapping efficiency. This work presents…
In this paper we propose a novel and general approach to design semi-implicit methods for the simulation of fluid-structure interaction problems in a fully Eulerian framework. In order to properly present the new method, we focus on the…
Population Monte Carlo simulations in the form commonly referred to as population annealing can serve as a useful meta-algorithm for simulating systems with complex free-energy landscapes. In the present paper we provide an easily…
We propose a novel computational strategy to study the glass transition of molecular fluids. Our approach combines the construction of simple yet realistic models with the development of Monte Carlo algorithms to accelerate equilibration…
Computer modeling of multicellular systems has been a valuable tool for interpreting and guiding in vitro experiments relevant to embryonic morphogenesis, tumor growth, angiogenesis and, lately, structure formation following the printing of…
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…
While boundary plasmas in present-day tokamaks generally fall in a fluid regime, neutral species near the boundary often require kinetic models due to long mean-free-paths compared to characteristic spatial scales in the region. Monte-Carlo…
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…
After developing an appropriate iteration procedure for the determination of the parameters, the method of simulated tempering has been successfully applied to the 2D Ising spin glass. The reduction of the slowing down is comparable to that…
In complex systems with many degrees of freedom such as spin glass and biomolecular systems, conventional simulations in canonical ensemble suffer from the quasi-ergodicity problem. A simulation in generalized ensemble performs a random…