An alternative to the Euler-Maclaurin summation formula: approximating sums by integrals only
DOI10.1007/s00211-018-0978-yzbMath1478.65005arXiv1511.03247OpenAlexW2810056370WikidataQ129646787 ScholiaQ129646787MaRDI QIDQ1616027
Publication date: 31 October 2018
Published in: Numerische Mathematik (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1511.03247
Inequalities in approximation (Bernstein, Jackson, Nikol'ski?-type inequalities) (41A17) Approximate quadratures (41A55) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Euler-Maclaurin formula in numerical analysis (65B15) One-variable calculus (26A06) Antidifferentiation (26A36)
Related Items (4)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The SIAM 100-Digit Challenge: a decade later. Inspirations, ramifications, and other eddies left in its wake
- The summation formulae of Euler-Maclaurin, Abel-Plana, Poisson, and their interconnections with the approximate sampling formula of signal analysis
- Ramanujan summation and the exponential generating function \(\sum_{k=0}^{\infty}\frac{z^{k}}{k!}\zeta'(-k)\)
- A multimodular algorithm for computing Bernoulli numbers
- Faster computation of Bernoulli numbers
- The SIAM 100-Digit Challenge
- Explicit Formulas for Bernoulli Numbers
- Euler's Constant to 1271 Places
- Quantum field theory
This page was built for publication: An alternative to the Euler-Maclaurin summation formula: approximating sums by integrals only