|
Class Summary |
| CombinedLinearCongruentialGenerator |
This class takes a number of simple LinearCongruentialGenerator,
such as Lehmer,
to form one longer period generator by first summing values and then taking modulus. |
| LEcuyer |
This implements the random number generator recommended by L'Ecuyer in 1996. |
| Lehmer |
Lehmer proposed a general linear congruential generator that generates pseudo-random numbers in [0, 1]. |
| MRG |
A Multiple Recursive Generator is a linear congruential generator which takes this form:
xi = (a1 * xi-1 + a2 * xi-2 + ... + ak * xi-k) mod m
ui = xi / m
|