Professional Documents
Culture Documents
Constructive Mathematics. QS 3
Constructive Mathematics. QS 3
QS 3
1. Suppose f ∈ C 4 in a interval containing the root, α and that Newton’s method gives a
sequence of iterates xk , k = 0, 1, 2, . . . which converge to α. Show that Newton’s method
is at least quadratically convergent to α if f 0 (α) 6= 0.
If f 0 (α) = 0, then by using l’Hôpital’s Rule or otherwise, show that Newton’s method is
linearly convergent in both of the cases
What is
|xk+1 − α|
lim
k→∞ |xk − α|
2. Deduce from the above that Newton’s Method has linear convergence to a double root.
Further show that in the case that the multiplicity of a particular root is known to be
m ∈ N (⇒ f (x) = (x − α)m h(x), h(α) 6= 0) then the modified Newton’s method
f (xk )
xk+1 = xk − m
f 0 (xk )
3. (M) Apply Newton’s method with x0 = 12 to find the root α = 0 of the following functions
(a) f (x) = sin x sinh x
(b) f (x) = x cos x
(c) f (x) = x − sin x
and relate the order of convergence observed in each case to question 1 above. (Note that
it is here easier to observe what |xk − α|/|xk−1 − α|p is, at least for p = 1 and possibly
p = 2, since α = 0.)
For (c) make the trivial modification to your matlab code to apply the appropriate
modified Newton’s method; observe the order of convergence.
where xk+1 has been expressed in terms of xk and xk−1 . Find an expression for
f 00 (α)
lim φ(xk , xk−1 ) = .
xk ,xk−1 →α 2f 0 (α)
6. Save this question for Prelims revision: For a given real number c > 0, find the order of
convergence of
c2
1 5c
xk+1 = 5xk + 2 − 5 = G(xk )
9 xk xk
to the real cube root of c.
Determine the other fixed point, d of x = G(x), and show that for no interval a < d <
b can convergence of the fixed point iteration to d be guaranteed by the Contraction
Mapping Theorem.