Efficient and portable multiple recursive generators of large order

DOI10.1145/1044322.1044323MaRDI QIDQ3549149zbMATH OpenOpenAlexFDO

Authors Lih-Yuan Deng

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

Mathematics Subject Classification ID

Random number generation in numerical analysis (65C10) Pseudo-random numbers; Monte Carlo methods (11K45)

Recommendations

• Large-order multiple recursive generators with modulus \(2^{31}-1\)
• A system of high-dimensional, efficient, long-cycle and portable uniform random number generators
• Efficient computer search of large-order multiple recursive pseudo-random number generators
• Full period of a multiple recursive random number generator with generalized Mersenne prime number
• Issues on Computer Search for Large Order Multiple Recursive Generators

Cited in

(16)

• Simulating the emergence of mutations and their subsequent evolution in an age-structured stochastic self-regulating process with two sexes
• Design and implementation of efficient and portable multiple recursive generators with few zero coefficients
• Comparison of Point Sets and Sequences for Quasi-Monte Carlo and for Random Number Generation
• 64-bit and 128-bit DX random number generators
• Improving random number generators in the Monte Carlo simulations via twisting and combining
• Efficient computer search of large-order multiple recursive pseudo-random number generators
• A review on Monte Carlo simulation methods as they apply to mutation and selection as formulated in Wright-Fisher models of evolutionary genetics
• Spectral test of DX and DL multiple recursive random number generators
• Full period of a multiple recursive random number generator with generalized Mersenne prime number
• scientific article; zbMATH DE number 2051214 (Why is no real title available?)
• Survey on hardware implementation of random number generators on FPGA: theory and experimental analyses
• Large-order multiple recursive generators with modulus \(2^{31}-1\)
• Issues on Computer Search for Large Order Multiple Recursive Generators
• An improved method for predicting truncated multiple recursive generators with unknown parameters
• On the lattice structure of a special class of multiple recursive random number generators
• A portable interpreter of multidimensional chains of recurrences

This page was built for publication: Efficient and portable multiple recursive generators of large order

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3549149)