|
This article is cited in 4 scientific papers (total in 4 papers)
General numerical methods
Unreliability of available pseudorandom number generators
A. A. Belovab, N. N. Kalitkinc, M. A. Tintula a Faculty of Physics, Lomonosov Moscow State University, Moscow, 119991 Russia
b RUDN University, Moscow, 115419 Russia
c Federal Research Center Keldysh Institute of Applied Mathematics, Russian Academy of Sciences, Moscow, 125047 Russia
Abstract:
The problem of generating sequences of uniformly distributed pseudorandom numbers is considered. A simple visual test for estimating the randomness of numbers in a sequence is used. The test shows that the most popular modern random number generators, such as the Mersenne Twister, linear congruential sequence, and others, yield unsatisfactory results. Accordingly, the generation of good generators remains an open problem, and results of computing stochastic processes (molecular dynamics method, etc.) have to be treated with caution.
Key words:
Monte Carlo methods, pseudorandom numbers, testing.
Received: 07.02.2020 Revised: 07.02.2020 Accepted: 07.07.2020
Citation:
A. A. Belov, N. N. Kalitkin, M. A. Tintul, “Unreliability of available pseudorandom number generators”, Zh. Vychisl. Mat. Mat. Fiz., 60:11 (2020), 1807–1814; Comput. Math. Math. Phys., 60:11 (2020), 1747–1753
Linking options:
https://www.mathnet.ru/eng/zvmmf11153 https://www.mathnet.ru/eng/zvmmf/v60/i11/p1807
|
Statistics & downloads: |
Abstract page: | 114 | References: | 31 |
|