A Generalization of Classical Formulas in Numerical Integration and Series Convergence Acceleration

arXiv2106.07621MaRDI QIDQ6370280FDOQ6370280

Publication date: 6 June 2021

Abstract: Summation formulas, such as the Euler-Maclaurin expansion or Gregory's quadrature, have found many applications in mathematics, ranging from accelerating series, to evaluating fractional sums and analyzing asymptotics, among others. We show that these summation formulas actually arise as particular instances of a single series expansion, including Euler's method for alternating series. This new summation formula gives rise to a family of polynomials, which contain both the Bernoulli and Gregory numbers in their coefficients. We prove some properties of those polynomials, such as recurrence identities and symmetries. Lastly, we present one case study, which illustrates one potential application of the new expansion for finite impulse response (FIR) filters.

Mathematics Subject Classification ID

Asymptotic approximations, asymptotic expansions (steepest descent, etc.) (41A60) Bernoulli and Euler numbers and polynomials (11B68) Euler-Maclaurin formula in numerical analysis (65B15) Approximation to limiting values (summation of series, etc.) (40A25)

This page was built for publication: A Generalization of Classical Formulas in Numerical Integration and Series Convergence Acceleration

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