Ran |
public class Ran800 : RandomGenerator
The Ran800 type exposes the following members.
Name | Description | |
---|---|---|
Ran800 | Initializes a new instance of the Ran800 class | |
Ran800(UInt32) | Initializes a new instance of the Ran800 class |
Name | Description | |
---|---|---|
Maximum | The maximum value of the random number which can be returned. (Inherited from RandomGenerator) | |
Seed | The 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 | (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) |
This is a twisted GFSR generator proposed by Matsumoto and Kurita in the ACM Transactions on Modelling and Computer Simulation, Vol. 4, No. 3, 1994, pp. 254-266. This generator has a period of 2^800 - 1 and excellent equidistribution properties up to dimension 25. A TGFSR with a period of more than 2^11000 is currently under construction by M. Matsumoto and T. Nishimura. 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 TT800 : July 8th 1996 Version by M. Matsumoto, email: matumoto@math.keio.ac.jp genrand() generate one pseudorandom number with double precision which is uniformly distributed on [0,1]-interval for each call. One may choose any initial 25 seeds except all zeros. References: (1) ACM Transactions on Modelling and Computer Simulation, Vol. 4, No. 3, 1994, pages 254-266. (2) This is one of the recommended generators in: Pierre L'Ecuyer, "Random Number Generation", Chapter 4 of the "Handbook on Simulation", Ed. Jerry Banks, Wiley, 1997.