Show/Hide Menu
Hide/Show Apps
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Guides
Guides
Thesis submission
Thesis submission
MS without thesis term project submission
MS without thesis term project submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Supporting Information
Supporting Information
General Information
General Information
Copyright, Embargo and License
Copyright, Embargo and License
Contact us
Contact us
A NONLINEAR CONGRUENTIAL PSEUDORANDOM NUMBER GENERATOR WITH POWER OF 2 MODULUS
Date
1988-10-01
Author
EICHENAUER, J
LEHN, J
TOPUZOGLU, A
Metadata
Show full item record
This work is licensed under a
Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License
.
Item Usage Stats
128
views
0
downloads
Cite This
A nonlinear congruential pseudorandom number generator is studied where the modulus is a power of two. Investigation of this generator was suggested by Knuth [7]. A simple necessary and sufficient condition is given for this generator to have the maximal period length.
Subject Keywords
Period length
,
Power of two modulus
,
Nonlinear congruential sequence
,
Pseudorandom number generator
URI
https://hdl.handle.net/11511/66701
Journal
MATHEMATICS OF COMPUTATION
DOI
https://doi.org/10.2307/2008776
Collections
Department of Mathematics, Article
Suggestions
OpenMETU
Core
ON THE PERIOD LENGTH OF CONGRUENTIAL PSEUDORANDOM NUMBER SEQUENCES GENERATED BY INVERSIONS
EICHENAUERHERRMANN, J; TOPUZOGLU, A (1990-07-24)
Congruential pseudorandom number sequences generated by inversions have been studied recently. These sequences do not show the undesirable lattice structure of the linear congruential method. The necessary and sufficient condition for the generated sequence to have the maximal period length was given by Eichenauer (1988) for the case of 2e modulus. Generalization of this result to the case of an arbitrary prime power modulus is obtained.
A multiple recursive non-linear congruential pseudo random number generator
Eichenauer, Johanna; Grothe, Heather L.; Lehn, Juergen; Topuzoglu, Alev (Springer Science and Business Media LLC, 1987-9)
On-linear multiple recursive congruential pseudo random number generator with prime modulus p is introduced. Let x, n≥0, be the sequence generated by a usual linear (r+1)-step recursive congruential generator with prime modulus p and denote by N(n), n≥0, the sequence of non-negative integers with xN(n)≢0 (mod p). The non-linear generator is defined by zn≡xN(n)+1·x −1N(n) (mod p), n≥0, where x −1N(n) denotes the inverse element of xN(n) in the Galois field GF(p). A condition is given which ensures that the g...
A strange recursion operator for a new integrable system of coupled Korteweg-de Vries equations
Karasu, A; Karasu, Atalay; Sakovich, SY (Springer Science and Business Media LLC, 2004-08-01)
A recursion operator is constructed for a new integrable system of coupled Korteweg de Vries equations by the method of gauge-invariant description of zero-curvature representations. This second-order recursion operator is characterized by unusual structure of its nonlocal part.
A parallel sparse algorithm targeting arterial fluid mechanics computations
Manguoğlu, Murat; Sameh, Ahmed H.; Tezduyar, Tayfun E. (2011-09-01)
Iterative solution of large sparse nonsymmetric linear equation systems is one of the numerical challenges in arterial fluid-structure interaction computations. This is because the fluid mechanics parts of the fluid + structure block of the equation system that needs to be solved at every nonlinear iteration of each time step corresponds to incompressible flow, the computational domains include slender parts, and accurate wall shear stress calculations require boundary layer mesh refinement near the arteria...
A High throughput FPGA implementation of markov chain monte carlo method for mixture models
Bozgan, Caner; Ulusoy, İlkay; Department of Electrical and Electronics Engineering (2019)
Markov Chain Monte Carlo (MCMC) is a class of algorithms which can generate samples from high dimensional and multimodal probability distributions. In many statistical and control applications, MCMC algorithms are employed widely thanks to their ability to draw sample from arbitrary distribution regardless of dimension or complexity. However, as the complexity of the Bayesian models and the computational load of the MCMC algorithm increase, performing MCMC inference becomes impractical or too time consuming...
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
J. EICHENAUER, J. LEHN, and A. TOPUZOGLU, “A NONLINEAR CONGRUENTIAL PSEUDORANDOM NUMBER GENERATOR WITH POWER OF 2 MODULUS,”
MATHEMATICS OF COMPUTATION
, pp. 757–759, 1988, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/66701.