A Fast and Efficient Algorithm for Slater Determinant Updates in Quantum Monte Carlo Simulations

Details A Fast and Efficient Algorithm for Slater Determinant Updates in Quantum Monte Carlo Simulations A Fast and Efficient Algorithm for Slater Determinant Updates in Quantum Monte Carlo Simulations

2009-06-23

arxiv.org/abs/0906.4354v1

J. Chem. Phys. 130 204105 (2009)

Physics

Condensed Matter

Materials Science

Scientific paper

10.1063/1.3142703

We present an efficient low-rank updating algorithm for updating the trial wavefunctions used in Quantum Monte Carlo (QMC) simulations. The algorithm is based on low-rank updating of the Slater determinants. In particular, the computational complexity of the algorithm is O(kN) during the k-th step compared with traditional algorithms that require O(N^2) computations, where N is the system size. For single determinant trial wavefunctions the new algorithm is faster than the traditional O(N^2) Sherman-Morrison algorithm for up to O(N) updates. For multideterminant configuration-interaction type trial wavefunctions of M+1 determinants, the new algorithm is significantly more efficient, saving both O(MN^2) work and O(MN^2) storage. The algorithm enables more accurate and significantly more efficient QMC calculations using configuration interaction type wavefunctions.

Affiliated with

Also associated with

No associations

Rating

A Fast and Efficient Algorithm for Slater Determinant Updates in Quantum Monte Carlo 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 A Fast and Efficient Algorithm for Slater Determinant Updates in Quantum Monte Carlo Simulations, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Fast and Efficient Algorithm for Slater Determinant Updates in Quantum Monte Carlo Simulations will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-105287