Generation of pseudo-random numbers with the use of inverse chaotic transformation
From MaRDI portal
Publication:1643968
DOI10.1515/math-2018-0004zbMath1391.37055OpenAlexW2792086966MaRDI QIDQ1643968
Publication date: 20 June 2018
Published in: Open Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1515/math-2018-0004
Computational methods for ergodic theory (approximation of invariant measures, computation of Lyapunov exponents, entropy, etc.) (37M25) Pseudo-random numbers; Monte Carlo methods (11K45)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Lyapunov exponent for chaotic 1D maps with uniform invariant distribution
- Characterizing chaotic processes that generate uniform invariant density
- A Note on the Generation of Random Normal Deviates
- A Simple Unpredictable Pseudo-Random Number Generator
- A fast normal random number generator
- Theory and examples of the inverse Frobenius–Perron problem for complete chaotic maps
- A Convenient Method for Generating Normal Variables
This page was built for publication: Generation of pseudo-random numbers with the use of inverse chaotic transformation