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. © 1991, ACM. All rights reserved.
CITATION STYLE
Berntsen, J., & Espelid, T. O. (1991). Error Estimation in Automatic Quadrature Routines. ACM Transactions on Mathematical Software (TOMS), 17(2), 233–252. https://doi.org/10.1145/108556.108575
Mendeley helps you to discover research relevant for your work.