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.
Author supplied keywords
Cite
CITATION STYLE
APA
Gautschi, W. (1999). A note on the recursive calculation of incomplete gamma functions. ACM Transactions on Mathematical Software, 25(1), 101–107. https://doi.org/10.1145/305658.305717
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free