๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A method of generating pseudorandom normal numbers

โœ Scribed by R.E. Gut; V.V. Egorov; V.N. Il'in

Publisher
Elsevier Science
Year
1986
Weight
177 KB
Volume
26
Category
Article
ISSN
0041-5553

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Matrix generator of pseudorandom numbers
Matrix generator of pseudorandom numbers
โœ N.Z Akopov; G.K Savvidy; N.G Ter-Arutyunyan-Savvidy ๐Ÿ“‚ Article ๐Ÿ“… 1991 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 272 KB
The Multiple-Recursive Matrix Method for
The Multiple-Recursive Matrix Method for Pseudorandom Number Generation
โœ H. Niederreiter ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 859 KB

We carry out an in-depth analysis of the multiple-recursive matrix method for uniform pseudorandom number generation which was introduced in an earlier paper of the author. This method yields much larger period lengths than the GFSR method with the same order of the recursion and the same precision.

Improved Bounds in the Multiple-Recursiv
Improved Bounds in the Multiple-Recursive Matrix Method for Pseudorandom Number and Vector Generation
โœ Harold Niederreiter ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 275 KB

The multiple-recursive matrix method is a general linear method for the generation of uniform pseudorandom numbers and vectors which was introduced and studied in earlier papers of the author. In this paper we improve on various bounds in this method by using information on -splitting subspaces of f