Certification of Algorithm 708: significant-digit computation of the incomplete beta

Authors:
Barry W. Brown;Lawrence B. Levy
Affiliations:
The University of Texas M. D. Anderson Cancer Center;The University of Texas M. D. Anderson Cancer Center
Venue:
ACM Transactions on Mathematical Software (TOMS)
Year:
1994

Citing 3
Cited 1

Algorithm 708: Significant digit computation of the incomplete beta function ratios

ACM Transactions on Mathematical Software (TOMS)
Two Efficient Algorithms with Guaranteed Convergence for Finding a Zero of a Function

ACM Transactions on Mathematical Software (TOMS)
Handbook of Mathematical Functions, With Formulas, Graphs, and Mathematical Tables,

Handbook of Mathematical Functions, With Formulas, Graphs, and Mathematical Tables,

Algorithm 762: LLDRLF, log-likelihood and some derivatives for log-F models

ACM Transactions on Mathematical Software (TOMS)

Quantified Score

Hi-index	0.00

Visualization

Abstract

Algorithm 708 (BRATIO) was run on 2730 test cases. Comparison of these results with the results from an algorithm using a continued fraction of Tretter and Walster were performed using a high-precision version of the latter algorithm implemented in Maple. Accuracy of BRATIO ranged from 9.64 significant digits to a full machine double-precision, 15.65 significant digits, with the lower value occurring when a was nearly equal to b, and a was large.