1982
DOI: 10.1080/01621459.1982.10477775
|View full text |Cite
|
Sign up to set email alerts
|

A Statistical Evaluation of Multiplicative Congruential Random Number Generators with Modulus 231— 1

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
14
0

Year Published

1986
1986
2021
2021

Publication Types

Select...
6
2

Relationship

0
8

Authors

Journals

citations
Cited by 46 publications
(14 citation statements)
references
References 12 publications
0
14
0
Order By: Relevance
“…It is evident that the testing allows critically evaluating the efficiency of three different random number algorithms from a spatial simulation perspective, even if it is not an exhaustive alternative to the wide range of existing uniform generator tests (Fishman and Moore, 1982;Fishman and Moore, 1985;Hopkins, 1983;Knuth, 1981;Marsaglia, 1972).…”
Section: Some Practical Resultsmentioning
confidence: 98%
“…It is evident that the testing allows critically evaluating the efficiency of three different random number algorithms from a spatial simulation perspective, even if it is not an exhaustive alternative to the wide range of existing uniform generator tests (Fishman and Moore, 1982;Fishman and Moore, 1985;Hopkins, 1983;Knuth, 1981;Marsaglia, 1972).…”
Section: Some Practical Resultsmentioning
confidence: 98%
“…However, it should be noted that De Pagnutti (1988, 1990) and Durst (1989) indicate that certain partitions of a single sequence may lead to dependence between the two streams of deviates. In addition, Fishman and Moore (1982) suggest that DURAND, in particular, is not suitable for the production of 2-and 3-vectors. Crosscorrelation problems may also be avoided by using more sophisticated types of generator, such as the one described by Maclaren (1989).…”
Section: Fig 2 Sample Space ( and N 2 = 5 ) For Realisations Of (5)mentioning
confidence: 99%
“…The modulus m for the generator is 2 31 -1 = 2,147,483,647 and the multiplier is 397,204,094. (Fishman and Moore, 1982) This generates a sequence of m -1 distinct integers before repeating, in an order that appears random. To obtain real numbers between 0 and 1, the integer obtained in this way is divided by m.…”
Section: Uniform Distributionmentioning
confidence: 99%