Computing the incomplete gamma function to arbitrary precision

18Citations
Citations of this article
10Readers
Mendeley users who have this article in their library.
Get full text

Abstract

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 multiplications uniformly in z for Rez > 0. The error function of the real argument, erf x, requires at most O(P2/3) long multiplications. © Springer-Verlag Berlin Heidelberg 2003.

Cite

CITATION STYLE

APA

Winitzki, S. (2003). Computing the incomplete gamma function to arbitrary precision. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2667, 790–798. https://doi.org/10.1007/3-540-44839-x_83

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free