One Machine, Three Sample Points
Figure 1 — The same four subintervals, two different sample points. On this decreasing curve the left endpoints sit below the graph, so the left sum undercounts the area while the right sum overcounts it.
Every Riemann sum on a uniform partition has the same skeleton. The interval is cut into pieces of width , and the sum is times the heights at chosen -values. What changes between LRAM, RRAM, and MRAM is only which -values get sampled.
| Name | Sample point in the -th piece | Written form |
|---|---|---|
| LRAM (left) | the left end, | |
| RRAM (right) | the right end, | |
| MRAM (midpoint) | the middle, |
Two structural facts fall out of the table and save time under pressure. LRAM and RRAM share every height except the two outermost ones, so their difference is exactly . And MRAM never uses an endpoint, which is why a table that gives you the endpoints and the middle values is handing you all three sums at once.