scholarly journals Eighth-Order Iterative Methods without Derivatives for Solving Nonlinear Equations

2011 ◽  
Vol 2011 ◽  
pp. 1-12 ◽  
Author(s):  
R. Thukral
Keyword(s):  
Nonlinear Equations ◽  
Convergence Order ◽  
Optimal Order ◽  
Eighth Order ◽  
Optimal Order Of Convergence ◽  
New Methods ◽  
New Family ◽  
Derivative Free ◽  
Derivative Free Methods ◽  
Iteration Methods

A new family of eighth-order derivative-free methods for solving nonlinear equations is presented. It is proved that these methods have the convergence order of eight. These new methods are derivative-free and only use four evaluations of the function per iteration. In fact, we have obtained the optimal order of convergence which supports the Kung and Traub conjecture. Kung and Traub conjectured that the multipoint iteration methods, without memory based on evaluations, could achieve optimal convergence order . Thus, we present new derivative-free methods which agree with Kung and Traub conjecture for . Numerical comparisons are made to demonstrate the performance of the methods presented.

scholarly journals New Eighth-Order Derivative-Free Methods for Solving Nonlinear Equations

2012 ◽  
Vol 2012 ◽  
pp. 1-12 ◽  
Author(s):  
Rajinder Thukral
Keyword(s):  
Nonlinear Equations ◽  
Convergence Order ◽  
Order Derivative ◽  
Optimal Order ◽  
Eighth Order ◽  
Optimal Order Of Convergence ◽  
New Family ◽  
Derivative Free ◽  
Derivative Free Methods ◽  
Iteration Methods

A new family of eighth-order derivative-free methods for solving nonlinear equations is presented. It is proved that these methods have the convergence order of eight. These new methods are derivative-free and only use four evaluations of the function per iteration. In fact, we have obtained the optimal order of convergence which supports the Kung and Traub conjecture. Kung and Traub conjectured that the multipoint iteration methods, without memory based onnevaluations could achieve optimal convergence order of . Thus, we present new derivative-free methods which agree with Kung and Traub conjecture for . Numerical comparisons are made to demonstrate the performance of the methods presented.

Design and Analysis of a New Class of Derivative-Free Optimal Order Methods for Nonlinear Equations

2018 ◽  
Vol 15 (03) ◽  
pp. 1850010 ◽  
Author(s):  
Janak Raj Sharma ◽  
Ioannis K. Argyros ◽  
Deepak Kumar
Keyword(s):  
Nonlinear Equations ◽  
Order Of Convergence ◽  
Optimal Order ◽  
Optimal Order Of Convergence ◽  
Numerical Examples ◽  
New Class ◽  
New Methods ◽  
Derivative Free ◽  
Local Convergence Analysis ◽  
Theoretical Results

We develop a general class of derivative free iterative methods with optimal order of convergence in the sense of Kung–Traub hypothesis for solving nonlinear equations. The methods possess very simple design, which makes them easy to remember and hence easy to implement. The Methodology is based on quadratically convergent Traub–Steffensen scheme and further developed by using Padé approximation. Local convergence analysis is provided to show that the iterations are locally well defined and convergent. Numerical examples are provided to confirm the theoretical results and to show the good performance of new methods.

An efficient class of fourth-order derivative-free method for multiple-roots

2021 ◽  
Vol 0 (0) ◽  
Author(s):  
Sunil Kumar ◽  
Deepak Kumar ◽  
Janak Raj Sharma ◽  
Ioannis K. Argyros
Keyword(s):  
Multiple Root ◽  
Second Step ◽  
Optimal Order ◽  
Multiple Roots ◽  
Nonlinear Functions ◽  
New Methods ◽  
Derivative Free ◽  
Derivative Free Methods ◽  
Derivative Free Method ◽  
Good Number

