Computation of the Incomplete Gamma Function Ratios and Their Inverse

64Citations
Citations of this article
23Readers
Mendeley users who have this article in their library.

Abstract

An algorithm is given for computing the incomplete gamma function ratios P(a, x) and Q>(a, x) for a ≩ 0, x ≩ 0, a + x ≠ 0. Temme's uniform asymptotic expansions are used. The algorithm is robust; results accurate to 14 significant digits can be obtained. An’ extensive set of coefficients for the Temme expansions is included. An algorithm, employing third-order Schröder iteration supported by Newton-Raphson iteration, is provided for computing x when a, P(a, x), and Q(a, x) are given. Three iterations at most are required to obtain 10 significant digit accuracy for x. © 1986, ACM. All rights reserved.

Cite

CITATION STYLE

APA

DiDonato, A. R., & Morris, A. H. (1986). Computation of the Incomplete Gamma Function Ratios and Their Inverse. ACM Transactions on Mathematical Software (TOMS), 12(4), 377–393. https://doi.org/10.1145/22721.23109

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free