Article
Licensed
Unlicensed
Requires Authentication
A new nonrecursive pseudorandom number generator based on chaos mappings
-
Published/Copyright:
May 26, 2008
Abstract
We introduce a new pseudorandom number generator SSR (the Simplified Shift-Real random number generator) which generates the k-th random number nonrecursively (directly) based on chaos mappings on the interval [1, 2). We investigate properties of SSR random numbers and give the theoretical background of generation of random numbers. A practical integral (all-integer) version SSI of SSR, which is suitable for parallel computation, is also provided.
Keywords.: Random number; pseudorandom number; nonrecursive; chaos; statistical test; parallel computation
Received: 2007-12-12
Revised: 2008-03-15
Published Online: 2008-05-26
Published in Print: 2008-May
© de Gruyter 2008
You are currently not able to access this content.
You are currently not able to access this content.
Articles in the same Issue
- Sequential Monte Carlo for linear systems – a practical summary
- Some new simulations schemes for the evaluation of Feynman–Kac representations
- Spectra of Perron–Frobenius operator and new construction of two dimensional low discrepancy sequences
- Computing percentage points of the largest among Student's t random variables
- A new nonrecursive pseudorandom number generator based on chaos mappings
Keywords for this article
Random number;
pseudorandom number;
nonrecursive;
chaos;
statistical test;
parallel computation
Articles in the same Issue
- Sequential Monte Carlo for linear systems – a practical summary
- Some new simulations schemes for the evaluation of Feynman–Kac representations
- Spectra of Perron–Frobenius operator and new construction of two dimensional low discrepancy sequences
- Computing percentage points of the largest among Student's t random variables
- A new nonrecursive pseudorandom number generator based on chaos mappings
