2000 character limit reached
Rapidly Convergent Summation Formulas involving Stirling Series (1602.00336v1)
Published 31 Jan 2016 in math.NT
Abstract: This paper presents a family of rapidly convergent summation formulas for various finite sums of analytic functions. These summation formulas are obtained by applying a series acceleration transformation involving Stirling numbers of the first kind to the asymptotic, but divergent, expressions for the corresponding sums coming from the Euler-Maclaurin summation formula. While it is well-known that the expressions obtained from the Euler-Maclaurin summation formula diverge, our summation formulas are all very rapidly convergent and thus computationally efficient.
Collections
Sign up for free to add this paper to one or more collections.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.