Lecture 4 - Computer Science Department - University of Kentucky
Lecture 4 - Computer Science Department - University of Kentucky
Lecture 4 - Computer Science Department - University of Kentucky
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
Partition<br />
The definite integral <strong>of</strong> a function can be viewed as the area under a<br />
curve. This point <strong>of</strong> view lends us means to compute dfii definite integral<br />
Let P be a partition <strong>of</strong> the interval <strong>of</strong> [a,b] as<br />
P<br />
{ a = x < x < x < < x < x b}<br />
= 0 1 2 L n −1 n =<br />
We have n subintervals as [x i ,x i+1 ]. Let m i be the greatest lower bound <strong>of</strong><br />
(a nonnegative function) f(x) on [x i ,x i+1 ] as<br />
m<br />
i<br />
{ f ( x)<br />
: x ≤ x ≤ x }<br />
= i<br />
inf i<br />
+<br />
and M i as the least upper bound on the same subinterval<br />
M<br />
i<br />
{ f ( x)<br />
: x ≤ x ≤ x }<br />
= i<br />
sup i<br />
+<br />
1<br />
1<br />
4