Remote Access Mathematics of Computation
Green Open Access

Mathematics of Computation

ISSN 1088-6842(online) ISSN 0025-5718(print)



Error bounds for Gauss-Kronrod quadrature formulae

Author: Sven Ehrich
Journal: Math. Comp. 62 (1994), 295-304
MSC: Primary 65D32; Secondary 41A55
MathSciNet review: 1208221
Full-text PDF Free Access

Abstract | References | Similar Articles | Additional Information

Abstract: The Gauss-Kronrod quadrature formula $ Q_{2n + 1}^{GK}$, is used for a practical estimate of the error $ R_n^G$ of an approximate integration using the Gaussian quadrature formula $ Q_n^G$. Studying an often-used theoretical quality measure, for $ Q_{2n + 1}^{GK}$ we prove best presently known bounds for the error constants

$\displaystyle {c_s}(R_{2n + 1}^{GK}) = \mathop {\sup }\limits_{{{\left\Vert {{f^{(s)}}} \right\Vert}_\infty } \leq 1} \vert R_{2n + 1}^{GK}[f]\vert$

in the case $ s = 3n + 2 + \kappa ,\kappa = \left\lfloor {\frac{{n + 1}}{2}} \right\rfloor - \left\lfloor {\frac{n}{2}} \right\rfloor $. A comparison with the Gaussian quadrature formula $ Q_{2n + 1}^G$ shows that there exist quadrature formulae using the same number of nodes but having considerably better error constants.

References [Enhancements On Off] (What's this?)

Similar Articles

Retrieve articles in Mathematics of Computation with MSC: 65D32, 41A55

Retrieve articles in all journals with MSC: 65D32, 41A55

Additional Information

Keywords: Gauss-Kronrod quadrature formulae, error constants
Article copyright: © Copyright 1994 American Mathematical Society