Nonlinear Equations - UFRJ
Nonlinear Equations - UFRJ
Nonlinear Equations - UFRJ
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
[SEC. 10.3: AVERAGE COMPLEXITY OF RANDOMIZED ALGORITHMS 151<br />
B<br />
U<br />
1<br />
A<br />
a 1 O<br />
b 1<br />
Figure 10.2: Geometric Lemma.<br />
Lemma 10.19. Let A = (a 1 , a 2 ), B = (b 1 , b 2 ) ∈ R 2 be two points in<br />
the plane, such that U = (0, 1) ∈ [A, B]. Then,<br />
|b 1 − a 1 | ≤ ‖A‖‖B‖.<br />
Proof. (See figure 10.2) We interpret |b 1 − a 1 | as the area of the<br />
rectangle of corners (a 1 , 0), (b 1 , 0), (b 1 , 1), (a 1 , 1).<br />
We claim that this is twice the area of the triangle (O, A, B).<br />
Indeed,<br />
Area(O, A, B) = Area(O, U, A) + Area(O, U, B)<br />
Therefore,<br />
= Area(O, U, (a 1 , 0)) + Area(O, U, (b 1 , 0))<br />
= 1 2 |b 1 − a 1 |<br />
|b 1 − a 1 | = 2Area(O, A, B) = ‖A‖‖B‖ sin(ÂOB) ≤ ‖A‖‖B‖<br />
M(f t ; 0, 1)<br />
≤<br />
≤<br />
∫ 1<br />
0<br />
∫ 1<br />
0<br />
(<br />
‖ I − 1 )<br />
‖F t ‖ 2 F tF ∗ t Ḟ t ‖‖F t ‖ µ2 2(F t )<br />
‖F t ‖ 2 dt<br />
‖F 0 ‖‖F 1 ‖ µ2 2(F t )<br />
‖F t ‖ 2 dt