Iterative methods improving Newton's method by the decomposition method (Q814108)

In order to solve a scalar nonlinear equation \(f(x)=0\), the author constructs a sequence of higher-order iterative methods of Newton-type by applying the so called Adomian's decomposition method, see \textit{G. Adomian} and \textit{R. Rach} [Math. Anal. Appl. 105, 141--166 (1985; Zbl 0552.60060)]. The first two terms in this sequence of methods are: the classical Newton-Raphson method (obtained for \(m=0\)) and the iteration scheme (obtained for \(m=1\)) given by \[ x_{n+1}=x_n- \frac{f(x_n)-f(x^*_{n+1})}{f'(x_n)},\;n=0,1,2,\dots \] where \(x^*_{n+1}\) is calculated as the \((n+1)-\)th iterate in the Newton-Raphson method. The order of convergence of the method obtained for \(m=2\) is derived in Theorem 3.1 and some numerical examples are finally given to illustrate the effectiveness of the new schemes in comparison to other related methods.