Exercise: numerical comparison of iterative methods

Newton, Halley, Ostrowski, Traub, midpoint, Jarratt and double Newton on test functions with tolerance 10⁻¹⁰⁰: iterations, residuals and ACOC confirming the theoretical orders.

Experimental conditions

Seven methods are compared under identical conditions: stopping criterion xk+1xk<10100|x_{k+1}-x_k|<10^{-100} or 60 iterations, with extended-precision arithmetic (400 digits), essential for such extreme tolerances. The test functions and their roots are f1(x)=sinxexf_1(x)=\sin x-e^{-x} with α0.58853274\alpha\approx 0.58853274 and f3(x)=(x1)31f_3(x)=(x-1)^3-1 with α=2\alpha=2.

Results for f₁ (x₀=0.1)

Methoditerf(xk+1)|f(x_{k+1})|xk+1xk|x_{k+1}-x_k|ACOC
Newton86.5531·10⁻²⁰⁵1.0865·10⁻¹⁰²2.0000
Halley605.3661·10⁻¹⁸⁷3.0000
Ostrowski51.2716·10⁻⁴⁰⁸6.7766·10⁻¹⁹⁹4.0000
Traub61.2716·10⁻⁴⁰⁸9.3924·10⁻¹⁶⁶3.0000
Punto medio61.2716·10⁻⁴⁰⁸2.9422·10⁻¹⁹²3.0000
Jarratt51.2716·10⁻⁴⁰⁸5.1327·10⁻¹⁹⁸4.0000
Newton doble51.2716·10⁻⁴⁰⁸4.7250·10⁻²⁰⁵4.0000
Results for f1(x)=sinxexf_1(x)=\sin x-e^{-x} with x0=0.1x_0=0.1.

Results for f₃ (x₀=1.5)

Methoditerf(xk+1)|f(x_{k+1})|xk+1xk|x_{k+1}-x_k|ACOC
Newton112.8174·10⁻³⁵⁹3.0646·10⁻¹⁸⁰2.0000
Halley701.7850·10⁻²¹⁴3.0000
Ostrowski607.3471·10⁻²³⁹4.0000
Traub581.2798·10⁻³⁹³5.9750·10⁻¹³²3.0000
Punto medio72.1994·10⁻³⁹⁹9.2824·10⁻¹³⁴3.0000
Jarratt607.3471·10⁻²³⁹4.0000
Newton doble603.0646·10⁻¹⁸⁰4.0000
Results for f3(x)=(x1)31f_3(x)=(x-1)^3-1 with x0=1.5x_0=1.5.