Summary
DX-k, proposed by Deng and Xu [2003], is a special class of multiple Recursive Generators (MRGs) where all nonzero coefficients of the k-th order recurrence are equal. In particular, a DX-k generator requires only up to four nonzero coefficients in its recurrence equation, hence is very efficient in computation. However, a random number generator with few nonzero coefficients has a drawback that, when the k-dimensional state vector is close to the zero vector, the subsequent numbers generated may stay within a neighborhood of zero for quite many of them before they can break away from this near-zero land, a property apparently not desirable in the sense of randomness. Consequently, two generated sequences using the same DX generator with nearly identical initial state vectors may not depart from each other quickly enough. To avoid the above potential problem, we consider MRGs with very few zero coefficients. To make such generators efficient and portable, we propose selecting the same nonzero value for all coefficients (with at most one exception) in the recurrence equation. With this feature, the proposed generators can be implemented efficiently via a higher-order recurrence of few zero coefficients. Note that the new class of generators is an opposite of the DX generators in terms of the number of nonzero coefficients. Several such generators with the maximum period have been found via computer search and presented in the paper for ready implementation.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
J. D. Alanen and D. E. Knuth. Tables of finite fields. Sankhyā, 26:305–328, 1964.
L. Y. Deng. Generalized mersenne prime number and its application to random number generation. In H. Niederreiter, editor, Monte Carlo and Quasi-Monte Carlo Methods 2002, pages 167–180. Springer-Verlag, 2004.
L. Y. Deng. Efficient and portable multiple recursive generators of large order. ACM Transactions on Modeling and Computer Simulation, 15 (1):1–13, 2005.
L. Y. Deng. Issues on computer search for large order multiple recursive generators. In S. Heinrich, A. Keller, and H. Niederreiter, editors, Monte Carlo and Quasi-Monte Carlo Methods 2006, pages 251–261. Springer-Verlag, 2007.
L. Y. Deng, H. Li, and J. J. H. Shiau. Efficient and portable multiple recursive generators of large order with many nonzero terms. preprint, 2005.
L. Y. Deng, D. K. J. Lin, J. Wang, and Y. Yuan. Statistical justification of combination generators. Statistica Sinica, 7:993–1003, 1997.
L. Y. Deng and H. Xu. A system of high-dimensional, efficient, long-cycle and portable uniform random number generators. ACM Transactions on Modeling and Computer Simulation, 13(4):299–309, 2003.
D. E. Knuth. The Art of Computer Programming, volume 2: Seminumerical Algorithms. Addison-Wesley, Reading, MA., third edition, 1998.
P. L'Ecuyer, F. Blouin, and R. Couture. A search for good multiple recursive linear random number generators. ACM Transactions on Modeling and Computer Simulation, 3:87–98, 1993.
P. L'Ecuyer. Bad lattice structures for vectors of non-successive values produced by some linear recurrences. INFORMS Journal on Computing, 9:57–60, 1997.
P. L'Ecuyer. Good parameter sets for combined multiple recursive random number generators. Operations Research, 47:159–164, 1999.
D. H. Lehmer. Mathematical methods in large-scale computing units. In Proceedings of the Second Symposium on Large Scale Digital Computing Machinery, pages 141–146, Cambridge, MA., 1951. Harvard University Press.
H. Li. A System of Efficient and Portable Multiple Recursive Generators of Large Order. PhD thesis, University of Memphis, Memphis, TN., U.S.A., 2005.
R. Lidl and H. Niederreiter. Introduction to Finite Fields and Their Applications. Cambridge University Press, Cambridge, MA., revised edition, 1994.
P. L'Ecuyer and R. Touzin. On the deng-lin random number generators and related methods. Statistical Computing, 14:5–9, 2004.
G. Marsaglia. Random numbers fall mainly in the planes. In Proceedings of the National Academy of Sciences, volume 61, pages 25–28, 1968.
G. Marsaglia. The Marsaglia random number CDROM including the DIEHARD battery of tests of randomness. http://stat.fsu.edu/pub/diehard, 1996.
M. Matsumoto and T. Nishimura. Mersenne twister: A 623-dimensionally equidistributed uniform pseudo-random number generator. ACM Transactions on Modeling and Computer Simulation, 8(1):3–30, 1998.
F. Panneton, P. L'Ecuyer, and M. Matsumoto. Improved long-period generators based on linear recurrences modulo 2. ACM Transactions on Mathematical Software, 32(1):1–16, 2006.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Deng, LY., Li, H., Shiau, JJ., Tsai, GH. (2008). Design and Implementation of Efficient and Portable Multiple Recursive Generators with Few Zero Coefficients. In: Keller, A., Heinrich, S., Niederreiter, H. (eds) Monte Carlo and Quasi-Monte Carlo Methods 2006. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74496-2_15
Download citation
DOI: https://doi.org/10.1007/978-3-540-74496-2_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74495-5
Online ISBN: 978-3-540-74496-2
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)