Go to CCP Homepage Go to Materials Page Go to Integral Calculus Materials Go to Table of Contents
Go Back One Page

Numeric Computation of Integrals

Part 6: Summary

  1. A function f(x) has a graph which is decreasing and concave-down over the interval 0 < x < 2. (You should make a rough sketch of the graph on scratch paper to give yourself a visual reference for this problem.)

    We are given that the results of approximating the definite integral of f(x) over the interval [0, 2] using left-hand sums, right-hand sums, trapezoidal sums, and midpoint sums with n = 30 subintervals are the numbers 8.1311, 7.9977, 7.8644, and 8.0011. The only trouble is that these numbers have been scrambled and we aren't told which number comes from which approximation method. Match each number with the approximation method that must have produced it. Explain how you know which is which.

  2. Given just the numbers listed in boldface in step 1, find the highest accuracy approximation that you can for the value of the integral of f(x) over the interval [0, 2] using only a simple "averaging" method.
  3. For a certain integral, suppose the error in the LHS approximation using n = 20 subintervals is 0.002148. Approximately what would you expect the error to be if you computed the LHS approximation with n = 40 subintervals?
  4. In the previous step, suppose the approximation method was really MID, not LHS. How would your answer change? Answer the same question for TRAP and for Simpson's Rule.

Go to CCP Homepage Go to Materials Page Go to Integral Calculus Materials Go to Table of Contents
Go Back One Page


| CCP Home | Materials | Integral Calculus | Module Contents | Back |

modules at math.duke.edu Copyright CCP and the author(s), 1999