Algorithms for faster and larger dynamic Metropolis simulations

Details Algorithms for faster and larger dynamic Metropolis simulations Algorithms for faster and larger dynamic Metropolis simulations

2003-11-05

arxiv.org/abs/cond-mat/0311108v1

AIP Conference Proceedings Vol. 690, 241 (2003)

Physics

Condensed Matter

Statistical Mechanics

8 pages, 3 figures, to appear in the AIP Conference Proceedings "The Monte Carlo method in physical sciences: celebrating the

Scientific paper

In dynamic Monte Carlo simulations, using for example the Metropolis dynamic, it is often required to simulate for long times and to simulate large systems. We present an overview of advanced algorithms to simulate for larger times and to simulate larger systems. The longer-time algorithm focused on is the Monte Carlo with Absorbing Markov Chains (MCAMC) algorithm. It is applied to metastability of an Ising model on a small-world network. Simulations of larger systems often require the use of non-trivial parallelization. Non-trivial parallelization of dynamic Monte Carlo is shown to allow perfectly scalable algorithms, and the theoretical efficiency of such algorithms is described.

Affiliated with

Also associated with

No associations

Rating

Algorithms for faster and larger dynamic Metropolis simulations does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Algorithms for faster and larger dynamic Metropolis simulations, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Algorithms for faster and larger dynamic Metropolis simulations will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-627914