Pseudorandom number generators for personal computers. II
DOI10.1016/0010-4655(93)90152-3zbMATH Open0879.65004OpenAlexW4246201498MaRDI QIDQ1365693FDOQ1365693
Authors: Kenneth G. Hamilton
Publication date: 7 September 1997
Published in: Computer Physics Communications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0010-4655(93)90152-3
Recommendations
pseudorandom number generatorsFortran compilerspersonal computersTausworthe and lagged-Fibonacci routines
Random number generation in numerical analysis (65C10) Pseudo-random numbers; Monte Carlo methods (11K45)
Cites Work
Cited In (10)
- Title not available (Why is that?)
- Acceleration of RANLUX
- Pseudorandom number generators for personal computers
- A study of 64-bit multipliers for Lehmer pseudorandom number generators
- Systematic searches for good multiple recursive random number generators
- RANLUX: A Fortran implementation of the high-quality pseudorandom number generator of Lüscher
- A universal GFSR random number generator for personal computers
- Pseudorandom number generators for Salford FTN77
- A family of enhanced Lehmer random number generators, with hyperplane suppression, and direct support for certain physical applications
- Rounding errors in random number generators
Uses Software
This page was built for publication: Pseudorandom number generators for personal computers. II
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1365693)