Error estimation in automatic quadrature routines
- 1 June 1991
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Mathematical Software
- Vol. 17 (2) , 233-252
- https://doi.org/10.1145/108556.108575
Abstract
A new algorithm for estimating the error in quadrature approximations is presented. Based on the same integrand evaluations that we need for approximating the integral, one may, for many quadrature rules, compute a sequence of null rule approximations. These null rule approximations are then used to produce an estimate of the local error. The algorithm allows us to take advantage of the degree of precision of the basic quadrature rule. In the experiments we show that the algorithm works satisfactorily for a selection of different quadrature rules on all test families of integrals.Keywords
This publication has 9 references indexed in Scilit:
- An adaptive algorithm for the approximate calculation of multiple integralsACM Transactions on Mathematical Software, 1991
- A discussion of a new error estimate for adaptive quadratureBIT Numerical Mathematics, 1989
- Practical error estimation in adaptive multidimensional quadrature routinesJournal of Computational and Applied Mathematics, 1989
- Sharper error estimates in adaptive quadratureBIT Numerical Mathematics, 1983
- Remarks on algorithm 006: An adaptive algorithm for numerical integration over an N-dimensional rectangular regionJournal of Computational and Applied Mathematics, 1980
- A technique for comparing automatic quadrature routinesThe Computer Journal, 1977
- An adaptive algorithm for numerical integration over an n-dimensional cubeJournal of Computational and Applied Mathematics, 1976
- Comments on the Nature of Automatic Quadrature RoutinesACM Transactions on Mathematical Software, 1976
- Certification of algorithm 145: adaptive numerical integration by Simpson's ruleCommunications of the ACM, 1963