Ran |
public class Ran19937 : RandomGenerator
The Ran19937 type exposes the following members.
| Name | Description | |
|---|---|---|
| Maximum | The maximum value of the random number which can be returned. (Inherited from RandomGenerator) | |
| Seed | Gets the current seed value. (Inherited from RandomGenerator) |
| Name | Description | |
|---|---|---|
| Equals | Determines whether the specified object is equal to the current object. (Inherited from Object) | |
| Finalize | Allows an object to try to free resources and perform other cleanup operations before it is reclaimed by garbage collection. (Inherited from Object) | |
| GetHashCode | Serves as the default hash function. (Inherited from Object) | |
| GetType | Gets the Type of the current instance. (Inherited from Object) | |
| Long | The generation function. (Overrides RandomGeneratorLong) | |
| MemberwiseClone | Creates a shallow copy of the current Object. (Inherited from Object) | |
| ToString | Returns a string that represents the current object. (Inherited from Object) |
| Name | Description | |
|---|---|---|
| max_val | Uniform long int values within [0...max_val]. (Inherited from RandomGenerator) | |
| seed | The seed of the random generator. (Inherited from RandomGenerator) |
The Mersenne Twister, a new variant of the twisted GFSR (``TGFSR'')
by Matsumoto and Nishimura, sets new standards for the period, quality
and speed of random number generators. The incredible period
is 2^19937 - 1, a number with about 6000 decimal digits; the 32-bit random
numbers exhibit best possible equidistribution properties in dimensions up
to 623; and it's fast, very fast.
A paper on the Mersenne Twister has been submitted to ACM TOMACS.
May 1997: First empirical results for this generator are available
on the news page of the pLab group at the University of Salzburg's
Mathematics Department. WWW address: "http://random.mat.sbg.ac.at/news/".
The original code has been adapted to the general random generator class
interface of Matpack, 1997.
----------------------------------------------------------------------------//
Original Notes of the authors:
A C-program for MT19937B: Integer Version
genrand() generate one pseudorandom integer which is
uniformly distributed among the 32bit unsigned integers
sgenrand(seed) set initial values to the working area of 624 words.
sgenrand(seed) must be called once before calling genrand()
(seed is any integer except 0).
LICENCE CONDITIONS:
Matsumoto and Nishimura consent to GNU General
Public Licence for this code.
NOTE:
When you use it in your program, please let Matsumoto
(matumoto@math.keio.ac.jp) know it.