zbMATH — the first resource for mathematics

Examples
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.

Operators
a & b logic and
a | b logic or
!ab logic not
abc* right wildcard
"ab c" phrase
(ab c) parentheses
Fields
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)
Derivative-based closed Newton-Cotes numerical quadrature. (English) Zbl 1246.65043

Summary: A new family of numerical integration formula of closed Newton-Cotes-type is presented, that uses both the function value and the derivative value on uniformly spaced intervals. Since there are more unknowns when using including derivative values in addition to function values, the order of accuracy of these numerical integration formula are higher than the standard closed Newton-Cotes formula. These new formulae are derived via the method of undetermined coefficients, based on the concept of the precision of the quadrature formula. The error terms are found in three different ways, using the concept of precision, using Taylor series expansions about the interval midpoint and using polynomial approximating functions, which is how the error terms for the standard closed Newton-Cotes formula were obtained.

The concept of precision and the Taylor series methods yield the same error terms as the polynomial-based method, but there are certain unverifiable assumptions in their use. Quadrature formula using first derivatives at all points throughout the interval increase the order of accuracy to 2n+2. Quadrature formula using the first derivatives at the endpoints of the interval obtain an increase of two orders of accuracy over the closed Newton-Cotes formula; while quadrature formula involving higher order derivatives result in substantially higher orders of accuracy, being (D+1)(n+1) where D is the number of derivatives involved in the formula.

The computational cost for these methods are analyzed for two different examples, showing the number of function and derivative evaluations necessary to reduce the error below a certain level. These two numerical examples are used to demonstrate that the theoretical order of accuracy is achieved by the numerical implementation of these formula. Additionally, a generalized Rolle’s Theorem with derivatives and a theorem for the error in the general interpolating polynomial including derivatives are provided in the appendix, which leads to the proof of some of the error terms in the derivative-based closed Newton-Cotes-type quadrature formula.

MSC:
65D32Quadrature and cubature formulas (numerical methods)
41A55Approximate quadratures
References:
[1]Babolian, E.; Masjed-Jamei, M.; Eslahchi, M. R.: On numerical improvement of Gauss – Legendre quadrature rules, Appl. math. Comput. 160, 779-789 (2005) · Zbl 1062.65028 · doi:10.1016/j.amc.2003.11.031
[2]Eslahchi, M. R.; Masjed-Jamei, M.; Babolian, E.: On numerical improvement of Gauss – lobatto quadrature rules, Appl. math. Comput. 164, 707-717 (2005) · Zbl 1070.65019 · doi:10.1016/j.amc.2004.04.113
[3]Esclahchi, M. R.; Dehghan, M.; Masjed-Jamei, M.: On numerical improvement of the first kind Gauss – Chebyshev quadrature rules, Appl. math. Comput. 165, 5-21 (2005) · Zbl 1079.65023 · doi:10.1016/j.amc.2004.06.102
[4]Dehghan, M.; Masjed-Jamei, M.; Eslahchi, M. R.: On numerical improvement of closed Newton – cotes quadrature rules, Appl. math. Comput. 165, 251-260 (2005) · Zbl 1070.65018 · doi:10.1016/j.amc.2004.07.009
[5]Masjed-Jamei, M.; Eslahchi, M. R.; Dehghan, M.: On numerical improvement of Gauss – radau quadrature rules, Appl. math. Comput. 168, 51-64 (2005) · Zbl 1085.41023 · doi:10.1016/j.amc.2004.08.046
[6]Esclahchi, M. R.; Dehghan, M.; Masjed-Jamei, M.: The first kind Chebyshev – Newton – cotes quadrature rules (closed type) and its numerical improvement, Appl. math. Comput. 168, 479-495 (2005) · Zbl 1084.65025 · doi:10.1016/j.amc.2004.09.048
[7]Dehghan, M.; Masjed-Jamei, M.; Eslahchi, M. R.: The semi-open Newton – cotes quadrature rule and its numerical improvement, Appl. math. Comput. 171, 1129-1140 (2005) · Zbl 1090.65033 · doi:10.1016/j.amc.2005.01.137
[8]Dehghan, M.; Masjed-Jamei, M.; Eslahchi, M. R.: On numerical improvement of open Newton – cotes quadrature rules, Appl. math. Comput. 175, 618-627 (2006) · Zbl 1088.65022 · doi:10.1016/j.amc.2005.07.030
[9]Isaacson, E.; Keller, H. B.: Analysis of numerical methods, (1966) · Zbl 0168.13101
[10]R. L. Burden, J. D. Faires, ”Numerical Analysis, 8th ed.”, Thomson, Brooks/Cole, 2005.