Example
3. Use the
value
and
compare Methods A,B and C for finding the quadruple
root
of
the equation
.
Solution 3.
![[Graphics:../Images/NewtonImprovedMod_gr_195.gif]](../Images/NewtonImprovedMod_gr_195.gif)
First, we will compute the iterations for each method, and afterward a table comparing the methods is given. For the method C, all the iterations in the linear search are included.
Using formula (2), the standard Newton-Raphson method.
![[Graphics:../Images/NewtonImprovedMod_gr_197.gif]](../Images/NewtonImprovedMod_gr_197.gif)
![[Graphics:../Images/NewtonImprovedMod_gr_198.gif]](../Images/NewtonImprovedMod_gr_198.gif)
Using formula (9) Method A, the accelerated Newton-Raphson method with m=3.
![[Graphics:../Images/NewtonImprovedMod_gr_200.gif]](../Images/NewtonImprovedMod_gr_200.gif)
Using formula (11) Method B, the modified Newton-Raphson method.
![[Graphics:../Images/NewtonImprovedMod_gr_202.gif]](../Images/NewtonImprovedMod_gr_202.gif)
Using formula (13) Method C, the adaptive Newton-Raphson method.
The details for
obtaining
are:
![[Graphics:../Images/NewtonImprovedMod_gr_205.gif]](../Images/NewtonImprovedMod_gr_205.gif)
Since
we
reject
and
set
and
continue the iteration using formula (13). The subroutine
makes all these choices automatically.
![[Graphics:../Images/NewtonImprovedMod_gr_210.gif]](../Images/NewtonImprovedMod_gr_210.gif)
(c) John H. Mathews 2004