HELP! * GREY=local LOCAL HTML version of Foils prepared 15 March 1996

Foil 20 Case Study I) Topics -- Numerical Computation of Random Numbers

From Master set for Overview of Case Studies of Computational Science CPSP713 Master for Overview -- Autumn Semester 1994. by Geoffrey C. Fox * See also color IMAGE
T: Basic Methods for Pseudo Random Number Generation -- one doesn't use true random numbers!
  • T: Linear Congruential
  • T: Multiple Linear Congruential
  • T: Lagged Fibonacci
T: Parallel Random Number Generation
T: Testing Quality of Pseudo Random Number Generators
  • Several methods have unacceptable correlations
  • Note a QCD computation could use 1012 separate random numbers and so the more powerful the computer, the more random numbers one will generate and the greater accuracy and period needed.

Northeast Parallel Architectures Center, Syracuse University, npac@npac.syr.edu

If you have any comments about this server, send e-mail to webmaster@npac.syr.edu.

Page produced by wwwfoil on Tue Feb 18 1997