The revised recursive reduction for efficiently generating random numbers

Authors
Citation
Hc. Tang, The revised recursive reduction for efficiently generating random numbers, INT J COM M, 77(2), 2001, pp. 181-187
Citations number
27
Categorie Soggetti
Engineering Mathematics
Journal title
INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS
ISSN journal
00207160 → ACNP
Volume
77
Issue
2
Year of publication
2001
Pages
181 - 187
Database
ISI
SICI code
Abstract
One of the general methods for implementing a multiple recursive generator is recursive reduction method (RRM). This paper provides an analysis of its number of operations. We also propose a new method that modifies the RRM b y considering the stop conditions and the order of multiplier and multiplic and. Some empirical comparisons reveal that the new algorithm is more effic ient with a reduction of iterative numbers in the range of 13.1416%-20.5118 % depending on the moduli and multipliers being used.