Fast and stable rational approximation of generalized hypergeometric functions

MaRDI QIDQ6443517zbMATH OpenFDO

Authors Richard M. Slevinsky

Publication date 12 July 2023

Has companion code repository https://github.com/JuliaMath/HypergeometricFunctions.jl

Mathematics Subject Classification ID

Generalized hypergeometric series, ({}_pF_q) (33C20) Numerical approximation and evaluation of special functions (33F05) Approximation by rational functions (41A20) Computation of special functions and constants, construction of tables (65D20)

Abstract: Rational approximations of generalized hypergeometric functions ${}_p{F}_q$ of type $(n+k,k)$ are constructed by the Drummond and factorial Levin-type sequence transformations. We derive recurrence relations for these rational approximations that require $mathcalO[maxp,q(n+k)]$ flops. These recurrence relations come in two forms: for the successive numerators and denominators; and, for an auxiliary rational sequence and the rational approximations themselves. Numerical evidence suggests that these recurrence relations are much more stable than the original formulae~for the Drummond and factorial Levin-type sequence transformations. Theoretical results on the placement of the poles of both transformations confirm the superiority of factorial Levin-type transformation over the Drummond transformation.

This page was built for publication: Fast and stable rational approximation of generalized hypergeometric functions

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