No label defined (Q3345654)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3879971
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 3879971 |
Statements
1983
0 references
Euler-MacLaurin formula
0 references
integral-free summation formulas
0 references
0.8364670276641846
0 references
0.8242135643959045
0 references
0.820181131362915
0 references
0.8199087381362915
0 references
0.81528639793396
0 references
[For the entire collection see Zbl 0532.00009.] The famous Euler-Maclaurin formula is an approximate way to calculate an integral by means of a summation of the values of the function and its derivative values in some points. The formula can be used as a way to calculate a summation by means of the integral and some values of the function and its derivative values. Well, the formula states that \[ \int^{x_ n}_{x_ 0}f(x)dx=h[(f(x_ 0)+f(x_ n))+\sum^{n- 1}_{k=1}[f(x_ k)]- \] \[ \sum^{m}_{k=1}B_{2k}h^{2^ k}/(2k)![f^{(2^ k-1)}(x_ n)-f^{(2^ k-1)}(x_ 0)+R_{2m}. \] where \(B_{2k}\) are the Bernoulli numbers and \(h=\Delta x_ i=x_{i+1}-x_ i\). That is to say that taking \(x_ k=k\), it results \(h=1\) and by neglecting the rest, we get: \[ \sum^{n}_{k=0}f(k)=\int^{n}_{0}f(x)dx+(f(0)+f(n))+\sum^{m}_{k= 1}B_{2k}/(2k)![f^{(2^ k-1)}(n)-f^{(2^ k-1)}(0)]. \] The author remarks that the integral term can be replaced by means of Simpson's rule, or other quadrature formulas, and the accuracy of the formula remains quite the same. That is to say that there is no need to invoke the integral when performing an approximate summation. The author remarks too, that it will often be more convenient to sum an approximating polynomial and he indicates how to determine the collocation points in an optimal way.
0 references