# Computing the Incomplete Gamma Function to Arbitrary Precision

@inproceedings{Winitzki2003ComputingTI, title={Computing the Incomplete Gamma Function to Arbitrary Precision}, author={S. Winitzki}, booktitle={ICCSA}, year={2003} }

I consider an arbitrary-precision computation of the incomplete Gamma function from the Legendre continued fraction. Using the method of generating functions, I compute the convergence rate of the continued fraction and find a direct estimate of the necessary number of terms. This allows to compare the performance of the continued fraction and of the power series methods. As an application, I show that the incomplete Gamma function Γ (a, z) can be computed to P digits in at most O(P) long… Expand

#### Topics from this paper

#### 39 Citations

Fast and accurate evaluation of a generalized incomplete gamma function

- Mathematics
- 2016

We propose a computational procedure to evaluate the generalized incomplete
gamma function ∫ x y s p-1 e -μs ds, for
0 ≤ x < y ≤ +∞, a real number μ ≠ 0 and a positive integer p. Our approach … Expand

Algorithm 1006

- Computer Science, Mathematics
- ACM Trans. Math. Softw.
- 2020

The accuracy reached by the algorithm improves a recent state-of-the-art method by two orders of magnitude, and it is essentially optimal considering the limitations imposed by floating point arithmetic. Expand

Algorithm 955

- Mathematics, Computer Science
- ACM Trans. Math. Softw.
- 2016

New approximations for the inverse of the incomplete gamma function are derived, which are used to develop efficient evaluations of the inverse Poisson cumulative distribution function. An asymptotic… Expand

Algorithm 926: Incomplete Gamma Functions with Negative Arguments

- Computer Science, Mathematics
- TOMS
- 2013

Series expansions and analytic continuation are employed to compute the lower incomplete gamma function for certain critical values of <i>n</i>, and these results are used to initiate stable recurrence. Expand

A Matlab Implementation of an Algorithm for Computing Integrals of Products of Bessel Functions

- Computer Science
- ICMS
- 2006

A Matlab program that computes infinite range integrals of an arbitrary product of Bessel functions of the first kind using an integral representation of the upper incomplete Gamma function to integrate the tail of the integrand is presented. Expand

Computation of matrix gamma function

- Computer Science, Mathematics
- 2018

This research article proposes a fourth technique based on the reciprocal gamma function that is shown to be competitive with the other three methods in terms of accuracy, with the advantage of being rich in matrix multiplications. Expand

Effective Laguerre Asymptotics

- Mathematics, Computer Science
- SIAM J. Numer. Anal.
- 2008

A computationally motivated contour integral is introduced that allows efficient numerical Laguerre evaluations yet also leads to the complete asymptotic series over the full parameter domain of subexponential behavior. Expand

The Gamma Function and the Incomplete Gamma Functions

- Physics
- 2017

The gamma function is defined for \(s \in \mathbb{C}\) by
$$\displaystyle{ \varGamma \left (s\right ) =\int _{ 0}^{\infty }t^{s-1}e^{-t}dt }$$

Provable computation of motivic L-functions

- Mathematics
- 2010

Provable Computation of Motivic L-functions Robert W. Bradshaw Chair of the Supervisory Committee: Professor William A. Stein Mathematics L-functions have been a central object of study in number… Expand

#### References

SHOWING 1-10 OF 26 REFERENCES

A Computational Procedure for Incomplete Gamma Functions

- Mathematics, Computer Science
- TOMS
- 1979

We develop a computational procedure, based on Taylor's series and continued fractions, for evaluating Tncomi's incomplete gamma functmn 7*(a, x) = (x-"/F(a))S~ e-~t'-ldt and the complementary… Expand

Numerical stability in evaluating continued fractions

- Mathematics
- 1974

A careful analysis of the backward recurrence algorithm for evaluating approxi- mants of continued fractions provides rigorous bounds for the accumulated relative error due to rounding. Such errors… Expand

A continued fraction expansion, with a truncation error estimate, for Dawson’s integral

- Mathematics
- 1974

A continued fraction expansion for Dawson's integral is considered and an estimate of the truncation errors of the convergents of this continued fraction is provided. The continued fraction is shown… Expand

Estimates of the speed of convergence of continued fraction expansions of functions

- Mathematics
- 1977

The best recently published methods of obtaining a priori and a posteriori truncation error estimates of continued fractions are reviewed. The applicability of these methods is discussed and a… Expand

High-precision division and square root

- Mathematics, Computer Science
- TOMS
- 1997

These algorithms avoid the need to multiply two high-precision numbers, speeding up the last iteration by as much as a factor of 10, and show how to produce the floating-point number closest to the exact result with relatively few additional operations. Expand

Computation of the incomplete gamma function ratios and their inverse

- Mathematics, Computer Science
- TOMS
- 1986

An algorithm, employing third-order Schröder iteration supported by Newton-Raphson iteration, is provided for computing the incomplete gamma function ratios, using Temme's uniform asymptotic expansions. Expand

The asymptotic expansion of the incomplete gamma functions : (preprint)

- Mathematics
- 1977

Earlier investigations on uniform asymptotic expansions of the incomplete gamma functions are reconsidered. The new results include estimations for the remainder and the extension of the results to… Expand

A note on the recursive calculation of incomplete gamma functions

- Mathematics, Computer Science
- TOMS
- 1999

The recursion can be used in the range 0 ≤ n ≤ x ≤ x practically without error growth, and in larger ranges 0 ≤ N ≤ N with a loss of accuracy that can be controlled by suitably limiting N. Expand

Efficient multiple-precision evaluation of elementary functions

- Mathematics
- 1989

Let M(t) denote the time required to multiply two t-digit numbers using base b arithmetic. Methods are presented for computing the elementary functions in O(tI/3M(t)) time.

Algorithm 814: Fortran 90 software for floating-point multiple precision arithmetic, gamma and related functions

- Computer Science
- TOMS
- 2001

A collection of Fortran-90 routines for evaluating the gamma function and related functions using the FM multiple-precision arithmetic package.