You are viewing a plain text version of this content. The canonical link for it is here.
Posted to issues@commons.apache.org by "Thomas Neidhart (JIRA)" <ji...@apache.org> on 2013/05/26 23:15:19 UTC
[jira] [Commented] (MATH-981) An improved algorithm for computing
the inverse cumulative probability for the normal distribution
[ https://issues.apache.org/jira/browse/MATH-981?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=13667402#comment-13667402 ]
Thomas Neidhart commented on MATH-981:
--------------------------------------
First tests show that the error compared to the current implementation is never bigger than 1e-8 in the interval [0, 1] with a stepping of 1e-6.
Using this algorithm also the nextGaussian() method of the BitsStreamGenerator class could be improved by a factor of ~1.5
> An improved algorithm for computing the inverse cumulative probability for the normal distribution
> --------------------------------------------------------------------------------------------------
>
> Key: MATH-981
> URL: https://issues.apache.org/jira/browse/MATH-981
> Project: Commons Math
> Issue Type: Sub-task
> Reporter: Thomas Neidhart
> Priority: Minor
>
> The following page outlines an algorithm (and alternative algorithms) to compute the inverse cumulative probability for the normal distribution:
> http://home.online.no/~pjacklam/notes/invnorm/
> An implementation of this is also included in the referred contribution for a Monte Carlo engine.
--
This message is automatically generated by JIRA.
If you think it was sent incorrectly, please contact your JIRA administrators
For more information on JIRA, see: http://www.atlassian.com/software/jira