On iterative methods for nonlinear equations (Q864750): Difference between revisions

Several one step and two steps iterative method, based on the generalization of Newton method, are presented on the paper. As a combination of Newton's method and Kanwar's idea to use Taylor formula to derive a auxiliary equation for more speed approximation the following new iterative method is suggested: If the equation \(f(x)=0\) has single root in an open interval \(D\) and the function \(f\) has continuous first-, second- and third-order derivatives in \(D\), let for a given initial guess \(x_0\) compute \(x_1,x_2,\dots\) using the iterative scheme: \[ z_k=x_k-\alpha\cdot 2f(x_k)/\biggl(f'(x_k)\pm\bigl(f^{\prime 2}(x_k)+4p^2f^2 (x_k)\bigr)^{1/2}\biggr);\;x_{k+1}=z_k-f(z_k)/f'(z_k), \] where the sign \(\pm\) should be chosen so as to make the denominator larges in magnitude. The quadratic convergence of this algorithm is proved and several numerical examples are given.