Efficient and portable multiple recursive generators of large order
From MaRDI portal
Publication:3549149
DOI10.1145/1044322.1044323zbMath1198.65025OpenAlexW2037703035MaRDI QIDQ3549149
Publication date: 21 December 2008
Published in: ACM Transactions on Modeling and Computer Simulation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1044322.1044323
Random number generation in numerical analysis (65C10) Pseudo-random numbers; Monte Carlo methods (11K45)
Related Items (12)
Spectral test of DX and DL multiple recursive random number generators ⋮ On the Lattice Structure of a Special Class of Multiple Recursive Random Number Generators ⋮ Efficient computer search of large-order multiple recursive pseudo-random number generators ⋮ Survey on hardware implementation of random number generators on FPGA: theory and experimental analyses ⋮ Simulating the emergence of mutations and their subsequent evolution in an age-structured stochastic self-regulating process with two sexes ⋮ An improved method for predicting truncated multiple recursive generators with unknown parameters ⋮ A review on Monte Carlo simulation methods as they apply to mutation and selection as formulated in Wright-Fisher models of evolutionary genetics ⋮ Improving random number generators in the Monte Carlo simulations via twisting and combining ⋮ Comparison of Point Sets and Sequences for Quasi-Monte Carlo and for Random Number Generation ⋮ Full period of a multiple recursive random number generator with generalized Mersenne prime number ⋮ 64-bit and 128-bit DX random number generators ⋮ Large-Order Multiple Recursive Generators with Modulus 231 − 1
This page was built for publication: Efficient and portable multiple recursive generators of large order
