Random number generators with period divisible by a Mersenne prime (original) (raw)

Communication Dans Un Congrès Année : 2003

Résumé

Pseudo-random numbers with long periods and good statistical properties are often required for applications in computational finance. We consider the requirements for good uniform random number generators, and describe a class of generators whose period is a Mersenne prime or a small multiple of a Mersenne prime. These generators are based on ``almost primitive'' trinomials, that is trinomials having a large primitive factor. They enable very fast vector/parallel implementations with excellent statistical properties.

Dates et versions

inria-00099723 , version 1 (26-09-2006)

Identifiants

Citer

Richard P. Brent, Paul Zimmermann. Random number generators with period divisible by a Mersenne prime. International Conference on Computational Science and its Applications - ICCSA'2003, 2003, Montreal, Canada, pp.1-10. ⟨inria-00099723⟩

309 Consultations

0 Téléchargements