Abstract
In this paper a method for the direct generation of pseudo-random vectors is considered. Thereby the n-th pseudo-random vector is recursively generated from the (n−1)-th pseudo-random vector by multiplication with a matrix. The period lengths of this generator type are examined and characterized. Furthermore it is shown that some popular pseudo-random number generators can be regarded as special cases of this method.
Similar content being viewed by others
References
Afflerbach, L. (1986): The Sub-Lattice Structure of Linear Congruential Random Number Generators. manuscripta math. 55, 455–465.
Afflerbach, L., Grothe, H. (1985): Calculation of Minkowski-Reduced Lattice Bases. Computing 35: 269–276.
Dieter, U., Ahrens, J.H. (1974): Uniform Random Numbers. Institut f. Math. Stat., Technische Hochschule Graz.
Grube, A. (1973): Mehrfach rekursiv erzeugte Zufallszahlen. Dissertation, Fakultät f. Math., Universität Karlsruhe.
Knuth, D. E. (1981): The Art of Computer Programming, Vol. 2, 2d ed., Addision-Wesley, Reading (Mass.), Menlo Park (Cal.), London, Amsterdam, Don Mills (Ont.), Sydney.
Marsaglia, G. (1968): Random Numbers Fall Mainly in the Plances. Proc. Nat. Acad. Sci. 61: 25–28.
Tausworthe, R. C. (1961): Random Numbers Generated by Linear Recurrence Modulo Two. Math. Comp. 1961: 25–28.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Grothe, H. Matrix generators for pseudo-random vector generation. Statistische Hefte 28, 233–238 (1987). https://doi.org/10.1007/BF02932602
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02932602