Euler–Maclaurin formula

From Wikipedia, the free encyclopedia
  (Redirected from Euler–MacLaurin formula)
Jump to: navigation, search

In mathematics, the Euler–Maclaurin formula provides a powerful connection between integrals (see calculus) and sums. It can be used to approximate integrals by finite sums, or conversely to evaluate finite sums and infinite series using integrals and the machinery of calculus. For example, many asymptotic expansions are derived from the formula, and Faulhaber's formula for the sum of powers is an immediate consequence.

The formula was discovered independently by Leonhard Euler and Colin Maclaurin around 1735 (and later generalized as Darboux's formula). Euler needed it to compute slowly converging infinite series while Maclaurin used it to calculate integrals.

The formula[edit]

If m and n are natural numbers and f ( x ) is a complex or real valued continuous function for real numbers x in the interval [m,n], then the integral

I = \int_m^n f(x)\,dx

can be approximated by the sum (or vice versa)

S = f\left(m + 1\right) + \cdots + f\left(n - 1\right) + f(n)

(see trapezoidal rule). The Euler–Maclaurin formula provides expressions for the difference between the sum and the integral in terms of the higher derivatives f ( k ) ( x ) evaluated at the end points of the interval, that is to say when x= m and n.

Explicitly, for a natural number p and a function f(x) that is p times continuously differentiable in the interval [m, n], we have

 S - I = \sum_{k=1}^p {\frac{B_k}{k!}\left(f^{(k - 1)}(n) - f^{(k - 1)}(m)\right)} + R

where Bk is the kth Bernoulli number, with B0 = 1, B1 = +1/2, B2 = 1/6, B3 = 0, B4 = −1/30, B5 = 0, B6 = 1/42, B7 = 0, B8 = −1/30 ..., and R is an error term which is normally small for suitable values of p and depends on n, m, p and f.

The formula is often written with the subscript taking only even values, since the odd Bernoulli numbers are zero except for B1, in which case we have

\sum_{i=m+1}^n f(i) =
    \int^n_m f(x)\,dx + B_1 \left(f(n) - f(m)\right) +
    \sum_{k=1}^p\frac{B_{2k}}{(2k)!}\left(f^{(2k - 1)}(n) - f^{(2k - 1)}(m)\right) + 

The Bernoulli polynomials and periodic function[edit]

The formula is derived below using repeated integration by parts applied to successive intervals [r, r+1] for integers r=m, m+1, \cdots, n-1. The derivation uses the periodic Bernoulli functions, P_k(x) which are defined in terms of the Bernoulli polynomials B_k(x) for k=0,1,2 \cdots.

the Bernoulli polynomials may be defined recursively by

  B_0(x) &= 1 \\
  B_n'(x) &= nB_{n - 1}(x) \text{ and } \int_0^1 B_n(x)\,dx = 0\text{ for }n \ge 1

and the periodic Bernoulli functions are defined as

 P_n(x) = B_n \left(x - \lfloor x\rfloor\right)

where x denotes the largest integer that is not greater than x so that x - ⌊x always lies in the interval [ 0, 1 ].

It can be shown that B_k(1) = B_k(0) for all k \neq 1 so that except for P_1(x), all the periodic Bernoulli functions are continuous. The functions P_k(x) are sometimes written as \tilde{B}_k(x).

The remainder term[edit]

The remainder term R can be written as

 R = \int_m^n f^{(2p)}(x) {P_{2p}(x) \over (2p)!}\,dx

or equivalently, integrating by parts, assuming ƒ(2p) is differentiable again and recalling that all odd Bernoulli numbers (but the first one) are zero:

 R = -\int_m^n f^{(2p+1)}(x) {P_{(2p + 1)}(x) \over (2p + 1)!}\,dx \quad p>0

When n > 0, it can be shown that

\left| B_n \left( x \right) \right| \le \frac{2 \cdot n!}{\left( 2\pi \right)^n}\zeta \left( n \right)

where ζ denotes the Riemann zeta function; one approach to prove this inequality is to obtain the Fourier series for the polynomials Bn(x). The bound is achieved for even n when x is zero. The term ζ(n) may be omitted for odd n but the proof in this case is more complex (see Lehmer:[1])

Using this inequality, the size of the remainder term can be estimated using

\left|R\right|\leq\frac{2 \zeta (2p)}{(2\pi)^{2p}}\int_m^n\left|f^{(2p)}(x)\right|\ \, dx

Applicable formula[edit]

We can use the formula as a means of approximating a finite integral, with the following simple formula:[2]

 I = \int_{x_0}^{x_N} f(x)\,\mathrm{d}x= h\left(\frac{f_{0}}{2} + f_1 +f_2+\cdots+f_{N-1} + \frac{f_{N}}{2} \right) + \frac{h^2}{12}[f'_0 - f'_N] - \frac{h^4}{720}[f'''_0 - f'''_N]+ \cdots ,

where N is the number of points in the interval of integration from  x_0 to  x_N and h is the distance between points so that  h=(x_N - x_0)/N. Note the series above is usually not convergent; indeed, often the terms will increase rapidly after a number of iterations. Thus, attention generally needs to be paid to the remainder term.

This may be viewed as an extension of the trapezoid rule by the inclusion of correction terms.[2]


The Basel problem[edit]

The Basel problem asks to determine the sum

 1 + \frac14 + \frac19 + \frac1{16} + \frac1{25} + \cdots = \sum_{n=1}^\infty \frac{1}{n^2}

Euler computed this sum to 20 decimal places with only a few terms of the Euler–Maclaurin formula in 1735. This probably convinced him that the sum equals π2 / 6, which he proved in the same year.[3] Parseval's identity for the Fourier series of f(x) = x gives the same result.

Sums involving a polynomial[edit]

If f is a polynomial and p is big enough, then the remainder term vanishes. For instance, if f(x) = x3, we can choose p = 2 to obtain after simplification

\sum_{i=0}^n i^3 = \left(\frac{n(n + 1)}{2}\right)^2

(see Faulhaber's formula).

Numerical integration[edit]

The Euler–Maclaurin formula is also used for detailed error analysis in numerical quadrature. It explains the superior performance of the trapezoidal rule on smooth periodic functions and is used in certain extrapolation methods. Clenshaw–Curtis quadrature is essentially a change of variables to cast an arbitrary integral in terms of integrals of periodic functions where the Euler–Maclaurin approach is very accurate (in that particular case the Euler–Maclaurin formula takes the form of a discrete cosine transform). This technique is known as a periodizing transformation.

Asymptotic expansion of sums[edit]

In the context of computing asymptotic expansions of sums and series, usually the most useful form of the Euler–Maclaurin formula is

\sum_{n=a}^b f(n) \sim \int_a^b f(x)\,dx + \frac{f(b) + f(a)}{2} + \sum_{k=1}^\infty \,\frac{B_{2k}}{(2k)!}\left(f^{(2k - 1)}(b) - f^{(2k - 1)}(a)\right)

where a and b are integers.[4] Often the expansion remains valid even after taking the limits {\scriptstyle a\to -\infty} or {\scriptstyle b\to +\infty}, or both. In many cases the integral on the right-hand side can be evaluated in closed form in terms of elementary functions even though the sum on the left-hand side cannot. Then all the terms in the asymptotic series can be expressed in terms of elementary functions. For example,

\sum_{k=0}^\infty \frac{1}{(z + k)^2} \sim \underbrace{\int_0^\infty\frac{1}{(z + k)^2}\,dk}_{= \frac{1}{z}} + \frac{1}{2z^2} + \sum_{t = 1}^\infty \frac{B_{2t}}{z^{2t + 1}}

Here the left-hand side is equal to {\scriptstyle \psi^{(1)}(z)}, namely the first-order polygamma function defined through {\scriptstyle \psi^{(1)}(z)=\frac{d^2}{dz^2}\ln \Gamma(z)}; the gamma function {\scriptstyle \Gamma(z)} is equal to {\scriptstyle (z-1)!} if {\scriptstyle z} is a positive integer. This results in an asymptotic expansion for {\scriptstyle \psi^{(1)}(z)}. That expansion, in turn, serves as the starting point for one of the derivations of precise error estimates for Stirling's approximation of the factorial function.


  •  \sum_{k=1}^n \frac{1}{k^s} = \frac{1}{n^{s-1}} + s \int_1^n \frac{\lfloor x\rfloor}{x^{s+1}} dx \qquad \text{with }\quad s \in \R \setminus \{1\}
  •  \sum_{k=1}^n \frac{1}{k} = \log n + \frac{1}{2} + \frac{1}{2n} - \int_1^n \frac{x-\lfloor x\rfloor}{x^{2}} dx


Derivation by mathematical induction[edit]

We follow the argument given in Apostol.[5]

The Bernoulli polynomials Bn(x) and the periodic Bernoulli functions Pn(x) for n = 0, 1 ,2, ... were introduced above.

The first several Bernoulli polynomials are

  B_1(x) &= x - \frac{1}{2} \\
  B_2(x) &= x^2 - x + \frac{1}{6} \\
  B_3(x) &= x^3 - \frac{3}{2}x^2 + \frac{1}{2}x \\
  B_4(x) &= x^4 - 2x^3 + x^2 - \frac{1}{30} \\
         & \vdots

The values Bn(0) are the Bernoulli numbers. Notice that for n ≠ 1 we have

B_n(0) = B_n(1) = B_n\quad(n\text{th Bernoulli number})

For n = 1,

 B_1(0) = -B_1(1) = B_1

The functions Pn agree with the Bernoulli polynomials on the interval [ 0, 1 ] and are periodic with period 1. Furthermore, except when n = 1, they are also continuous. Thus,

 P_n(0) = P_n(1) = B_n, n \neq 1

Let k be an integer, and consider the integral

 \int_k^{k + 1} f(x)\,dx = \int_k^{k + 1} u\,dv


   u &= f(x) \\
  du &= f'(x)\,dx \\
  dv &= P_0(x)\,dx && \text{since }P_0(x) = 1 \\
   v &= P_1(x)

Integrating by parts, we get

 \int_k^{k + 1} f(x)\,dx &= \Big[uv\Big]_k^{k + 1} - \int_k^{k + 1} v\,du \\
                         &= \Big[f(x)P_1(x)\Big]_k^{k + 1} - \int_k^{k+1} f'(x)P_1(x)\,dx \\[8pt]
                         &= B_1(1)f(k+1)-B_1(0)f(k) - \int_k^{k+1} f'(x)P_1(x)\,dx

Summing the above from k = 0 to k = n − 1, we get

\int_0^1 f(x)\,dx + \dotsb + \int_{n-1}^n f(x)\,dx &= \int_0^n f(x)\, dx  \\
&= \frac{f(0)}{2}+ f(1) + \dotsb + f(n-1) + {f(n) \over 2} - \int_0^n f'(x) P_1(x)\,dx

Adding (f(n) - f(0))/2 to both sides and rearranging, we have

 \sum_{k=1}^n f(k) = \int_0^n f(x)\,dx + {f(n) - f(0) \over 2} + \int_0^n f'(x) P_1(x)\,dx\qquad (1)

The last two terms therefore give the error when the integral is taken to approximate the sum.

Next, consider

 \int_k^{k+1} f'(x)P_1(x)\,dx = \int_k^{k + 1} u\,dv


   u &= f'(x) \\
  du &= f''(x)\,dx \\
  dv &= P_1(x)\,dx \\
   v &= \frac{1}{2}P_2(x)

Integrating by parts again, we get

  \Big[uv\Big]_k^{k + 1} - \int_k^{k + 1} v\,du &= \left[ {f'(x)P_2(x) \over 2} \right]_k^{k+1} - {1 \over 2}\int_k^{k+1} f''(x)P_2(x)\,dx \\
                  &= {B_2 \over 2}(f'(k + 1) - f'(k)) - {1 \over 2}\int_k^{k + 1} f''(x)P_2(x)\,dx

Then summing from k = 0 to k = n − 1, and then replacing the last integral in (1) with what we have thus shown to be equal to it, we have

 \sum_{k=1}^n f(k) = \int_0^n f(x)\,dx + {f(n) - f(0) \over 2} + \frac{B_2}{2}(f'(n) - f'(0)) - {1 \over 2}\int_0^n f''(x)P_2(x)\,dx.

By now the reader will have guessed that this process can be iterated. In this way we get a proof of the Euler–Maclaurin summation formula which can be formalized by mathematical induction, in which the induction step relies on integration by parts and on the identities for periodic Bernoulli functions.

See also[edit]


  1. ^ Lehmer, D. H. (1940). "On the maxima and minima of Bernoulli polynomials". The American Mathematical Monthly 47 (8): 533–538. 
  2. ^ a b Devries, Paul L.; Hasbrun, Javier E. (2011). A first course in computational physics. (2nd ed.). Jones and Bartlett Publishers. p. 156. 
  3. ^ Pengelley, David J. "Dances between continuous and discrete: Euler's summation formula", in: Robert Bradley and Ed Sandifer (Eds), Proceedings, Euler 2K+2 Conference (Rumford, Maine, 2002), Euler Society, 2003.
  4. ^ Abramowitz & Stegun (1972), 23.1.30
  5. ^ Apostol, T. M. (1 May 1999). "An Elementary View of Euler's Summation Formula". The American Mathematical Monthly (Mathematical Association of America) 106 (5): 409–418. doi:10.2307/2589145. ISSN 0002-9890. JSTOR 2589145.