[Octave-bug-tracker] [bug #34362] [octave forge] (statistics) binopdf.m: Implement high accuracy Holder algorithm for n >= 10

[Nicholas Jankowski]

Follow-up Comment #7, bug #34362 (project octave):

curious - both the 2002 paper and the current R code store a number of
precalculated values of formula and frequently used repeating or irrational
fractions for precision and or speed. They store 28 digits:

eg:

d_n = [0.081061466795327258219670264,
  0.041340695955409294093822081, 0.0276779256849983391487892927,
  0.020790672103765093111522771, 0.0166446911898211921631948653,
  0.013876128823070747998745727, 0.0118967099458917700950557241,
  0.010411265261972096497478567, 0.0092554621827127329177286366,
  0.008330563433362871256469318, 0.0075736754879518407949720242,
  0.006942840107209529865664152, 0.0064089941880042070684396310,
  0.005951370112758847735624416, 0.0055547335519628013710386899];


it's been 20 years, so if we were to reimplement this function, is there any
value to extending the length of stored numbers? future proof the code for
256bit logic :) ?


    _______________________________________________________

Reply to this item at:

  <https://savannah.gnu.org/bugs/?34362>

_______________________________________________
  Message sent via Savannah
  https://savannah.gnu.org/