Академический Документы
Профессиональный Документы
Культура Документы
1.1 answer
First attempt this exercise using the standard partition. The presence of square roots in the Riemann Sum creates difculties. You will then see the reason for strange choice of partition.
9/16
4/16
i 1 n j 1 n
i 1 2
i 2
j 1 2
j 2 is the distance between the two n n n n
i 1 2 n 1 2i 1 2 2j 1 n2
i n
j n
j 1 n
2
203
i
j 1
2
j n. Thus
1 2n n2 1 8n2 n2 8 8 2 n n3
8n
2 n4
i2 n2
2 i 1 2 n
j2 n2
2 j 1 2 n
2i 1 2 j 1 n4
i2 n 2 j 2 n2
Ii j
for each i
j; 1
i
j
1 i j n
f xi j Ii j
1 i j n
i2 j 2 n4
2i 1 2 j 1 n4
1 n6 1
1 n6 i 1 1 n6 1 n6
n i 1 n
i j n n n j 1
i 2i 1 j 2 j 1 i 2i 1 j 2 j 1
i 2i 2i2
1
j 1 2
j 2 j 1
i 1
n 1 2 i2 n6 i 1
1 n n 1 2n 1 n n 1 2 n6 6 2 2 2 2 n n 1 1 2n 1 n 6 3 2 2 2 2 n n 1 4n 1 62 n6 2 2 1 1 n 4 1 n 36
i 1
c jbquig-UCD
Thus
xyd x
y
lim R f
Pn 2 1 1 n 4 1 n lim n 36 2 2 1 0 4 0 36 4 9
n
i 1
i j 1
j k 1
k n n n n n n
i
j
k
1 i jk n
Ii
jk
i i 1 n n
j n
j 1 n
k k 1 n n
1 n
1 n
1 n
1 n3
as expected all subintervals have the same measure. Next we compute the span of a subinterval;
span Ii jk
d
i n j n k n
i i 1 n n 1 n 3 n
2
i 1 j 1 k 1 2
j n 1 n
j 1 n
2
1 n
1 2
k k 1 n n
2
1 2
as expected all subintervals have the same span which thus equals the mesh of the partition (recall mesh=max span ). 3 mesh Pn n
c jbquig-UCD
As a nal preliminary to forming a Riemann sum lets pick a point in each subinterval; put xi jk
i n j n k n
Ii jk
i
j
k
We are ready to form and compute a Rieman Sum for the function f over the partition Pn of the rectangloid I. R f
Pn f xi jk Ii jk 1 i jk n
1 i jk n
1 n3
f xi jk
1 n
3
1 i jk n
f xi jk
But f xi jk 0 unless xi jk
i n
j n 1 n3
k n
in which case f xi jk 1 . R f
Pn
1 i j k;i j k n
1 1
1 n3
1 k n1 j n k1 i n j k
Note the manipulation of the index range, see lecture notes. We compute the easy inner sum.
1 n3
1 k n1 j n k
j k
J n k 1; j n k
j 0.
1 n3 1 n3
1 k n0 J n k 1
1 k n
n k 1 n k 2
K n 1; k n
K 0.
1 n3 1 2n3
0 K n 1
K 1 K 2
0 K n 1
K2 1
0 K n 1
n n 1 2 1 3n n 1 6 4
c jbquig-UCD
Thus
lim
1 4 1 1 2 1 12 n n
1 1 0 1 2 0 12
1 6
c jbquig-UCD