It suffices to assume . The polynomial interpolation error for the endpoint linear interpolant gives, for every interior , some withLet , which exists by continuity of the second derivative and the extreme value theorem. Since ,Integrating this pointwise inequality and using the triangle inequality for an integral yieldsThusThis derivation does not require choosing as a continuous function of ; the pointwise upper bound is sufficient.
The constant is sharp. Take the quadratic polynomial and write . Its exact integral is , its trapezoidal rule value is , and . ConsequentlyEquality holds, so no smaller universal constant than works under these assumptions. This is the sharp one-panel trapezoidal error bound.
The trapezoidal rule is exact for every affine function , equivalently every polynomial of polynomial degree at most one: the linear interpolant is the function itself. These functions have , so the preceding upper bound is also zero. There is no contradiction: zero error is precisely what the bound predicts.
The degree of precision of a quadrature rule is one, since the quadratic polynomial in part (i) is not integrated exactly. This does not exclude exactness for particular higher-degree or nonpolynomial functions. For example , , has zero integral and opposite endpoint values, so the trapezoidal rule also gives zero. Its second derivative is generally nonzero, making the upper bound positive; an upper bound need not be attained. Signed quadrature error can cancel.
Articles by others on the same topic
There are currently no matching articles.