Abstract
To compare the results of two slightly different situations in a given problem solved by the Monte Carlo method it is convenient to use the same random numbers in both cases. To facilitate the reproducibility of the random numbers used a method based on two pseudo-random number generators may be adopted. In this paper the method is discussed with reference to multiplicative congruential generators, the influence of the initial value on a random sequence obtained by a given multiplier being examined first.
Similar content being viewed by others
References
Cipolla, M.: Teoria dei numbei, Analisi indeterminata, Enciclopedia delle Matematiche Elementari (L. Berzolari et al., ed.), Vol. 1, Parte I, p. 269–342. Milano: U. Hoepli 1930.
Hutchinson, D. W.: A new uniform pseudorandom number generator. Comm. ACM9, 432–433 (1966).
Lehmer, D. H.: Mathematical methods in large-scale computing units. Ann. Comp. Lab. Harvard Univ.26, 141–146 (1951).
Richtmyer, R. D., Norton, R. van, Wolfe, A.: The Monte Carlo calculation of resonance capture in reactor lattices. Proc. 2nd International Geneva Conference on the Peaceful Uses of Atomic Energy16, P/2489, 180–186 (1958).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Cenacchi, G., de Matteis, A. Pseudo-random numbers for comparative Monte Carlo calculations. Numer. Math. 16, 11–15 (1970). https://doi.org/10.1007/BF02162402
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02162402