Pseudo-random numbers - a new proposal for the choice of multiplicators

DOI10.1007/BF02241740zbMath0212.18205OpenAlexW2924447586MaRDI QIDQ2544525

Yanyan Li

Publication date: 1970

Published in: Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02241740

Mathematics Subject Classification ID

Random number generation in numerical analysis (65C10)

Related Items (10)

Parallelization of random number generators and long-range correlations ⋮ Small sample properties of the maximum likelihood estimators of the parameters μ and σ from a grouped sample of a normal population ⋮ Critical distances in pseudorandom sequences generated with composite moduli ⋮ The Monte Carlo method ⋮ A numerical method for the generation of hierarchical Poisson Voronoi microstructures applied in micromechanical finite element simulations. I: Method ⋮ Quasi-Monte Carlo methods and pseudo-random numbers ⋮ Maximum likelihood estimation of variance components-a Monte Carlo study ⋮ An exact determination of serial correlations of pseudo-random numbers ⋮ A combinatorial method for the generation of normally distributed random numbers ⋮ Computer methods for sampling from gamma, beta, Poisson and binomial distributions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Das Verhalten der Kleinschen Funktionen log(w1, w2) gegenüber Modultransformationen und verallgemeinerte Dedekindsche Summen.
• Random Number Generators
• An a priori determination of serial correlation in computer generated random numbers
• The Covariance Matrix of Runs Up and Down
• Asymptotic Distribution of Runs Up and Down

This page was built for publication: Pseudo-random numbers - a new proposal for the choice of multiplicators