GENERATION OF PSEUDORANDOM NUMBERS
Abstract
The article is devoted to algorithms for generating pseudorandom numbers according to certain laws of distribution of random numbers. The problems of generation of pseudorandom uniformly distributed integers of large size and real numbers, real numbers in accordance with the laws of exponential and uniform distribution.
About the Author
Gladskih Yur’evich Gladkih
Tula State Lev Tolstoy Pedagogical University
Russian Federation
Russian Federation
References
1. Gentle, Random Number Generation and Monte Carlo Methods / Gentle E. James. 2nd ed. , corr. Springer, 2005. 381 p.
2. P. L’Ecuyer. Tables of linear congruential generators of different sizes and good lattice structure // MATHEMATICS OF COMPUTATION January 1999 Number 225 (68), p. 249-260.
3. ISO/IEC 14882:2011 Information technology - Programming languages - C++ A Proposal to Add an Extensible Random Number Facility to the Standard Library (Revision 2).
4. Вентцель Е. С. Теория вероятностей: учебник для вузов. 6-е изд. стер. М.: Высш. шк., 1999. 576 c.
5. Стефенс Д. Р C++ Сборник рецептов / Д. Р. Стефенс, К. Диггинс, Д. Турканис, Д. Когсуэлл, Пер. с анг. М.: КУДИЦ-ПРЕСС, 2007. 624 с.
Review
For citations:
Gladkih G.Yu. GENERATION OF PSEUDORANDOM NUMBERS. Modern Science and Innovations. 2018;(1):22-26. (In Russ.)
Views:
60
Email this article 