The fast sampling algorithm for Lie-Trotter products

Details The fast sampling algorithm for Lie-Trotter products The fast sampling algorithm for Lie-Trotter products

2004-11-02

arxiv.org/abs/cond-mat/0411048v2

Phys. Rev. E 71, 045701 (2005)

Physics

Condensed Matter

Statistical Mechanics

4 pages, 1 figure; fast rejection from Phys. Rev. Letts; transfered to PRE as a Rapid Communication. Eq. 6 to 10 contained som

Scientific paper

10.1103/PhysRevE.71.045701

A fast algorithm for path sampling in path integral Monte Carlo simulations is proposed. The algorithm utilizes the Levy-Ciesielski implementation of Lie-Trotter products to achieve a mathematically proven computational cost of n*log_2(n) with the number of time slices n, despite the fact that each path variable is updated separately, for reasons of optimality. In this respect, we demonstrate that updating a group of random variables simultaneously results in loss of efficiency.

Affiliated with

Also associated with

No associations

Rating

The fast sampling algorithm for Lie-Trotter products 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 The fast sampling algorithm for Lie-Trotter products, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The fast sampling algorithm for Lie-Trotter products will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-339742