Euler summation: Difference between revisions
→Examples: minor cleanup |
m →Definition: notational fix |
||
Line 12: | Line 12: | ||
This method itself cannot be improved by iterated application, as |
This method itself cannot be improved by iterated application, as |
||
:<math> _{E_{y_1}} |
:<math> _{E_{y_1}} {}_{E_{y_2}}\sum = \, _{E_{\frac{y_1 y_2}{1+y_1+y_2}}} \sum</math> |
||
==Examples== |
==Examples== |
Revision as of 06:36, 13 December 2009
Euler summation is a summability method for convergent and divergent series. Given a series Σan, if its Euler transform converges to a sum, then that sum is called the Euler sum of the original series.
Euler summation can be generalized into a family of methods denoted (E, q), where q ≥ 0. The (E, 0) sum is the usual (convergent) sum, while (E, 1) is the ordinary Euler sum. All of these methods are strictly weaker than Borel summation; for q > 0 they are incomparable with Abel summation.
Definition
Euler summation is particularly used to accelerate the convergence of alternating series and allows to evaluate divergent sums.
To justify the approach notice that for interchanged sum, Euler's summation reduces to the initial series, because
- .
This method itself cannot be improved by iterated application, as
Examples
- We have , if is a polynomial of degree k. Note that in this case Euler summation reduces an infinite series to a finite sum.
- The particular choice provides an explicit representation of the Bernoulli numbers, since . Indeed, applying Euler summation to the zeta function yields , which is polynomial for a positive integer; cf. Riemann zeta function.
- . With an appropriate choice of this series converges to .
See also
- Euler transform
- Borel summation
- Cesaro summation
- Lambert summation
- Abelian and tauberian theorems
- Van Wijngaarden transformation
References
- Korevaar, Jacob (2004). Tauberian Theory: A Century of Developments. Springer. ISBN 3-540-21058-X.
- Shawyer, Bruce and Bruce Watson (1994). Borel's Methods of Summability: Theory and Applications. Oxford UP. ISBN 0-19-853585-6.