2011
DOI: 10.1007/s11075-011-9499-9
|View full text |Cite
|
Sign up to set email alerts
|

Acceleration of generalized hypergeometric functions through precise remainder asymptotics

Abstract: We express the asymptotics of the remainders of the partial sums {s n } of the generalized hypergeometric function q+1 F q α 1 ,...,α q+1 β 1 ,...,β q z through an inverse power series z n n λ c k n k , where the exponent λ and the asymptotic coefficients {c k } may be recursively computed to any desired order from the hypergeometric parameters and argument. From this we derive a new series acceleration technique that can be applied to any such function, even with complex parameters and at the branch point z =… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
9
0

Year Published

2016
2016
2024
2024

Publication Types

Select...
8

Relationship

0
8

Authors

Journals

citations
Cited by 13 publications
(9 citation statements)
references
References 60 publications
0
9
0
Order By: Relevance
“…Usually, integral representations, polynomial approaches or the numerical solution of differential equations are used for the calculation of the generalized hypergeometric functions. For some new methods, including the remainder deriving, see the work by Willis (2012) and references there. Also, throughout this work we denote as B(x, y) and K γ (x) the beta function and the McDonald function, respectively.…”
Section: Setup and Notationsmentioning
confidence: 99%
“…Usually, integral representations, polynomial approaches or the numerical solution of differential equations are used for the calculation of the generalized hypergeometric functions. For some new methods, including the remainder deriving, see the work by Willis (2012) and references there. Also, throughout this work we denote as B(x, y) and K γ (x) the beta function and the McDonald function, respectively.…”
Section: Setup and Notationsmentioning
confidence: 99%
“…We could cover |z| ≫ 1 by evaluating p F q -series directly, but other methods are needed on the annulus surrounding the unit circle. Convergence accelerations schemes such as [69,7,56] can be effective, but the D-finite analytic continuation approach (with the singular expansion at z = 1) is likely better since effective error bounds are known and since complexity-reduction techniques apply. A study remains to be done.…”
Section: Higher Ordersmentioning
confidence: 99%
“…The only transformation formula employed is the use of the linear transformation when | | z is approaching 1 from below. Recently, Willis [50] proposed an acceleration procedure through precise remainder asymptotics. He expressed the asymptotics of the remainders of the partial sums of the generalized hypergeometric function F p q through an inverse power series where the exponent λ and the asymptotic coefficients c k may be recursively computed to any desired order from the hypergeometric parameters and argument.…”
Section: Recursion Relation For the Phase Shiftmentioning
confidence: 99%
“…when |z| is approaching 1 from below. Recently, Willis [50] proposed an acceleration procedure through precise remainder asymptotics. He expressed the asymptotics of the remainders of the partial sums of the generalized hypergeometric function p F q through an inverse power series…”
Section: Recursion Relation For the Phase Shiftmentioning
confidence: 99%