A Fast algorithm for generating a uniform distribution inside a high dimensional polytope - INSPIRE

DataBETA

A Fast algorithm for generating a uniform distribution inside a high dimensional polytope

Andre van Hameren
(
- Nijmegen U.
)
,
Ronald Kleiss
(
- Nijmegen U.
)

Mar, 2000

6 pages

Published in:

Comput.Phys.Commun. 133 (2000) 1-5

e-Print:

physics/0003078 [physics]

DOI:

10.1016/S0010-4655(00)00157-0

View in:

ADS Abstract Service

reference search5 citations

Citations per year

Abstract:

We describe a uniformly fast algorithm for generating points \vec{x} uniformly in a hypercube with the restriction that the difference between each pair of coordinates is bounded. We discuss the quality of the algorithm in the sense of its usage of pseudo-random source numbers, and present an interesting result on the correlation between the coordinates.

References(4)

Figures(0)

[1]

SARGE: An Algorithm for generating QCD antennas

Petros D. Draggiotis
(
- Nijmegen U.
)
,
Andre van Hameren
(
- Nijmegen U.
)
,
Ronald Kleiss
(
- Nijmegen U.
)

- Phys.Lett.B 483 (2000) 124-130
•
e-Print:
- hep-ph/0004047
•
DOI:
- 10.1016/S0370-2693(00)00532-3

[2]

A New Monte Carlo Treatment of Multiparticle Phase Space at High-energies

- Comput.Phys.Commun. 40 (1986) 359
•
DOI:
- 10.1016/0010-4655(86)90119-0

[3]

Non-Uniform Random Variate Generation, ( 1986)

L. Devroye

[4]

The Art of Computer Programming, Vol.2. 2d ed. (Princeton, 1991)

D.E. Knuth