Kapfer Krauth 2016

From Werner KRAUTH

(Difference between revisions)
Jump to: navigation, search
Revision as of 09:02, 28 June 2016
Werner (Talk | contribs)
(Illustration)
← Previous diff
Revision as of 09:09, 28 June 2016
Werner (Talk | contribs)
(Illustration)
Next diff →
Line 10: Line 10:
=Illustration= =Illustration=
-[[Image:Kapfer Krauth Cell Schema.png|left|600px|border|Here are pictures of three bosons on an permutation cycle.]]The cell-veto algorithm is an application of the event-chain paradigm that was developed in 2009, with [[Bernard_Krauth_Wilson_2009|E. P. Bernard and D. B. Wilson]], and much extended together with [[Michel_Kapfer_Krauth_2013|M. Michel and S. C. Kapfer]], where we introduced the factorized Metropolis algorithm. In this algorithm, unlike in 99.9% of all simulation algorithms (Monte Carlo or Molecular dynamics), one does not compute the system energy in order to decide on a change of the physical system, but rather looks at all the interactions separately. So, if a particle '''a''' (the active particle), it has to ask all its partners '''t_1''', '''t_2''', .... (the target particles). If there is only a single veto, the move is not undertaken. What may sound weird is in fact+[[Image:Kapfer Krauth Cell Schema.png|left|600px|border|Here are pictures of three bosons on an permutation cycle.]]The cell-veto algorithm is an application of the event-chain paradigm that was developed in 2009, with [[Bernard_Krauth_Wilson_2009|E. P. Bernard and D. B. Wilson]], and much extended together with [[Michel_Kapfer_Krauth_2013|M. Michel and S. C. Kapfer]], where we introduced the factorized Metropolis algorithm. In this algorithm, unlike in 99.9% of all simulation algorithms (Monte Carlo or Molecular dynamics), one does not compute the system energy in order to decide on a change of the physical system, but rather looks at all the interactions separately. So, if a particle '''a''' (the active particle) wants to move, it has to ask all its partners '''t_1''', '''t_2''', .... (the target particles). If there is only a single veto, the move is rejected. In the cell-veto algorithm (see the right side of the figure), the identification of the rejecting particle is preceeded by that of a veto cell. The advantage of this is that cell vetos can be identified immediately (in a constant number of operations, that is, in O(1)), and then instantly confirmed or infirmed on the particle level.

Revision as of 09:09, 28 June 2016

S. C. Kapfer, W. Krauth Cell-veto Monte Carlo algorithm for long-range systems arXiv:1606.06780 (2016)

Paper

Abstract We present a rigorous efficient event-chain Monte Carlo algorithm for long-range interacting particle systems. Using a cell-veto scheme within the factorized Metropolis algorithm, we compute each single-particle move with a fixed number of operations. For slowly decaying potentials such as Coulomb interactions, screening line charges allow us to take into account periodic boundary conditions. We discuss the performance of the cell-veto Monte Carlo algorithm for general inverse-power-law potentials, and illustrate how it provides a new outlook on one of the prominent bottlenecks in large-scale atomistic Monte Carlo simulations.

Electronic version (from arXiv)

Illustration

Here are pictures of three bosons on an permutation cycle.
The cell-veto algorithm is an application of the event-chain paradigm that was developed in 2009, with E. P. Bernard and D. B. Wilson, and much extended together with M. Michel and S. C. Kapfer, where we introduced the factorized Metropolis algorithm. In this algorithm, unlike in 99.9% of all simulation algorithms (Monte Carlo or Molecular dynamics), one does not compute the system energy in order to decide on a change of the physical system, but rather looks at all the interactions separately. So, if a particle a (the active particle) wants to move, it has to ask all its partners t_1, t_2, .... (the target particles). If there is only a single veto, the move is rejected. In the cell-veto algorithm (see the right side of the figure), the identification of the rejecting particle is preceeded by that of a veto cell. The advantage of this is that cell vetos can be identified immediately (in a constant number of operations, that is, in O(1)), and then instantly confirmed or infirmed on the particle level.
Personal tools