Numerical representations of the incomplete Gamma function of complex-valued argument

DOI10.1023/B:NUMA.0000040063.91709.58MaRDI QIDQ701929zbMATH OpenOpenAlexWikidataFDO

Authors Richard J. Mathar

Publication date 17 January 2005

Published in Numerical Algorithms (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/math/0306184

zbMATH Keywords

confluent hypergeometric seriesincomplete gamma function

Mathematics Subject Classification ID

Confluent hypergeometric functions, Whittaker functions, ({}_1F_1) (33C15) Numerical approximation and evaluation of special functions (33F05) Computation of special functions and constants, construction of tables (65D20)

Abstract: Various approaches to the numerical representation of the Incomplete Gamma Function F_m(z) for complex arguments z and small integer indexes m are compared with respect to numerical fitness (accuracy and speed). We consider power series, Laurent series, Gautschi's approximation to the Faddeeva function, classical numerical methods of treating the standard integral representation, and others not yet covered by the literature. The most suitable scheme is the construction of Taylor expansions around nodes of a regular, fixed grid in the z-plane, which stores a static matrix of higher derivatives. This is the obvious extension to a procedure often in use for real-valued z.

Review text

Various approaches to the numerical representation of the incomplete Gamma function \[ \gamma (m + 1/2, z)=2\,{z}^{m+1/2}\int \limits^{1}\limits_{0}t^{2m}e^{-zt^2}dt \] for complex arguments \(z\) and non-negative small integer indices \(m\) are compared with respect to numerical fitness (accuracy and speed). The authors consider power series, Laurent series, classical numerical methods of sampling the basic integral representation, and other methods not yet covered by the literature. Working with standard numerical methods on the fundamental integral representation of \(\gamma (m + 1/2, z)\) is generally inefficient as it demands dense sampling of complex exponentials. Continued fraction and rational function approximations are difficult to control, because the regions of known accuracy in the \(z\)-plane are complicated. The most suitable scheme is the construction of Taylor expansions around nodes of a regular, fixed grid in the \(z\)-plane, which stores a static matrix of higher derivatives. This is the obvious extension of a procedure that is in common use for real-valued \(z\).

Recommendations

• scientific article; zbMATH DE number 749874
• A stable recurrence for the incomplete gamma function with imaginary second argument
• On the computation of incomplete gamma functions in the complex domain
• An algorithm for the evaluation of the incomplete gamma function
• Algorithm 926: Incomplete gamma functions with negative arguments

Cited in

(9)

• On the computation of incomplete gamma functions in the complex domain
• Numerical calculation of incomplete gamma functions by the trapezoidal rule
• Incomplete gamma F_m(x) functions for real negative and complex arguments
• A stable recurrence for the incomplete gamma function with imaginary second argument
• Algorithm 926: Incomplete gamma functions with negative arguments
• scientific article; zbMATH DE number 4203560 (Why is no real title available?)
• scientific article; zbMATH DE number 749874 (Why is no real title available?)
• Numerical methods for the computation of the confluent and Gauss hypergeometric functions
• scientific article; zbMATH DE number 6786489 (Why is no real title available?)

This page was built for publication: Numerical representations of the incomplete Gamma function of complex-valued argument

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q701929)