randu

2
From Wikipedia, the free encyclopedia Three-dimensional plot of 100,000 values generated with RANDU. Each point represents 3 consecutive pseudorandom values. It is clearly seen that the points fall in 15 two-dimensional planes . RANDU is a linear congruential pseudorandom number generator of the Park–Miller type , which has been used since the 1960s. [1] It is defined by the recurrence : with the initial seed number, as an odd number . It generates pseudorandom integers which are uniformly distributed in the interval[1, 2 31 − 1], but in practical applications are often mapped into pseudorandom rationals in the interval (0, 1), by the formula: . It is widely considered to be one of the most ill-conceived random number generators ever designed. [citation needed ] It fails the spectral test badly for dimensions greater than 2, and every integer result is odd. However, at least eight low-order bits are dropped when converted to single-precision floating- point. The reason for choosing these particular values is that with a 32-bit-integer word size, the arithmetic of mod 2 31 and calculations could be done quickly, using special features of some computer hardware. We'll get right to it: Today we ask you to help Wikipedia. We survive on donations averaging about 50 lei. If we all gave 10 lei, the fundraiser would be over in an hour.

Upload: georgian-gradea

Post on 18-Dec-2015

212 views

Category:

Documents


0 download

DESCRIPTION

randu

TRANSCRIPT

From Wikipedia, the free encyclopedia

Three-dimensional plotof 100,000 values generated with RANDU. Each point represents 3 consecutive pseudorandom values. It is clearly seen that the points fall in 15two-dimensionalplanes.RANDUis alinear congruentialpseudorandom number generatorof theParkMiller type, which has been used since the 1960s.[1]It is defined by therecurrence:

with the initial seed number,as anodd number. It generates pseudorandomintegerswhich areuniformly distributedin the interval[1, 231 1], but in practical applications are often mapped into pseudorandomrationalsin the interval(0, 1), by the formula:.It is widely considered to be one of the most ill-conceived random number generators ever designed.[citation needed]It fails thespectral testbadly for dimensions greater than 2, and every integer result is odd. However, at least eight low-order bits are dropped when converted to single-precision floating-point.The reason for choosing these particular values is that with a 32-bit-integer word size, the arithmetic of mod 231andcalculations could be done quickly, using special features of some computer hardware.We'll get right to it: Today we ask you to help Wikipedia. We survive on donations averaging about50 lei. If we all gave10 lei, the fundraiser would be over in an hour.DONATE NOWProblems with multiplier and modulus[edit]To show the problem with these values, of multiplier 65539 and modulus 231, consider the following calculation where every term should be taken mod 231. Start by writing the recursive relation as:

which becomes, after expanding the quadratic factor:

because232mod 231= 0and allows us to show the correlation between three points as:

As a result of this correlation, the points in three-dimensional space (mod 231) fall in 15 planes.[2]As a result of the wide use of RANDU in the early 1970s, many results from that time are seen as suspicious.[3]