The revised recursive reduction for efficiently generating random numbers

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 by considering the stop conditions and the order of multiplier and multiplicand. Some empirical comparisons reveal that the new algorithm is more efficient with a reduction of iterative numbers in the range of 13.1416%-20.5118% depending on the moduli and multipliers being used.

Keywords:

• Multiple recursive generator
• Random number
• Recursive reduction

C.R. Categories::

• G.3
• I.1.2

^∗ [email protected]

^∗ [email protected]

Notes

^∗ [email protected]