Random number generation with the recursion \(X_ t=X_{t-3p}\oplus X_{t-3q}\) (Q914320)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4149435
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Random number generation with the recursion \(X_ t=X_{t-3p}\oplus X_{t-3q}\) |
scientific article; zbMATH DE number 4149435 |
Statements
Random number generation with the recursion \(X_ t=X_{t-3p}\oplus X_{t-3q}\) (English)
0 references
1990
0 references
The author discusses a modification of the Marsaglia pseudorandom generator of the form given in the title. The paper contains the FORTRAN program that initializes and runs the generator. The principles of the initialization are discussed in detail using the theory of Galois fields. Results of the statistical tests of the generator are given. The author concludes that the generator has better properties than the Marsaglia one.
0 references
Marsaglia pseudorandom generator
0 references
FORTRAN program
0 references
initialization
0 references
statistical tests
0 references
0 references
0.8219279646873474
0 references
0.821596086025238
0 references
0.813209593296051
0 references
0.8118741512298584
0 references
0.7973048686981201
0 references
