Search

Based on a two-step Newton-like scheme, we propose a three-step scheme of convergence order p + 2 (p ≥ 3) for solving systems of nonlinear equations. Furthermore, on the basis of this scheme a generalized k+2-step scheme with increasing convergence order p + 2k is presented. Local convergence analysis, including radius of convergence and uniqueness results of the methods, is presented. Computational efciency in the general form is discussed. Theoretical results are verifed through numerical experimentation. Finally, performance is demonstrated by application of the methods on some nonlinear systems of equations. [ABSTRACT FROM AUTHOR]

Abstract An iterative method with fifth order of convergence for solving systems of nonlinear equations is presented. The scheme is composed of three steps, of which the first two steps are that of double Newton’s method with frozen derivative and third step is second derivative-free modification of Chebyshev’s method. The semilocal convergence of the method in Banach spaces is established by using a system of recurrence relations. Then an existence and uniqueness theorem is given to show the R -order of the method to be five and a priori error bounds. Computational complexity is discussed and compared with existing methods. Numerical results are included to confirm theoretical results. A comparison with the existing methods shows that the new method is more efficient than existing ones and hence use the minimum computing time in multiprecision arithmetic. [ABSTRACT FROM AUTHOR]

A plethora of higher order iterative methods, involving derivatives in algorithms, are available in the literature for finding multiple roots. Contrary to this fact, the higher order methods without derivatives in the iteration are difficult to construct, and hence, such methods are almost non-existent. This motivated us to explore a derivative-free iterative scheme with optimal fourth order convergence. The applicability of the new scheme is shown by testing on different functions, which illustrates the excellent convergence. Moreover, the comparison of the performance shows that the new technique is a good competitor to existing optimal fourth order Newton-like techniques. [ABSTRACT FROM AUTHOR]

Numerous higher-order methods with derivative evaluations are accessible in the literature for computing multiple zeros. However, higher-order methods without derivatives are very rare for multiple zeros. Encouraged by this fact, we present a family of third-order derivative-free iterative methods for multiple zeros that require only evaluations of three functions per iteration. Convergence of the proposed class is demonstrated by means of using a graphical tool, namely basins of attraction. Applicability of the methods is demonstrated through numerical experimentation on different functions that illustrates the efficient behavior. Comparison of numerical results shows that the presented iterative methods are good competitors to the existing techniques. [ABSTRACT FROM AUTHOR]

We present a new two-parameter family of fourth-order iterative methods for solving systems of nonlinear equations. The scheme is composed of two Newton–Jarratt steps and requires the evaluation of one function and two first derivatives in each iteration. Convergence including the order of convergence, the radius of convergence, and error bounds is presented. Theoretical results are verified through numerical experimentation. Stability of the proposed class is analyzed and presented by means of using new dynamics tool, namely, the convergence plane. Performance is exhibited by implementing the methods on nonlinear systems of equations, including those resulting from the discretization of the boundary value problem. In addition, numerical comparisons are made with the existing techniques of the same order. Results show the better performance of the proposed techniques than the existing ones. [ABSTRACT FROM AUTHOR]