2016arXiv (Cornell University)Open access

Rapidly Convergent Summation Formulas involving Stirling Series

Raphael Schumacher

Open full text 3 citations

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.

Open-access reader

About this research paper

What this paper is about

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.

Why it matters

OpenAlex reports 3 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available 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.

Key concepts: Euler summation, Summation by parts, Divergent series, Borel summation, Convergent series, Mathematics, Stirling number, Stirling numbers of the second kind

Related papers

Back to paper searchBrowse research topicsOriginal source
Rapidly Convergent Summation Formulas involving Stirling Series — Research Paper | ScholarLens