Portable Random Number Generators

43 Pages Posted: 7 Sep 2014

See all articles by Gerald P. Dwyer

Gerald P. Dwyer

Clemson University; Australian National University (ANU) - Centre for Applied Macroeconomic Analysis (CAMA)

K. Williams

Independent

Date Written: October 1, 1999

Abstract

Computers are deterministic devices, and a computer-generated random number is a contradiction in terms. As a result, computer-generated pseudorandom numbers are fraught with peril for the unwary. We summarize much that is known about the most well-known pseudorandom number generators: congruential generators. We also provide machine-independent programs to implement the generators in any language that has 32-bit signed integers-for example C, C++, and FORTRAN. Based on an extensive search, we provide parameter values better than those previously available.

Keywords: random number generators, congruential generators, Monte Carlo

JEL Classification: C15

Suggested Citation

Dwyer, Gerald P. and Williams, K., Portable Random Number Generators (October 1, 1999). FRB Atlanta Working Paper No. 1999-14, Available at SSRN: https://ssrn.com/abstract=2491290 or http://dx.doi.org/10.2139/ssrn.2491290

Gerald P. Dwyer (Contact Author)

Clemson University ( email )

Department of Economics
Clemson University
Clemson, SC 29634
United States

Australian National University (ANU) - Centre for Applied Macroeconomic Analysis (CAMA) ( email )

ANU College of Business and Economics
Canberra, Australian Capital Territory 0200
Australia

K. Williams

Independent

Do you have negative results from your research you’d like to share?

Paper statistics

Downloads
83
Abstract Views
615
Rank
543,251
PlumX Metrics