Abstract
In this chapter we extend the results formulated in Chap. 12 to order m, i.e., to functions of class \(\mathscr {C}^m\), for any \(m\in \mathbb N_{\ge 1}\). Namely, we formulate the Euler–Maclaurin formula, its asymptotic version, its applications to the approximation of finite sums and of sums of convergent series in great generality. The reader will find here not only the general statements of the formulas of order m, but also their detailed proofs, some of which were just sketched out or even skipped entirely in the previous sections. Among the applications, we discover the Hermite formula for the approximations of integrals: it is a refinement of the trapezoidal method which is even more accurate than Simpson’s method.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
Jean Baptiste Joseph Fourier (1768–1830).
- 2.
Johann Peter Gustav Lejeune Dirichlet (1805–1859).
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Mariconda, C., Tonolo, A. (2016). The Euler–Maclaurin Formula of Arbitrary Order. In: Discrete Calculus. UNITEXT(), vol 103. Springer, Cham. https://doi.org/10.1007/978-3-319-03038-8_13
Download citation
DOI: https://doi.org/10.1007/978-3-319-03038-8_13
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-03037-1
Online ISBN: 978-3-319-03038-8
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)