Some comments on computer implementation of random number generators

DOI10.1016/0377-0427(92)90212-GzbMath0759.65003MaRDI QIDQ1196840

Fatin Sezgin

Publication date: 16 January 1993

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

implementationportabilitymultiplicative random number generators

Mathematics Subject Classification ID

Related Items (5)

Finding the best portable congruential random number generators ⋮ Systematic searches for good multiple recursive random number generators ⋮ Simulated division with approximate factoring for the multiple recursive generator with both unrestricted multiplier and non-Mersenne prime modulus ⋮ The revised recursive reduction for efficiently generating random numbers ⋮ Effective and efficient restriction on producing the multipliers for the multiple recursive random number generator

Uses Software

• AS 183
• UNIRAN

Cites Work

• Computer implementation of random number generators
• A More Portable Fortran Random Number Generator
• Implementing a random number package with splitting facilities
• Coding the Lehmer pseudo-random number generator

This page was built for publication: Some comments on computer implementation of random number generators