cp ~bfarr/NumInt_start.mws ~

You can copy the worksheet now, but you should read through the lab
before you load it into Maple. Once you have read to the exercises,
start up Maple, load
the worksheet `NumInt_start.mws`, and go through it
carefully. Then you can start working on the exercises.

Both methods start by dividing the interval into subintervals of equal length by choosing a partition

satisfying

where

is the length of each subinterval. For the trapezoidal rule, the integral over each subinterval is approximated by the area of a trapezoid. This gives the following approximation to the integral

There is also an error term associated with the trapezoidal rule that can be used to estimate the error. More precisely, we have

where

for some value between and .

One way to use this error term is as a way to bound the number of
subintervals required to achieve a certain tolerance. That is, suppose
is a small number and we want to determine a value of
that guarantees

If we substitute the error formula from above into this inequality and rearrange it to isolate we get the following.

Now, if we let be the maximum of on the interval , we can take the square root of both sides of the equation to obtain the following estimate for .

The way to think about this result is that it gives a value for which guarantees that the error of the trapezoidal rule is less than the tolerance . It is generally a very conservative result. As you will discover in the exercises, the actual number of subintervals required to satisfy the tolerance is usually much smaller than the number given by the error estimate.

For Simpson's rule, the function is approximated by a parabola over
pairs of subintervals. When the areas under the parabolas are computed
and summed up, the result is the following approximation.

As for the trapezoidal rule, there is an error formula which says that

where

for some value between and .

As we did for the trapezoidal rule, we can rearrange this formula to
allow us to estimate the number of subintervals required so that we
can guarantee

Using essentially the same steps as we used for the trapezoidal rule, we get the following inequality.

where is the maximum of on the interval .

- For the following functions and intervals, complete the
following steps.
- (i)
- By using Maple's
`int`and, possibly,`evalf`commands, find a good approximation to the integral of the function over the given interval. - (ii)
- Use the error estimate for the trapezoidal rule to find a value for , the number of subintervals, that ensures that the error in is less than . Compute the value of for the value of you found and verify that it is within of the value you found in part (i).
- (iii)
- Use the error estimate for Simpson's rule to find a value for , the number of subintervals, that ensures that the error in is less than . Compute the value of for the value of you found and verify that it is within of the value you found in part (i).

- , interval .
- , interval .

- Earlier in the course, we learned that we could approximate
integrals by using Taylor polynomials. The commands below show how
to do this for the integral you worked with above, using the Taylor
polynomial of order 10.
> with(CalcP7): > evalf(int(Taylor(exp(-x^2),x=0,10),x=0..2));

By increasing the order of the Taylor polynomial, find the smallest order such that this approximation is within of the value you found in part (i) of the previous exercise. How do you think this method compares to using Simpson's rule?

2003-04-11