Nonlinear Equations - UFRJ
Nonlinear Equations - UFRJ
Nonlinear Equations - UFRJ
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
126 [CH. 9: THE PSEUDO-NEWTON OPERATOR<br />
In the projective case s = 1, β scales as ‖X‖ while γ scales as<br />
‖X‖ −1 . α is invariant. This is no more true when s ≥ 2.<br />
We can extend those definitions to projective or multiprojective<br />
space by setting β(f, x) = β(f, X) where X is scaled such that ‖X 1 ‖ =<br />
· · · = ‖X s ‖ = 1. (The same for γ and α).<br />
Lemma 7.9 that was crucial for alpha theory. Now it becomes:<br />
Lemma 9.4. Let X, Y ∈ M and f ∈ F. Assume that u = ‖X −<br />
Y‖γ(f, X) < 1 − √ 2/2. Then,<br />
‖Df(Y) † Df(X)‖ ≤<br />
(1 − u)2<br />
.<br />
ψ(u)<br />
Proof. Expanding Y ↦→ Df(X) † Df(Y) around X, we obtain:<br />
Df(X) † Df(Y) =Df(X) † Df(X)+<br />
+ ∑ 1<br />
k − 1! Df(X)† D k f(X)(Y − X) k−1 .<br />
k≥2<br />
Rearranging terms and taking norms, Lemma 7.6 yields<br />
‖Df(X) † Df(Y) − Df(X) † Df(X)‖ ≤<br />
In particular,<br />
1<br />
(1 − γ‖Y − X‖) 2 − 1.<br />
‖Df(X) † Df(Y) | ker Df(X) ⊥ − Df(X) † Df(X) | ker Df(X) ⊥‖ ≤<br />
1<br />
≤<br />
(1 − γ(f, X)‖Y − X‖) 2 − 1.<br />
Now we have full rank endomorphisms of ker Df(X) ⊥ on the left,<br />
so we can apply Lemma 7.8 to get:<br />
‖Df(Y) −1<br />
| ker Df(X) ⊥ Df(X)‖ ≤<br />
(1 − u)2<br />
. (9.1)<br />
ψ(u)<br />
Because of the minimality property of the pseudo-inverse (see<br />
Lemma 9.2),<br />
‖Df(Y) † Df(X)‖ ≤ ‖Df(Y) −1<br />
| ker Df(X) ⊥ Df(X)‖<br />
so (9.1) proves the Lemma.