๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Rounding errors in random number generators

โœ Scribed by A Compagner; A.S Berdnikov; S.B Turtia; A Larionov


Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
723 KB
Volume
106
Category
Article
ISSN
0010-4655

No coin nor oath required. For personal study only.

โœฆ Synopsis


The deviations of the cumulative distribution function from the uniform one for the pseudorandom floating point values produced by integer arithmetics are discussed. It is shown that the conversion from fixed point values into floating point values introduces specific artefacts even when the integer arithmetics guarantees ideal uniformity. Two type of defects are considered: the appearance of the value 1.0 among pseudorandom values, and the sharp jumps of uniformity at the level of discreteness which corresponds to the computer representation of the floating point values. The non-uniformity at small level of discreteness can be neglected in most cases, but the appearance of the parasitic value 1.0 where nobody expects it can be very dangerous if special precautions are not taken by the user. Both defects are demonstrated using the random number generator from the system library of the Microsoft Power Station Fortrat, !.0.


๐Ÿ“œ SIMILAR VOLUMES


Random-number generators
โœ Alan B. Forsythe ๐Ÿ“‚ Article ๐Ÿ“… 1968 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 217 KB

A commonly used uniform random-number generator is examined in light of a genetic-simulation problem. Although this generator is often useful, it proves defective in this case. The author suggests that any proposed generator be checked for the properties needed by the simulation problem at hand.

Random number generators for microcomput
โœ Wilfred Rosenbaum; John Syrotuik; Richard Gordon ๐Ÿ“‚ Article ๐Ÿ“… 1983 ๐Ÿ› Elsevier Science โš– 331 KB

The feasibility of random number generation using microcomputers is discussed and the appropriateness of alternative algorithms is evaluated on the basis of several criteria of statistical randomness. The relative deficiencies of each algorithm are cited and a modified Fibonacci generator is recomme