The generation of exponentially distributed random numbers on a digital computer
β Scribed by G.A. Ososkov
- Publisher
- Elsevier Science
- Year
- 1967
- Weight
- 305 KB
- Volume
- 7
- Category
- Article
- ISSN
- 0041-5553
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Parallel generation of random numbers on distributed memory multiprocessors is discussed. Conditions required for such a generator are enumerated, and a method based on a shift register sequence of random numbers is shown to satisfy all of these conditions. The method distributes to processors nonov
We describe a vectorizable implementation of a numerical inversion method to generate approximately Gaussian distributed random numbers. This method is, on the CRAY-YMP computer, several times faster than the standard Box-Muller-Wiener algorithm. The validity of the approximation is discussed. (1)
A new method for the high-speed generation of random numbers with arbitrary distributions is proposed. The method stores random numbers in two memories, and then picks out two random numbers and assembles them, resulting in a new random number. When the method is. realized with Fortran, the method c