A new method for solving a nonlinear equation with error estimations (Q2564294)

The first step of \textit{C. Brezinski}'s \(\Theta\)-algorithm [Acceleration de la convergence en analyse numerique, Lect. Notes Math. 584 (1977; Zbl 0352.65003)] is used to accelerate the convergence of the method of successive approximations for a fixed point of a single equation in one unknown. The main advantage of the new method in comparison with Steffensen's and Newton's method is when the multiplicity of the root is larger than or equal to two. The rate of convergence of the new method is established, sufficient conditions for convergence for any starting point in an interval are shown and a posteriori error estimates are given. Some of these results also apply to other methods, such as Steffensen's. The paper concludes with some numerical experiments.