English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
  DetailsSummary

Released
Book Chapter

Accelerated Algorithms 2

MPS-Authors
/persons/resource/persons47820

Dünweg,  Burkhard
MPI for Polymer Research, Max Planck Society;

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available
Citation

Dünweg, B. (2003). Accelerated Algorithms 2. In B. Dünweg, D. P. Landau, & A. Milchev (Eds.), Computer Simulations of Surfaces and Interfaces (pp. 209-222). Dordrecht [et al.]: Kluwer Academic Publishers.


Cite as: https://hdl.handle.net/11858/00-001M-0000-000F-642D-6
Abstract
The problem of critical slowing down is the appearance of a very long (diverging) correlation time associated with a corresponding apperance of a diverging correlation lenght. This is elucidated by a trivially solvable model, the one-dimensional Gaussian model. The general strategy to fight this effect, in order to sample phase space more efficiently, is to update large lenght scales with artificially high rates.This approach is exemplified by the methods of Fourier acceleration, and multigrid simulations. For polymer chains, the long correlations arise directly from the molecular connectivity. Some Monte Carlo algorithms which attack this problem again by non-local moves (dimerization, pivot, slithering snake, connectivity-altering methods) are presented.