In mathematics, Spouge's approximation is a formula for computing an approximation of the
gamma function
In mathematics, the gamma function (represented by Γ, capital Greek alphabet, Greek letter gamma) is the most common extension of the factorial function to complex numbers. Derived by Daniel Bernoulli, the gamma function \Gamma(z) is defined ...
. It was named after John L. Spouge, who defined the formula in a 1994 paper. The formula is a modification of
Stirling's approximation
In mathematics, Stirling's approximation (or Stirling's formula) is an asymptotic approximation for factorials. It is a good approximation, leading to accurate results even for small values of n. It is named after James Stirling, though a related ...
, and has the form
:
where ''a'' is an arbitrary positive integer and the coefficients are given by
:
Spouge has proved that, if Re(''z'') > 0 and ''a'' > 2, the relative error in discarding ''ε''
''a''(''z'') is bounded by
:
The formula is similar to the
Lanczos approximation, but has some distinct features.
[* ] Whereas the Lanczos formula exhibits faster convergence, Spouge's coefficients are much easier to calculate and the error can be set arbitrarily low. The formula is therefore feasible for
arbitrary-precision evaluation of the gamma function. However, special care must be taken to use sufficient precision when computing the sum due to the large size of the coefficients ''c
k'', as well as their alternating sign. For example, for ''a'' = 49, one must compute the sum using about 65 decimal digits of precision in order to obtain the promised 40 decimal digits of accuracy.
See also
*
Stirling's approximation
In mathematics, Stirling's approximation (or Stirling's formula) is an asymptotic approximation for factorials. It is a good approximation, leading to accurate results even for small values of n. It is named after James Stirling, though a related ...
*
Lanczos approximation
References
{{reflist
Gamma and related functions
Computer arithmetic algorithms