 more useful options PerlMonks

### Re^2: Fastest way to calculate hypergeometric distribution probabilities (i.e. BIG factorials)?

by jmuhlich (Acolyte)
 on Jan 26, 2006 at 01:04 UTC ( #525621=note: print w/replies, xml ) Need Help??

I only just ran across this node, thanks everyone!

For pure speed then you can inline the gammln code, unroll the loop into one big equation, and move the constants into the equation instead of referencing them indirectly in the array. I also got rid of \$y for a very small speedup. This code runs about 135% faster than logfact above (i.e. over twice as fast). I renamed the function factln to be consistent with gammaln.

BTW this code appears to originate in Numerical Recipes but no credit was given in Re^4: Challenge: Chasing Knuth's Conjecture, referenced in the parent. All of the function names in that book are 6 characters long, because there's a Fortran (F77) version of the book too. Thus "gammln" instead of "gammaln".

```sub factln
{
my \$x = (shift) + 1;
my \$tmp = \$x + 5.5;
\$tmp -= (\$x + .5) * log(\$tmp);
my \$ser = 1.000000000190015
+ 76.18009172947146    / ++\$x
- 86.50532032941677    / ++\$x
+ 24.01409824083091    / ++\$x
-  1.231739572450155   / ++\$x
+  0.12086509738661e-2 / ++\$x
-  0.5395239384953e-5  / ++\$x;
return log(2.5066282746310005*\$ser/(\$x-6)) - \$tmp;
}

• Comment on Re^2: Fastest way to calculate hypergeometric distribution probabilities (i.e. BIG factorials)?

Create A New User
Node Status?
node history
Node Type: note [id://525621]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others chanting in the Monastery: (3)
As of 2020-01-21 00:31 GMT
Sections?
Information?
Find Nodes?
Leftovers?
Voting Booth?
The worst excuse I have ever heard is:

Results (95 votes). Check out past polls.

Notices?