A multiple recursive nonlinear congruential pseudo random number generator (Q1086972): Difference between revisions
From MaRDI portal
Removed claims |
Set OpenAlex properties. |
||
(3 intermediate revisions by 3 users not shown) | |||
Property / author | |||
Property / author: Jürgen Eichenauer-Herrmann / rank | |||
Normal rank | |||
Property / author | |||
Property / author: Alev Topuzoğlu / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Lattice Structure of Multiplicative Congruential Pseudo-Random Vectors / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3746773 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5583936 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3935355 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: RANDOM NUMBERS FALL MAINLY IN THE PLANES / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2053955838 / rank | |||
Normal rank |
Latest revision as of 09:54, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A multiple recursive nonlinear congruential pseudo random number generator |
scientific article |
Statements
A multiple recursive nonlinear congruential pseudo random number generator (English)
0 references
1987
0 references
A nonlinear multiple recursive congruential pseudo-random number generator with prime modulus p is introduced. Let \(x_ n\), \(n\geq 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\geq 0\), the sequence of non-negative integers with \(x_{N(n)}\not\equiv 0\) (mod p). The nonlinear generator is defined by \(z_ n\equiv x_{N(n+1)}\cdot x^{-1}_{N(n)}\quad (mod p),\) \(n\geq 0\), where \(x^{-1}_{N(n)}\) denotes the inverse element of \(x_{N(n)}\) in the Galois field \(GF(p).\) A condition is given which ensures that the generated sequence is purely periodic with period length \(p^ r\) and all \((p-1)^ r\) r-tuples \((y_ 1,...,y_ r)\) with \(1\leq y_ 1,...,y_ r<p\) are generated once per period when r-tuples of consecutive numbers of the generated sequence are formed. For \(r=1\) this generator coincides with a nonlinear generator introduced by the first and the third author in an earlier paper.
0 references
nonlinear congruential sequence
0 references
nonlinear multiple recursive congruential pseudo random number generator
0 references
Galois field
0 references
period length
0 references