Algorithm for normal random numbers

Julio F. Fernández and Carlos Criado
Phys. Rev. E 60, 3361 – Published 1 September 1999
PDFExport Citation

Abstract

We propose a simple algorithm for generating normally distributed pseudorandom numbers. The algorithm simulates N molecules that exchange energy among themselves following a simple stochastic rule. We prove that the system is ergodic, and that a Maxwell-like distribution that may be used as a source of normally distributed random deviates follows in the N limit. The algorithm passes various performance tests, including Monte Carlo simulation of a finite two-dimensional Ising model using Wolff’s algorithm. It only requires four simple lines of computer code, and is approximately ten times faster than the Box-Muller algorithm.

  • Received 27 April 1999

DOI:https://doi.org/10.1103/PhysRevE.60.3361

©1999 American Physical Society

Authors & Affiliations

Julio F. Fernández

  • Instituto de Ciencia de Materiales de Aragón, Consejo Superior de Investigaciones Científicas, and Universidad de Zaragoza, 50009-Zaragoza, Spain

Carlos Criado

  • Departamento de Física Aplicada I, Universidad de Málaga, 29071-Málaga, Spain

Comments & Replies

Comment on “Algorithm for normal random numbers”

M. I. J. Probert
Phys. Rev. E 63, 058701 (2001)

Reply to “Comment on ‘Algorithm for normal random numbers’ ”

Julio F. Fernández and Carlos Criado
Phys. Rev. E 63, 058702 (2001)

References (Subscription Required)

Click to Expand
Issue

Vol. 60, Iss. 3 — September 1999

Reuse & Permissions
Access Options
Author publication services for translation and copyediting assistance advertisement

Authorization Required


×
×

Images

×

Sign up to receive regular email alerts from Physical Review E

Log In

Cancel
×

Search


Article Lookup

Paste a citation or DOI

Enter a citation
×