A note on the recursive calculation of incomplete gamma functions
Author:
Open Access
- 1 March 1999
- journal article
- research article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Mathematical Software
- Vol. 25 (1) , 101-107
Abstract
It is known that the recurrence relation for incomplete gamma functions {γ( a + n , x )}, 0 ≤ a < 1, n = 0, 1, 2 ..., when x is positive, is unstable—more so the larger x . Nevertheless, the recursion can be used in the range 0 ≤ n ≤ 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 .Keywords
This publication has 5 references indexed in Scilit:
- Algorithm 542: Incomplete Gamma Functions [S14]ACM Transactions on Mathematical Software, 1979
- Uniform asymptotic expansions of the incomplete gamma functions and the incomplete beta functionMathematics of Computation, 1975
- Rational Chebyshev approximations for the error functionMathematics of Computation, 1969
- Handbook of Mathematical Functions, with Formulas, Graphs, and Mathematical TablesPhysics Today, 1966
- Sulla funzione gamma incompletaAnnali di Matematica Pura ed Applicata (1923 -), 1950