Regularized Gamma function

In mathematics, the gamma function is defined by a definite integral. The incomplete gamma function is defined as an integral function of the same integrand. There are two varieties of the incomplete gamma function: the upper incomplete gamma function is for the case that the lower limit of integration is variable (ie where the "upper" limit is fixed), and the lower incomplete gamma function can vary the upper limit of integration.

The upper incomplete gamma function is defined as:

<math> \Gamma(a,x) = \int_x^{\infty} t^{a-1}\,e^{-t}\,dt .\,\!</math>

The lower incomplete gamma function is defined as:

<math> \gamma(a,x) = \int_0^x t^{a-1}\,e^{-t}\,dt .\,\!</math>

Properties

In both cases a is a complex parameter, such that the real part of a is positive.

By integration by parts we can find that

<math> \Gamma(a+1,x) = a\Gamma(a,x) + x^a e^{-x}\,</math>

<math> \gamma(a+1,x) = a\gamma(a,x) - x^a e^{-x}.\,</math>

Since the ordinary gamma function is defined as

<math> \Gamma(a) = \int_0^{\infty} t^{a-1}\,e^{-t}\,dt \,\!</math>

we have

<math> \gamma(a,x) + \Gamma(a,x) = \Gamma(a).\, </math>

Furthermore,

<math>\Gamma(a,x)=(a-1)!e^{-x}\sum_{k=0}^{a-1}\frac{x^k}{k!}</math> if a is an integer.^[1]

<math> \Gamma(a,0) = \Gamma(a)\, </math>

<math> \Gamma(a) = (a-1)!\, </math> if a is an integer.

and

<math> \gamma(a,x) \rightarrow \Gamma(a)

 \quad \mathrm{as\ } x \rightarrow \infty.  \,</math>

Also

<math>\Gamma(0,x) = -\mbox{Ei}(-x)\mbox{ for }x>0 \,</math>

<math>\Gamma\left({1 \over 2}, x\right) = \sqrt\pi\,\mbox{erfc}\left(\sqrt x\right) \,</math>

<math>\gamma\left({1 \over 2}, x\right) = \sqrt\pi\,\mbox{erf}\left(\sqrt x\right) \,</math>

<math>\Gamma(1,x) = e^{-x} \,</math>

<math>\gamma(1,x) = 1 - e^{-x} \,</math>

where Ei is the exponential integral, erf is the error function, and erfc is the complementary error function, erfc(x) = 1 − erf(x).

Regularized Gamma functions

Two related functions are the regularized Gamma functions:

<math>P(a,x)=\frac{\gamma(a,x)}{\Gamma(a)}</math>

<math>Q(a,x)=\frac{\Gamma(a,x)}{\Gamma(a)}=1-P(a,x).</math>

Connection with Kummer's confluent hypergeometric function

It is easily shown that, when the real part of z is positive,

<math>

\gamma(a,z) = \int_0^z e^{-t}t^{a-1} dt = a^{-1} z^a e^{-z} M(1,a+1,z), </math>

where M(1, a+1, z) is Kummer's confluent hypergeometric function. Since the series

<math>

M(1, a+1, z) = 1 + \frac{1}{(a+1)}z + \frac{1}{(a+1)(a+2)}z^2 + \frac{1}{(a+1)(a+2)(a+3)}z^3 + \cdots </math>

has an infinite radius of convergence, we may take

<math>

\gamma(a,z) = a^{-1} z^a e^{-z} M(1,a+1,z)\, </math>

as the definition of γ(a, z) for all complex z. In this light, the lower incomplete gamma function γ(a, z) is an entire function of the complex variable z. Since the gamma function Γ(z) is a meromorphic function with simple poles at {0, −1, −2, …}, we may define the meromorphic upper incomplete gamma function as

<math>

\Gamma(a, z) = \Gamma(a) - \gamma(a, z). \, </math>

For the actual computation of numerical values, the continued fraction of Gauss provides a useful expansion:

<math>

\frac{a e^z}{z^a} \gamma(a, z) = \cfrac{1}{1 - \cfrac{z}{a+1 + \cfrac{z}{a+2 - \cfrac{(a+1)z} {a+3 + \cfrac{2z}{a+4 - \cfrac{(a+2)z}{a+5 + \cfrac{3z}{a+6 - \ddots}}}}}}}. </math>

This continued fraction converges for all complex z, provided only that a is not a negative integer.

References

M. Abramowitz and I. A. Stegun, eds. Handbook of Mathematical Functions with Formulas, Graphs, and Mathematical Tables. New York: Dover, 1972. (See section §6.5.)

G. Arfken and H. Weber. Mathematical Methods for Physicists. Harcourt/Academic Press, 2000. (See Chapter 10.)

Armido R. DiDonato, Alfred H. Morris, Jr., Computation of the incomplete gamma function ratios and their inverse, ACM Transactions on Mathematical Software (TOMS), v.12 n.4, p.377-393, Dec. 1986.

Armido R. DiDonato, Alfred H. Morris, Jr., ALGORITHM 654: FORTRAN subroutines for computing the incomplete gamma function ratios and their inverse, ACM Transactions on Mathematical Software (TOMS), v.13 n.3, p.318-319, Sept. 1987. (See also Fortran 90 subroutines for ALGORITHM 654.)

W. H. Press, B. P. Flannery, S. A. Teukolsky, and W. T. Vetterling. Numerical Recipes in C. Cambridge, UK: Cambridge University Press, 1988. (See Section 6.2.)