Chapter 4: Integration
Section 4.1: Area by Riemann Sums
Essentials
If , the area bounded by the -axis, and the graph of on the interval , is defined to be the limiting value of the Riemann sum
where , , and , form a partition of the interval , with , and .
Figure 4.1.1 Area "under" the graph of
Table 4.1.1 lists six common types of Riemann sums.
upper sum
are chosen so that each is a maximum on
sum is a maximum for that partition
lower sum
are chosen so that each is a minimum on
sum is a minimum for that partition
midpoint sum
are chosen as the midpoints of each subinterval
left sum
(evaluate at the left end of each subinterval)
right sum
(evaluate at the right end of each subinterval)
random sum
are selected at random in each subinterval
Table 4.1.1 Six types of Riemann sums
The limiting process requires and . (The number of subintervals in must become infinite, and the width of the widest subinterval must shrink to zero.)
If is continuous on , the limit exists and is independent of the partition.
The simplest Riemann sums are those in which the are equispaced so that .
Examples
Example 4.1.1
Use a left Riemann sum to obtain the area bounded by the graph of and the -axis.
Example 4.1.2
Use a Riemann sum to obtain the area bounded by the graph of and the -axis.
Example 4.1.3
Use Maple to obtain as the right Riemann sum for , .
Use Maple to evaluate this Riemann sum to .
Obtain closed-form expressions for , , and ; then use these expressions to show how the right Riemann sum becomes .
<< Chapter Overview Table of Contents Next Section >>
© Maplesoft, a division of Waterloo Maple Inc., 2024. All rights reserved. This product is protected by copyright and distributed under licenses restricting its use, copying, distribution, and decompilation.
For more information on Maplesoft products and services, visit www.maplesoft.com
Download Help Document