de.mpg.escidoc.pubman.appbase.FacesBean
English
 
Help Guide Privacy Policy Disclaimer Contact us
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Book Chapter

Accelerated Algorithms 2

MPS-Authors
http://pubman.mpdl.mpg.de/cone/persons/resource/persons47820

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

Locator
There are no locators available
Fulltext (public)
There are no public fulltexts available
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: http://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.