What are good PRNG for calculators?
|
11-13-2014, 10:52 AM
(This post was last modified: 11-13-2014 10:54 AM by Gerald H.)
Post: #35
|
|||
|
|||
RE: What are good PRNG for calculators?
(09-06-2014 05:55 PM)John R. Graham Wrote: When do you think it's inappropriate to use a really good PRNG? The only contraindication I can think of that is potentially valid is if the resource requirements and/or execution time is onerous on the platform. Should you wish to eg find the area under a curve you would also want to avoid clumping, which clumping is a characteristic of a good PRNG. For such applications a Quasi Monte Carlo sequence of D-dimensional Halton sequence vectors is preferable, providing good spread within the set lower & upper limits & avoiding clumping. For eg crypto purposes, QMCS is not so good. In short, there are some uses where real randomness approxination is not the chief criterion of efficacy. |
|||
« Next Oldest | Next Newest »
|
User(s) browsing this thread: 1 Guest(s)