Skip Navigation

The Computer Journal 1971 14(3):301-306; doi:10.1093/comjnl/14.3.301
© 1971 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (2)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Oliver, J.
Right arrow Search for Related Content
Social Bookmarking
 Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

The evaluation of definite integrals using high-order formulae

J. Oliver *

Computing Centre, University of Essex, Colchester, UK

The use of high-order integration formulae in general-purpose library routines is widely discouraged in the literature. The reasons advanced for the recommended preference for the trapezoidal, mid-point and Simpson's rules are here analysed, and found to be either irrelevant to modern computation, or highly inconclusive. Attainable error bounds are presented which help to make high-order formulae equally attractive in problems for which they were formerly regarded as inefficient.


Received September 1969. Revised July 1970.

* Computing Centre, University of Essex, Colchester, Essex


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.