Linear congruential generator: Difference between revisions
Jump to navigation
Jump to search
Carl McBride (talk | contribs) mNo edit summary |
m (Slight tidy) |
||
| Line 1: | Line 1: | ||
The ''' | The '''linear congruential generator''' for producing [[random numbers]] was developed by D. H. Lehmer <ref>D. H. Lehmer, "Mathematical methods in large-scale computing units", Proceedings of the 2nd Symposium on Large-Scale Digital Calculating Machinery, vol '''XXVI''' pp. 141-146 The Annals of the Computational Laboratory of Harvard University, Harvard University Press (1951)</ref> and is sometimes known as the Lehmer algorithm. It can be written as | ||
:<math>y_{n+1}\equiv ay_n + b \qquad({\mathrm {mod}} ~m),</math> | :<math>y_{n+1}\equiv ay_n + b \qquad({\mathrm {mod}} ~m),</math> | ||
| Line 9: | Line 9: | ||
*[[Prime modulus multiplicative linear congruential generator]] | *[[Prime modulus multiplicative linear congruential generator]] | ||
==References== | ==References== | ||
<references/> | |||
==External links== | |||
*[http://random.mat.sbg.ac.at/~charly/server/node3.html Linear congruential generator] page, hosted by [http://random.mat.sbg.ac.at/ pLab]. | |||
[[Category: Random numbers]] | [[Category: Random numbers]] | ||
Latest revision as of 17:21, 10 November 2009
The linear congruential generator for producing random numbers was developed by D. H. Lehmer [1] and is sometimes known as the Lehmer algorithm. It can be written as
where the user chooses , , , and a seed value to initiate the algorithm, .
See also[edit]
References[edit]
- ↑ D. H. Lehmer, "Mathematical methods in large-scale computing units", Proceedings of the 2nd Symposium on Large-Scale Digital Calculating Machinery, vol XXVI pp. 141-146 The Annals of the Computational Laboratory of Harvard University, Harvard University Press (1951)
External links[edit]
- Linear congruential generator page, hosted by pLab.