×

Multiply schemes and shuffling. (English) Zbl 0322.65004


MSC:

65C10 Random number generation in numerical analysis
65C05 Monte Carlo methods
11K06 General theory of distribution modulo \(1\)
60E05 Probability distributions: general theory
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Joel N. Franklin, Deterministic simulation of random processes, Math. Comp. 17 (1963), 28 – 59. · Zbl 0124.34601
[2] Donald E. Knuth, The art of computer programming. Vol. 2: Seminumerical algorithms, Addison-Wesley Publishing Co., Reading, Mass.-London-Don Mills, Ont, 1969. · Zbl 0191.18001
[3] G. P. LEARMONTH & P. A. W. LEWIS, Statistical Test of Some Widely Used and Recently Proposed Uniform Random Number Generators, Proc. Conf. on Comput. Sci. and Statistics, Western Periodicals Co., North Hollywood, Calif., 1973, pp. 163-171.
[4] George Marsaglia and T. A. Bray, One-line random number generators and their use in combinations, Comm. ACM 11 (1968), 757 – 759. · Zbl 0164.18802 · doi:10.1145/364139.364158
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.