zbMATH — the first resource for mathematics

Geometry Search for the term Geometry in any field. Queries are case-independent.
Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact.
"Topological group" Phrases (multi-words) should be set in "straight quotation marks".
au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted.
Chebyshev | Tschebyscheff The or-operator | allows to search for Chebyshev or Tschebyscheff.
"Quasi* map*" py: 1989 The resulting documents have publication year 1989.
so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14.
"Partial diff* eq*" ! elliptic The not-operator ! eliminates all results containing the word elliptic.
dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles.
py: 2000-2015 cc: (94A | 11T) Number ranges are accepted. Terms can be grouped within (parentheses).
la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.

a & b logic and
a | b logic or
!ab logic not
abc* right wildcard
"ab c" phrase
(ab c) parentheses
any anywhere an internal document identifier
au author, editor ai internal author identifier
ti title la language
so source ab review, abstract
py publication year rv reviewer
cc MSC code ut uncontrolled term
dt document type (j: journal article; b: book; a: book article)
On numerical improvement of open Newton--Cotes quadrature rules. (English) Zbl 1088.65022
Summary: We discuss the numerical improvement of the open Newton-Cotes integration rules that are in forms of $$\int_{a=x_{-1}}^{b=x_{n+1}= x_{-1}+(n+2)h} f(x)\,dx\simeq \sum_{k=0}^n B_k^{(n)} f(x_{-1}+ (k+1)h).$$ It is known that the precision degree of above formula is $n+1$ for even $n$’s and is $n$ for odd $n$’s. However, if the integral bounds are considered as two additional variables (i.e. $a$ and $h$ in fact) we reach a nonlinear system that numerically improves the precision degree of the above integration formula up to degree $n+2$. In this way, some numerical tests are given to show the numerical superiority of our idea with respect to the usual open Newton-Cotes integration rules.

65D32Quadrature and cubature formulas (numerical methods)
41A55Approximate quadratures
Full Text: DOI
[1] Atkinson, K.: An introduction to numerical analysis. (1989) · Zbl 0718.65001
[2] Babolian, E.; Masjed-Jamei, M.; Eslahchi, M. R.: On numerical improvement of Gauss-Legendre quadrature rules. Applied mathematics and computation 160, No. 3, 779-789 (2005) · Zbl 1062.65028
[3] Burden, R. L.; Faires, J. Douglas: Numerical analysis. (2001) · Zbl 0671.65001
[4] Conte, S. D.; De Boor, C.: Elementary numerical analysis--an algorithmic approach. (1981) · Zbl 0496.65001
[5] Davis, R.; Rabinowitz, P.: Methods of numerical integration. (1984) · Zbl 0537.65020
[6] Dehghan, M.; Masjed-Jamei, M.; Eslahchi, M. R.: On numerical improvement of closed Newton-cotes quadrature rules. Applied mathematics and computation 165, No. 2, 251-260 (2005) · Zbl 1070.65018
[7] Eslahchi, M. R.; Masjed-Jamei, M.; Babolian, E.: On numerical improvement of Gauss-lobatto quadrature rules. Applied mathematics and computation 164, No. 3, 274-280 (2005) · Zbl 1070.65019
[8] Eslahchi, M. R.; Dehghan, M.; Masjed-Jamei, M.: On numerical improvement of the first kind of Gauss-Chebyshev quadrature rules. Applied mathematics and computation 165, No. 1, 5-21 (2005) · Zbl 1079.65023
[9] Gautschi, W.: Numerical analysis: an introduction. (1997) · Zbl 0877.65001
[10] Isaacson, E.; Keller, H. B.: Analysis of numerical methods. (1966) · Zbl 0168.13101
[11] Krylov, V. I.: Approximate calculation of integrals. (1962) · Zbl 0111.31801
[12] M. Masjed-Jamei, M.R. Eslahchi, M. Dehghan, On numerical improvement of Gauss-Radua quadrature rules, Applied Mathematics and Computation, in press. · Zbl 1085.41023