Volume 3,  Issue 4, 2002

Article 39

SHARP ERROR BOUNDS FOR THE TRAPEZOIDAL RULE AND SIMPSON'S RULE

D. CRUZ-URIBE AND C.J. NEUGEBAUER

DEPARTMENT OF MATHEMATICS 
TRINITY COLLEGE 
HARTFORD, CT 06106-3100, USA.
E-Mail: david.cruzuribe@mail.trincoll.edu

DEPARTMENT OF MATHEMATICS
PURDUE UNIVERSITY
WEST LAFAYETTE,
N 47907-1395, USA.
E-Mail: neug@math.purdue.edu

Received 04 April, 2002; Accepted 01 May, 2002.
Communicated by: A. Fiorenza


ABSTRACT.   We give error bounds for the trapezoidal rule and Simpson's rule for "rough" continuous functions---for instance, functions which are Hölder continuous, of bounded variation, or which are absolutely continuous and whose derivative is in Lp. These differ considerably from the classical results, which require the functions to have continuous higher derivatives. Further, we show that our results are sharp, and in many cases precisely characterize the functions for which equality holds. One consequence of these results is that for rough functions, the error estimates for the trapezoidal rule are better (that is, have smaller constants) than those for Simpson's rule.
Key words:
Numerical integration, Trapezoidal rule, Simpson's rule

2000 Mathematics Subject Classification:
26A42, 41A55.


Download this article (PDF):

Suitable for a printer:    

Suitable for a monitor:        

To view these files we recommend you save them to your file system and then view by using the Adobe Acrobat Reader. 

That is, click on the icon using the 2nd mouse button and select "Save Target As..." (Microsoft Internet Explorer) or "Save Link As..." (Netscape Navigator).

See our PDF pages for more information.

 

Other papers in this issue

On Weighted Inequalities with Geometric Mean Operator Generated by the Hardy-type Integral Transform
Maria Nassyrova, Lars-Erik Persson and Vladimir Stepanov

Sharp Error Bounds for the Trapezoidal Rule and Simpson's Rule
D. Cruz-Uribe and C.J. Neugebauer

Rate of Convergence of the Discrete Polya Algorithm from Convex Sets. A Particular Case
M. Marano, J. Navas and J.M. Quesada

Approximating the Finite Hilbert Transform via an Ostrowski Type Inequality for Functions of Bounded Variation
S.S. Dragomir

A Polynomial Inequality Generalising an Integer Inequality
Roger B. Eggleton and William P. Galvin

On the Sequence $(p_n^2-p_{n-1}p_{n+1})_{n\ge 2}$
Laurentiu Panaitopol

On an Open Problem of F. Qi
Tibor K. Pogány

On Moduli of Expansion of the Duality Mapping of Smooth Banach Spaces
P.M. Milicic

On Generalizations of L. Yang's Inequality
Chang-jian Zhao and Lokenath Debnath

On a New Type of Meyer-Konig and Zeller Operators
Vijay Gupta

On Multivariate Ostrowski Type Inequalities
B.G. Pachpatte

Algorithms for General Mixed Quasi Variational Inequalities
Muhammad Aslam Noor and Zulfiqar Ali Memon

Some Inequalities and Bounds for Weighted Reliability Measures
Broderick O. Oluyede

On Univalent Harmonic Functions
Metin Öztürk and Sibel Yalçin

On Some Inequalities of Local Times of Iterated Stochastic Integrals
Litan Yan

Lower Bounds for the Infimum of the Spectrum of the Schrödinger Operator in RN and the Sobolev Inequalities
E.J.M. Veling

On Differentiability with Respect to Parameters of the Lebesgue Integral
Vasile Lupulescu

On Certain New Integral Inequalities and their Applications
S.S. Dragomir and Young-Ho Kim

 

Other issues

 

© 2000 School of Communications and Informatics, Victoria University of Technology. All rights reserved.
JIPAM is published by the School of Communications and Informatics which is part of the Faculty of Engineering and Science, located in Melbourne, Australia. All correspondence should be directed to the editorial office.

Copyright/Disclaimer