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

2014 ◽  
Vol 2014 ◽  
pp. 1-7
Author(s):  
Taher Lotfi ◽  
Tahereh Eftekhari

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.

2014 ◽  
Vol 2014 ◽  
pp. 1-7 ◽  
Author(s):  
Fiza Zafar ◽  
Gulshan Bibi

We present a family of fourteenth-order convergent iterative methods for solving nonlinear equations involving a specific step which when combined with any two-step iterative method raises the convergence order by n+10, if n is the order of convergence of the two-step iterative method. This new class include four evaluations of function and one evaluation of the first derivative per iteration. Therefore, the efficiency index of this family is 141/5 =1.695218203. Several numerical examples are given to show that the new methods of this family are comparable with the existing methods.


2011 ◽  
Vol 5 (1) ◽  
pp. 93-109 ◽  
Author(s):  
M. Heydari ◽  
S.M. Hosseini ◽  
G.B. Loghmani

In this paper, two new families of eighth-order iterative methods for solving nonlinear equations is presented. These methods are developed by combining a class of optimal two-point methods and a modified Newton?s method in the third step. Per iteration the presented methods require three evaluations of the function and one evaluation of its first derivative and therefore have the efficiency index equal to 1:682. Kung and Traub conjectured that a multipoint iteration without memory based on n evaluations could achieve optimal convergence order 2n?1. Thus the new families of eighth-order methods agrees with the conjecture of Kung-Traub for the case n = 4. Numerical comparisons are made with several other existing methods to show the performance of the presented methods.


2020 ◽  
Vol 2020 ◽  
pp. 1-13
Author(s):  
Mohammed Barrada ◽  
Mariya Ouaissa ◽  
Yassine Rhazali ◽  
Mariyam Ouaissa

In this paper, we present a new family of methods for finding simple roots of nonlinear equations. The convergence analysis shows that the order of convergence of all these methods is three. The originality of this family lies in the fact that these sequences are defined by an explicit expression which depends on a parameter p where p is a nonnegative integer. A first study on the global convergence of these methods is performed. The power of this family is illustrated analytically by justifying that, under certain conditions, the method convergence’s speed increases with the parameter p. This family’s efficiency is tested on a number of numerical examples. It is observed that our new methods take less number of iterations than many other third-order methods. In comparison with the methods of the sixth and eighth order, the new ones behave similarly in the examples considered.


2016 ◽  
Vol 14 (1) ◽  
pp. 443-451 ◽  
Author(s):  
Somayeh Sharifi ◽  
Massimiliano Ferrara ◽  
Mehdi Salimi ◽  
Stefan Siegmund

AbstractIn this paper, we present a family of three-point with eight-order convergence methods for finding the simple roots of nonlinear equations by suitable approximations and weight function based on Maheshwari’s method. Per iteration this method requires three evaluations of the function and one evaluation of its first derivative. These class of methods have the efficiency index equal to ${8^{{\textstyle{1 \over 4}}}} \approx 1.682$. We describe the analysis of the proposed methods along with numerical experiments including comparison with the existing methods. Moreover, the attraction basins of the proposed methods are shown with some comparisons to the other existing methods.


2014 ◽  
Vol 2014 ◽  
pp. 1-6 ◽  
Author(s):  
Tahereh Eftekhari

Based on iterative methods without memory of eighth-order convergence proposed by Thukral (2012), some iterative methods with memory and high efficiency index are presented. We show that the order of convergence is increased without any additional function evaluations. Numerical comparisons are made to show the performance of the presented methods.


2018 ◽  
Vol 2018 ◽  
pp. 1-12 ◽  
Author(s):  
Alicia Cordero ◽  
Moin-ud-Din Junjua ◽  
Juan R. Torregrosa ◽  
Nusrat Yasmin ◽  
Fiza Zafar

We construct a family of derivative-free optimal iterative methods without memory to approximate a simple zero of a nonlinear function. Error analysis demonstrates that the without-memory class has eighth-order convergence and is extendable to with-memory class. The extension of new family to the with-memory one is also presented which attains the convergence order 15.5156 and a very high efficiency index 15.51561/4≈1.9847. Some particular schemes of the with-memory family are also described. Numerical examples and some dynamical aspects of the new schemes are given to support theoretical results.


Mathematics ◽  
2019 ◽  
Vol 7 (8) ◽  
pp. 672 ◽  
Author(s):  
Saima Akram ◽  
Fiza Zafar ◽  
Nusrat Yasmin

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.


2014 ◽  
Vol 2014 ◽  
pp. 1-9 ◽  
Author(s):  
S. Artidiello ◽  
A. Cordero ◽  
Juan R. Torregrosa ◽  
M. P. Vassileva

A class of optimal iterative methods for solving nonlinear equations is extended up to sixteenth-order of convergence. We design them by using the weight function technique, with functions of three variables. Some numerical tests are made in order to confirm the theoretical results and to compare the new methods with other known ones.


2012 ◽  
Vol 2012 ◽  
pp. 1-9 ◽  
Author(s):  
Alicia Cordero ◽  
Mojtaba Fardi ◽  
Mehdi Ghasemi ◽  
Juan R. Torregrosa

We propose a family of eighth-order iterative methods without memory for solving nonlinear equations. The new iterative methods are developed by using weight function method and using an approximation for the last derivative, which reduces the required number of functional evaluations per step. Their efficiency indices are all found to be 1.682. Several examples allow us to compare our algorithms with known ones and confirm the theoretical results.


Sign in / Sign up

Export Citation Format

Share Document