2005
DOI: 10.1103/physreve.72.016715
|View full text |Cite
|
Sign up to set email alerts
|

Monte Carlo algorithms for charged lattice gases

Abstract: 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 this regime.

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
17
0

Year Published

2006
2006
2023
2023

Publication Types

Select...
5
3

Relationship

1
7

Authors

Journals

citations
Cited by 17 publications
(17 citation statements)
references
References 21 publications
0
17
0
Order By: Relevance
“…10 Interested readers are encouraged to consult this original reference and additional references for further development and improvement of the method. 11,12,18 Because our model is the rst application to polymers, we reproduce some of the key steps in the derivation. We start with the electrostatic energy functional in the form of…”
mentioning
confidence: 99%
See 1 more Smart Citation
“…10 Interested readers are encouraged to consult this original reference and additional references for further development and improvement of the method. 11,12,18 Because our model is the rst application to polymers, we reproduce some of the key steps in the derivation. We start with the electrostatic energy functional in the form of…”
mentioning
confidence: 99%
“…For computational efficiency, we adopt a lattice formulation by combining the bond uctuation model (BFM), 7,8 a standard lattice Monte Carlo method for polymers, 9 with a local algorithm developed by Maggs et al [10][11][12] for computing the electrostatic interactions. This algorithm requires a computational effort of order N, 10 and can be directly implemented on a lattice, making it naturally compatible with lattice models of polymers.…”
mentioning
confidence: 99%
“…Sampling the partition function requires updates generating fluctuations of the variables, {r j }, E and σ. We refer the reader to previous work 6,8,20 for particle updates and bulk field updates. We note that the demonstration requires an integral over the surface charge σ; thus even if charges in the volume are discrete those on surfaces should be sampled continuously.…”
Section: Algorithmmentioning
confidence: 99%
“…A lattice Monte Carlo algorithm, based on the use of the electric field E(r) for Coulomb systems, was introduced by Maggs and collaborators. [17][18][19] The field E in this algorithm is purely "local" on an interpolating grid. Although a benchmark study of the molecular dynamics version of this method based on a single core revealed no speed advantages over traditional fast electrostatic (Fourier-based) algorithms, excellent efficiencies are obtained on parallel clusters.…”
Section: Introductionmentioning
confidence: 99%
“…The local Monte Carlo simulation algorithm proposed by Maggs and co-workers [17][18][19] applies Metropolis sampling a) Electronic mail: zgw@caltech.edu together with Gauss's law constraint for a fluctuating electric field. The configuration sampling involves two kinds of updates: (1) the electric field on the grid for a given particle configuration, subject to the constraint of Gauss's law, and (2) the position of the charged particles, also subject to the constraint of Gauss's law.…”
Section: Introductionmentioning
confidence: 99%