Zero-Variance Principle for Monte Carlo Algorithms
Authors:
- 6 December 1999
- journal article
- research article
- Published by American Physical Society (APS) in Physical Review Letters
- Vol. 83 (23) , 4682-4685
Abstract
We present a general approach to greatly increase at little cost the efficiency of Monte Carlo algorithms. To each observable to be computed we associate a renormalized observable (improved estimator) having the same average but a different variance. By writing down the zero-variance condition a fundamental equation determining the optimal choice for the renormalized observable is derived (zero-variance principle for each observable separately). We show, with several examples including classical and quantum Monte Carlo calculations, that the method can be very powerful.Keywords
All Related Versions
This publication has 12 references indexed in Scilit:
- Quantum Monte Carlo loop algorithm for themodelPhysical Review B, 1998
- A quantum Monte Carlo approach to many-body physicsPhysics Reports, 1992
- Correlated Monte Carlo wave functions for the atoms He through NeThe Journal of Chemical Physics, 1990
- Asymptotic freedom and mass generation in the O(3) nonlinear σ-modelNuclear Physics B, 1990
- Nonuniversal critical dynamics in Monte Carlo simulationsPhysical Review Letters, 1987
- A measurement of the string tension near the continuum limitPhysics Letters B, 1983
- Monte Carlo study of weighted percolation clusters relevant to the Potts modelsPhysical Review B, 1983
- Roothaan-Hartree-Fock atomic wavefunctionsAtomic Data and Nuclear Data Tables, 1974
- Equation of State Calculations by Fast Computing MachinesThe Journal of Chemical Physics, 1953
- Crystal Statistics. I. A Two-Dimensional Model with an Order-Disorder TransitionPhysical Review B, 1944