Remote Access Mathematics of Computation
Green Open Access

Mathematics of Computation

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



Exit criteria for Simpson's compound rule

Authors: J. H. Rowland and Y. L. Varol
Journal: Math. Comp. 26 (1972), 699-703
MSC: Primary 65D30
MathSciNet review: 0341823
Full-text PDF

Abstract | References | Similar Articles | Additional Information

Abstract: In many automated numerical algorithms, the calculations are stopped when the difference between two successive approximations is less than a preassigned tolerance. The dependability of this procedure for Simpson's compound rule has been investigated. Classes of functions have been determined for which the above criterion is (a) always valid, and (b) asymptotically valid. A new exit rule is proposed which appears to be less conservative than the standard technique.

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

Similar Articles

Retrieve articles in Mathematics of Computation with MSC: 65D30

Retrieve articles in all journals with MSC: 65D30

Additional Information

Keywords: Numerical integration, exit criteria, stopping inequality
Article copyright: © Copyright 1972 American Mathematical Society

American Mathematical Society