Search

There are a few optimal eighth order methods in literature for computing multiple zeros of a nonlinear function. Therefore, in this work our main focus is on developing a new family of optimal eighth order iterative methods for multiple zeros. The applicability of proposed methods is demonstrated on some real life and academic problems that illustrate the efficient convergence behavior. It is shown that the newly developed schemes are able to compete with other methods in terms of numerical error, convergence and computational time. Stability is also demonstrated by means of a pictorial tool, namely, basins of attraction that have the fractal-like shapes along the borders through which basins are symmetric. [ABSTRACT FROM AUTHOR]

We propose a novel family of seventh-order iterative methods for computing multiple zeros of a nonlinear function. The algorithm consists of three steps, of which the first two are the steps of recently developed Liu–Zhou fourth-order method, whereas the third step is based on a Newton-like step. The efficiency index of the proposed scheme is 1.627, which is better than the efficiency index 1.587 of the basic Liu–Zhou fourth-order method. In this sense, the proposed iteration is the modification over the Liu–Zhou iteration. Theoretical results are fully studied including the main theorem of local convergence analysis. Moreover, convergence domains are also assessed using the graphical tool, namely, basins of attraction which are symmetrical through the fractal like boundaries. Accuracy and computational efficiency are demonstrated by implementing the algorithms on different numerical problems. Comparison of numerical experiments shows that the new methods have an edge over the existing methods. [ABSTRACT FROM AUTHOR]

We suggest a derivative-free optimal method of second order which is a new version of a modification of Newton's method for achieving the multiple zeros of nonlinear single variable functions. Iterative methods without derivatives for multiple zeros are not easy to obtain, and hence such methods are rare in literature. Inspired by this fact, we worked on a family of optimal second order derivative-free methods for multiple zeros that require only two function evaluations per iteration. The stability of the methods was validated through complex geometry by drawing basins of attraction. Moreover, applicability of the methods is demonstrated herein on different functions. The study of numerical results shows that the new derivative-free methods are good alternatives to the existing optimal second-order techniques that require derivative calculations. [ABSTRACT FROM AUTHOR]

In this work, we construct a family of seventh order iterative methods for finding multiple roots of a nonlinear function. The scheme consists of three steps, of which the first is Newton's step and last two are the weighted-Newton steps. Hence, the name of the scheme is 'weighted-Newton methods'. Theoretical results are studied exhaustively along with the main theorem describing convergence analysis. Stability and convergence domain of the proposed class are also demonstrated by means of using a graphical technique, namely, basins of attraction. Boundaries of these basins are fractal like shapes through which basins are symmetric. Efficacy is demonstrated through numerical experimentation on variety of different functions that illustrates good convergence behavior. Moreover, the theoretical result concerning computational efficiency is verified by computing the elapsed CPU time. The overall comparison of numerical results including accuracy and CPU-time shows that the new methods are strong competitors for the existing methods. [ABSTRACT FROM AUTHOR]

This manuscript contains the development of a one-point family of iterative functions. The family has optimal convergence of a second-order according to the Kung-Traub conjecture. This family is used to approximate the multiple zeros of nonlinear equations, and is based on the procedure of weight functions. The convergence behavior is discussed by showing some essential conditions of the weight function. The well-known modified Newton method is a member of the proposed family for particular choices of the weight function. The dynamical nature of different members is presented by using a technique called the "basin of attraction". Several practical problems are given to compare different methods of the presented family. [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]