Properties

One can show that [Maple Math] has a zero of multiplicity [Maple Math] when [Maple Math] , and [Maple Math] for [Maple Math] but [Maple Math] .

Thus for a zero of multiplicity 1, or a simple zero , [Maple Math] and therefore the Newton-Raphson Method will converge quadratically.

On the other hand, quadratic convergence may no longer occur when looking for a zero of multiplicity larger then 1. Consider the following example:

> f:=x->exp(x)-x-1;

[Maple Math]

> solve(f(x)=0,x);

[Maple Math]

> D(f);D(f)(0);

[Maple Math]

[Maple Math]

> D(D(f));D(D(f))(0);

[Maple Math]

[Maple Math]

> p[0]:=1.0;

[Maple Math]

> for i from 1 to 10 do p[i]:=p[i-1]-f(p[i-1])/(D(f)(p[i-1])): print(i,p[i],abs(p[i]/p[i-1]),abs(p[i]/(p[i-1])^2)); od:

[Maple Math]

[Maple Math]

[Maple Math]

[Maple Math]

[Maple Math]

[Maple Math]

[Maple Math]

[Maple Math]

[Maple Math]

[Maple Math]

which suggests only linear convergence!