Next: Some Adaptive Quadrature Methods
Up: NUMERICAL INTEGRATION
Previous: Gaussian Quadrature
Composite Numerical Integration
Newton-Cotes formulas are unsuitable for large integration intervals. Instead we use
the idea of approximating the integrand with piece-wise polynomial functions.
We split up the integral domain into
equal parts, as in Figure
46.
Figure 46:
Composite integration methods split the total integration domain into smaller
parts.
|
|
with
do each one separately. Each integral is then evaluated using a
Newton-Cotes formula such as the trapezoid rule or Simpson's rule. In the case of Simpson's rule
This involves evaluating
at the midpoint of each subinterval. The points where
must be evaluated for the composite form of Simpson's rule are
with
and
. The resulting formula is:
Using the weighted mean value theorem it is straightforward to replace the error term
with a single term
and since
this can be written as
Notice that in going from Simpson's to composite Simpson's rule, the
error went from being
to
Also for this rule
must
be even.
A similar, but simpler argument (in this case
, and n can be any
positive number)
using the trapezoid rule yields
Example:
Lets look at using the composite method for evaluating the integral
We know that the actual value of this integral is
.
First we will use the trapezoidal rule and look at how the error
decreases as we increase the number of intervals,
, we use. Then we
will use Simpson's rule for the integration and again look at how the
error changes as we increase
.
Figure 47 shows the function plotted against the two
trapezoids that the trapezoidal rule would use to approximate the
integral for
. As you can see this approximation
overestimates the area under
considerably. The table
below gives the error as
. But the table also shows that as
we increase the number of intervals the error decreases
significantly. We can also see this in the log-log plot of
versus |
| shown in figure 48. Because this
error line is a straight line there is a power law relating
to
|
|. If we look at the table and compare the errors for
and
we can see that as
increases by ten the
error decreases by approximately 100. Thus we can say that
for some constant
.
Figure:
Plot of the function
over the interval
of integration
along with the trapezoidal approximation for
|
|
Figure:
Log-log plot showing the absolute error of the Trapezoidal rule
numerical integration of
for different numbers
of intevals
.
|
|
 |
Approximate Integral |
Absolute Error |
 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
We can also use Simpson's rule to estimate the integral. Simpson's
Rule requires an even number of intervals. Figure 49
shows
and the polynomial used by the Simpson's
rule to approximate
for
. This polynomial
underestimates
for the first interval and overestimates
for the second interval. The table of errors below shows
that the error for
, Simpson's Rule is much less than for the
Trapezoidal Rule with the same number of intervals. The table
below shows the absolute error for
going from two to two
thousand. Figure 50 also shows this graphically on
a log-log plot. Again we have a power law relationship between
and |
| but in this case it is
for some constant
. So not only is the error less for
but the rate that the error decreases as
increases is
considerably greater. For
we have an error of
compared with an error of
for the trapezoidal rule.
Figure:
Plot of the function
over the interval of integration
along with the Simpson's Rule approximation for
|
|
Figure:
Log-log plot showing the absolute error of Simpson's rule
numerical integration of
for different
numbers of intervals
.
|
|
 |
Approximate integral |
Absolute Error |
 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
Next: Some Adaptive Quadrature Methods
Up: NUMERICAL INTEGRATION
Previous: Gaussian Quadrature
Juan Restrepo
2003-04-12