Applied and computational complex analysis. Vol. 3: discrete Fourier analysis—Cauchy integrals—construction of conformal maps---univalent functions
A Fortran Multiple-Precision Arithmetic Package
ACM Transactions on Mathematical Software (TOMS)
A Computational Procedure for Incomplete Gamma Functions
ACM Transactions on Mathematical Software (TOMS)
Algorithm 542: Incomplete Gamma Functions [S14]
ACM Transactions on Mathematical Software (TOMS)
Algorithm 708: Significant digit computation of the incomplete beta function ratios
ACM Transactions on Mathematical Software (TOMS)
ACM Transactions on Mathematical Software (TOMS)
A uniform asymptotic expansion for the incomplete gamma function
Journal of Computational and Applied Mathematics
The asymptotics of a new exponential sum
Journal of Computational and Applied Mathematics
Computing the incomplete Gamma function to arbitrary precision
ICCSA'03 Proceedings of the 2003 international conference on Computational science and its applications: PartI
| Hi-index | 0.00 |
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.