Efficient implementation of Bailey and Borwein pseudo-random number generator based on normal numbers
DOI10.1016/J.CPC.2013.03.019zbMATH Open1344.65002OpenAlexW2080489332MaRDI QIDQ310312FDOQ310312
M. Johnstone, Gleb Beliakov, D. Creighton, T. Wilkin
Publication date: 8 September 2016
Published in: Computer Physics Communications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cpc.2013.03.019
Recommendations
- Pseudorandom Number Generator Using Optimal Normal Basis
- Efficient deterministic and non-deterministic pseudorandom number generation
- scientific article; zbMATH DE number 3994872
- Normal numbers and pseudorandom generators
- A fast normal random number generator
- scientific article; zbMATH DE number 1114364
- A method of generating pseudorandom normal numbers
- Fast pseudorandom generators for normal and exponential variates
- Number-theoretic constructions of efficient pseudo-random functions
- scientific article; zbMATH DE number 4182680
Random number generation in numerical analysis (65C10) Software, source code, etc. for problems pertaining to numerical analysis (65-04)
Cites Work
- Class library ranlip for multivariate nonuniform random variate generation
- Title not available (Why is that?)
- Title not available (Why is that?)
- TestU01
- Uniform random number generation
- Close-Point Spatial Tests and Their Application to Random Number Generators
- Normal Numbers and Pseudorandom Generators
- Parallel use of multiplicative congruential random number generators
- Improving random number generators in the Monte Carlo simulations via twisting and combining
Uses Software
This page was built for publication: Efficient implementation of Bailey and Borwein pseudo-random number generator based on normal numbers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q310312)