You are viewing a plain text version of this content. The canonical link for it is here.
Posted to issues@commons.apache.org by "Gilles (JIRA)" <ji...@apache.org> on 2016/04/23 00:34:12 UTC

[jira] [Resolved] (MATH-1327) Assessment of the quality of the random number generators

     [ https://issues.apache.org/jira/browse/MATH-1327?page=com.atlassian.jira.plugin.system.issuetabpanels:all-tabpanel ]

Gilles resolved MATH-1327.
--------------------------
    Resolution: Fixed

Updated userguide available in branch "develop".

> Assessment of the quality of the random number generators
> ---------------------------------------------------------
>
>                 Key: MATH-1327
>                 URL: https://issues.apache.org/jira/browse/MATH-1327
>             Project: Commons Math
>          Issue Type: Sub-task
>            Reporter: Gilles
>            Assignee: Gilles
>            Priority: Minor
>              Labels: correctness, documentation
>
> For some of the RNGs implemented in CM, a list of reference values (i.e. a sequence of numbers produced from using a certain seed) are provided by the algorithm's author (this is the case for "MersenneTwister").
> When available, a unit test can show that the CM implementation of the original algorithm is correct (by comparing the sequence produced by the CM code with the reference values).
> When not available, we can compile the reference implementation (usually in C), run it and convert the output (taking  care of Java "signed" vs C "unsigned" types) into a list to be used as above.
> As the intermediate steps could involve bugs, the overly cautious might wish to be offered additional assessments that the CM implementations do produce sequences of uniformly distributed numbers.



--
This message was sent by Atlassian JIRA
(v6.3.4#6332)