Family Of Eighth-order Iterative Methods Research Articles

An Optimal Eighth-Order Family of Iterative Methods for Multiple Roots

In this paper, we introduce a new family of efficient and optimal iterative methods for finding multiple roots of nonlinear equations with known multiplicity ( m ≥ 1 ) . We use the weight function approach involving one and two parameters to develop the new family. A comprehensive convergence analysis is studied to demonstrate the optimal eighth-order convergence of the suggested scheme. Finally, numerical and dynamical tests are presented, which validates the theoretical results formulated in this paper and illustrates that the suggested family is efficient among the domain of multiple root finding methods.

A new highly efficient and optimal family of eighth-order methods for solving nonlinear equations

The principle aim of this manuscript is to present a new highly efficient and optimal eighth-order family of iterative methods to solve nonlinear equations in the case of simple roots. The derivation of this scheme is based on weight function and rational approximation approaches. The proposed family requires only four functional evaluations (viz. f(xn) f′(xn) f(yn) and f(zn)) per iteration. Therefore, the proposed family is optimal in the sense of Kung–Traub hypotheses. In addition, we given a theorem which describing the order of convergence of the proposed family. Moreover, we present a local convergence analysis using hypotheses only on the first-order derivative, since in our preceding theorem we used hypotheses on higher-order derivatives that do not appear in these methods. In this way, we expand the applicability of these methods even further. Furthermore, a variety of nonlinear equations is considered for the numerical experiments. It is observed from the numerical experiments that our proposed methods perform better than the existing optimal methods of same order, when the accuracy is checked in multi precision digits.

A note on the paper “A new general eighth-order family of iterative methods for solving nonlinear equations”

In this work, we briefly talk about the incorrect convergence order presented in the paper Khan et al. (Appl. Math. Lett. 25:2262–2266, 2012). Accordingly, we first show that their convergence theorem includes major errors, and it is attempted to provide the correct error equation of their method having fifth-order not eighth-order convergence. Finally, to support our assertion, some numerical examples are tested.

A New Optimal Eighth-Order Ostrowski-Type Family of Iterative Methods for Solving Nonlinear Equations

Based on Ostrowski's method, a new family of eighth-order iterative methods for solving nonlinear equations by using weight function methods is presented. Per iteration the new methods require three evaluations of the function and one evaluation of its first derivative. Therefore, this family of methods has the efficiency index which equals 1.682. Kung and Traub conjectured that a multipoint iteration without memory based on n evaluations could achieve optimal convergence order 2n−1. Thus, we provide a new class which agrees with the conjecture of Kung-Traub for n=4. Numerical comparisons are made to show the performance of the presented methods.

A class of optimal eighth-order derivative-free methods for solving the Danchick–Gauss problem

A derivative-free optimal eighth-order family of iterative methods for solving nonlinear equations is constructed using weight functions approach with divided first order differences. Its performance, along with several other derivative-free methods, is studied on the specific problem of Danchick’s reformulation of Gauss’ method of preliminary orbit determination. Numerical experiments show that such derivative-free, high-order methods offer significant advantages over both, the classical and Danchick’s Newton approach.

A new optimal eighth-order family of iterative methods for the solution of nonlinear equations

In this paper a new optimal family of methods for solving nonlinear equations is presented. It is proved by analysis of convergence that each member of the family, which requires three evaluations of the function and one evaluation of its first derivative per iteration, is of optimal order eight. Numerical comparisons are made with several other existing eighth-order methods by using the basins of attraction and through numerical computations to demonstrate the efficiency and the performance of the presented methods.

Three-step iterative methods with eighth-order convergence for solving nonlinear equations

A family of eighth-order iterative methods for solution of nonlinear equations is presented. We propose an optimal three-step method with eight-order convergence for finding the simple roots of nonlinear equations by Hermite interpolation method. Per iteration of this method requires two evaluations of the function and two evaluations of its first derivative, which implies that the efficiency index of the developed methods is 1.682. Some numerical examples illustrate that the algorithms are more efficient and performs better than the other methods.

A new general eighth-order family of iterative methods for solving nonlinear equations

In this work, we present a family of iterative methods for solving nonlinear equations. It is proved that these methods have convergence order 8. These methods require three evaluations of the function, and only use one evaluation of the first derivative per iteration. The efficiency of the method is tested on a number of numerical examples. On comparison with the eighth-order methods, the iterative methods in the new family behave either similarly or better for the test examples.

A new family of eighth-order iterative methods for solving nonlinear equations

A family of eighth-order iterative methods with four evaluations for the solution of nonlinear equations is presented. Kung and Traub conjectured that an iteration method without memory based on n evaluations could achieve optimal convergence order 2 n - 1 . The new family of eighth-order methods agrees with the conjecture of Kung–Traub for the case n = 4 . Therefore this family of methods has efficiency index equal to 1.682. Numerical comparisons are made with several other existing methods to show the performance of the presented methods.

Three-step iterative methods with eighth-order convergence for solving nonlinear equations

A family of eighth-order iterative methods for the solution of nonlinear equations is presented. The new family of eighth-order methods is based on King’s fourth-order methods and the family of sixth-order iteration methods developed by Chun et al. Per iteration the new methods require three evaluations of the function and one evaluation of its first derivative. Therefore this family of methods has the efficiency index which equals 1.682. Kung and Traub conjectured that a multipoint iteration without memory based on n evaluations could achieve optimal convergence order 2 n − 1 . Thus we provide a new example which agrees with the conjecture of Kung–Traub for n = 4 . Numerical comparisons are made to show the performance of the presented methods.