Add to ORKGWe propose a system of multiple recursive generators of modulus p and order k where all nonzero coefficients of the recurrence are equal. The advantage of this property is that a single multipli- cation is needed to compute the recurrence, so the generator would run faster than the general case. For p = 231 − 1, the most popular modulus used, we provide tables of specific parameter values yielding maximum period for recurrence of order k = 102 and 120. For p = 231 55719 and k = 1511, we have found generators with a period length approximately 1014100.5
On-linear multiple recursive congruential pseudo random number generator with prime modulus p is int...
Linear congruential random number generators must have large moduli to attain maximum periods, but t...
Pseudo-random numbers with long periods and good statistical properties are often required for appli...
We propose a system of multiple recursive generators of modulus p and order k where all nonzero coef...
Deng and Xu [2003] proposed a system of multiple recursive generators of prime modulus p and order k...
The performance of a maximum-period multiple recursive generator (MRG) depends on the choices of the...
AbstractUtilizing some results in number theory, we propose an efficient method to speed up the comp...
To speed up the process of performing a large statistical simulation study, it is natural and common...
Pseudo-random numbers (PRNs) are the basis for almost any statistical simulation and this depends la...
AbstractTo generate random numbers (RNs) of long period for large scale simulation studies, the usua...
Fast uniform random number generators with extremely long periods have been defined and implemented ...
Classical random number generators like Linear Congruential Generators (LCG) and Multiple Recursive ...
AbstractThis paper considers an approach to generating uniformly distributed pseudo-random numbers w...
DX-k, proposed by Deng and Xu [2003], is a special class of Multiple Recursive Generators (MRGs) whe...
Large order, maximum period multiple recursive generators (MRGs) with few nonzero terms (e.g., DX-k-...
On-linear multiple recursive congruential pseudo random number generator with prime modulus p is int...
Linear congruential random number generators must have large moduli to attain maximum periods, but t...
Pseudo-random numbers with long periods and good statistical properties are often required for appli...
We propose a system of multiple recursive generators of modulus p and order k where all nonzero coef...
Deng and Xu [2003] proposed a system of multiple recursive generators of prime modulus p and order k...
The performance of a maximum-period multiple recursive generator (MRG) depends on the choices of the...
AbstractUtilizing some results in number theory, we propose an efficient method to speed up the comp...
To speed up the process of performing a large statistical simulation study, it is natural and common...
Pseudo-random numbers (PRNs) are the basis for almost any statistical simulation and this depends la...
AbstractTo generate random numbers (RNs) of long period for large scale simulation studies, the usua...
Fast uniform random number generators with extremely long periods have been defined and implemented ...
Classical random number generators like Linear Congruential Generators (LCG) and Multiple Recursive ...
AbstractThis paper considers an approach to generating uniformly distributed pseudo-random numbers w...
DX-k, proposed by Deng and Xu [2003], is a special class of Multiple Recursive Generators (MRGs) whe...
Large order, maximum period multiple recursive generators (MRGs) with few nonzero terms (e.g., DX-k-...
On-linear multiple recursive congruential pseudo random number generator with prime modulus p is int...
Linear congruential random number generators must have large moduli to attain maximum periods, but t...
Pseudo-random numbers with long periods and good statistical properties are often required for appli...