Abstract Many optimal order multiple root techniques, which use derivatives in the algorithm, have been proposed in literature. Many researchers tried to construct an optimal family of derivative-free methods for multiple roots, but they did not get success in this direction. With this as a motivation factor, here, we present a new optimal class of derivative-free methods for obtaining multiple roots of nonlinear functions. This procedure involves Traub–Steffensen iteration in the first step and Traub–Steffensen-like iteration in the second step. Efficacy is checked on a good number of relevant numerical problems that verifies the efficient convergent nature of the new methods. Moreover, we find that the new derivative-free methods are just as competent as the other existing robust methods that use derivatives.

scholarly journals A family of two-point methods with memory for solving nonlinear equations

2011 ◽  
Vol 5 (2) ◽  
pp. 298-317 ◽  
Author(s):  
Miodrag Petkovic ◽  
Jovana Dzunic ◽  
Ljiljana Petkovic
Keyword(s):  
Nonlinear Equations ◽  
Free Parameter ◽  
Convergence Order ◽  
Optimal Order ◽  
Additional Function ◽  
Numerical Examples ◽  
Derivative Free ◽  
With Memory ◽  
Theoretical Results ◽  
High Computational Efficiency

An efficient family of two-point derivative free methods with memory for solving nonlinear equations is presented. It is proved that the convergence order of the proposed family is increased from 4 to at least 2 + ?6 ? 4.45, 5, 1/2 (5 + ?33) ? 5.37 and 6, depending on the accelerating technique. The increase of convergence order is attained using a suitable accelerating technique by varying a free parameter in each iteration. The improvement of convergence rate is achieved without any additional function evaluations meaning that the proposed methods with memory are very efficient. Moreover, the presented methods are more efficient than all existing methods known in literature in the class of two-point methods and three-point methods of optimal order eight. Numerical examples and the comparison with the existing two-point methods are included to confirm theoretical results and high computational efficiency. 2010 Mathematics Subject Classification. 65H05

scholarly journals On two new families of iterative methods for solving nonlinear equations with optimal order

2011 ◽  
Vol 5 (1) ◽  
pp. 93-109 ◽  
Author(s):  
M. Heydari ◽  
S.M. Hosseini ◽  
G.B. Loghmani
Keyword(s):  
Iterative Methods ◽  
Nonlinear Equations ◽  
Efficiency Index ◽  
Convergence Order ◽  
Optimal Order ◽  
Eighth Order ◽  
Optimal Convergence ◽  
Numerical Comparisons ◽  
First Derivative ◽  
The Third

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.

scholarly journals A New Class of Halley’s Method with Third-Order Convergence for Solving Nonlinear Equations

2020 ◽  
Vol 2020 ◽  
pp. 1-13
Author(s):  
Mohammed Barrada ◽  
Mariya Ouaissa ◽  
Yassine Rhazali ◽  
Mariyam Ouaissa
Keyword(s):  
Nonlinear Equations ◽  
Order Of Convergence ◽  
Order Convergence ◽  
Eighth Order ◽  
Third Order ◽  
Numerical Examples ◽  
New Class ◽  
New Methods ◽  
New Family ◽  
Number Of Iterations

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.

scholarly journals A General Class of Derivative Free Optimal Root Finding Methods Based on Rational Interpolation

2015 ◽  
Vol 2015 ◽  
pp. 1-12 ◽  
Author(s):  
Fiza Zafar ◽  
Nusrat Yasmin ◽  
Saima Akram ◽  
Moin-ud-Din Junjua
Keyword(s):  
General Class ◽  
Order Of Convergence ◽  
Rational Interpolation ◽  
Optimal Order ◽  
Optimal Order Of Convergence ◽  
Iterative Schemes ◽  
Root Finding ◽  
New Methods ◽  
Derivative Free ◽  
Special Cases

We construct a new general class of derivative freen-point iterative methods of optimal order of convergence2n-1using rational interpolant. The special cases of this class are obtained. These methods do not need Newton’s iterate in the…first step of their iterative schemes. Numerical computations are presented to show that the new methods are efficient and can be seen as better alternates.

Sign in / Sign up

Export Citation Format

Share Document