What are good PRNG for calculators?
|
08-21-2014, 06:35 PM
(This post was last modified: 08-21-2014 06:38 PM by Dieter.)
Post: #4
|
|||
|
|||
RE: What are good PRNG for calculators?
(08-21-2014 03:25 PM)Namir Wrote: Balancing between simplicity and efficiency (i.e good numeric distribution and long cycles) is very good! In terms of simplicity it will not get much simpler than a good old linear congruential RNG, i.e. something like rn+1 = (a · rn + b) mod c. However, the cycle length obviously is limited. So a good idea might be the combination of several RNGs of this kind. A well-known method using this approach is the Wichmann-Hill generator that was introduced in Applied Statistics, vol. 31 (1982). But caveat lector: the original paper included an error that was corrected in 1984. ;-) The cycle length of this RNG is approx. 7 · 1012. Dieter |
|||
« Next Oldest | Next Newest »
|
User(s) browsing this thread: 1 Guest(s)