Jump to content

VEGAS algorithm

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Unknown (talk | contribs) at 03:17, 20 October 2003 (first entry). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

A method for reducing error in Monte Carlo simulation by using a known or approximate probability distribution function to concentrate the search in those areas of the graph that make the greatest contribution to the final integral.

See also:

G.P. Lepage, A New Algorithm for Adaptive Multidimensional Integration, Journal of Computational Physics 27, 192-203, (1978) G.P. Lepage, VEGAS: An Adaptive Multi-dimensional Integration Program, Cornell preprint CLNS 80-447, March 1980