Monte Carlo algorithms for charged lattice gases
نویسندگان
چکیده
منابع مشابه
Monte Carlo algorithms for charged lattice gases.
We consider Monte Carlo algorithms for the simulation of charged lattice gases with purely local dynamics. We study the mobility of particles as a function of temperature and show that the poor mobility of particles at low temperatures is due to "trails" or "strings" left behind after particle motion. We introduce modified updates which substantially improve the efficiency of the algorithm in t...
متن کاملFermionic Monte Carlo Algorithms for Lattice Qcd
The increase with time of computer resources devoted to simulations of full QCD is spectacular. Yet the reduction of systematic errors is comparatively slow. This is due to the algorithmic complexity of the problem. I review, in elementary terms, the origin of this complexity, and estimate it for 3 exact fermion algorithms. There is a qualitative difference between quenched QCD, which considers...
متن کاملMonte Carlo simulations of two-dimensional hard core lattice gases.
Monte Carlo simulations are used to study lattice gases of particles with extended hard cores on a two-dimensional square lattice. Exclusions of one and up to five nearest neighbors (NN) are considered. These can be mapped onto hard squares of varying side length, lambda (in lattice units), tilted by some angle with respect to the original lattice. In agreement with earlier studies, the 1NN exc...
متن کاملMonte Carlo study of 2D bosonic gases
We consider a bidimensional system of few identical bosons trapped in a harmonic well that interact through a two-body gaussian potential. We discuss the ground state energy using a mean-field approximation and introducing pair correlations. To solve the many-body problem we used Monte Carlo techniques: Variational and Diffusion Monte Carlo. We find that two-body correlations lower significantl...
متن کاملPopulation Monte Carlo algorithms
We give a cross-disciplinary survey on “population” Monte Carlo algorithms. In these algorithms, a set of “walkers” or “particles” is used as a representation of a high-dimensional vector. The computation is carried out by a random walk and split/deletion of these objects. The algorithms are developed in various fields in physics and statistical sciences and called by lots of different terms – ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review E
سال: 2005
ISSN: 1539-3755,1550-2376
DOI: 10.1103/physreve.72.016715