scholarly journals On a New Iterative Scheme without Memory with Optimal Eighth Order

2014 ◽  
Vol 2014 ◽  
pp. 1-6 ◽  
Author(s):  
M. Sharifi ◽  
S. Karimi Vanani ◽  
F. Khaksar Haghani ◽  
M. Arab ◽  
S. Shateyi

The purpose of this paper is to derive and discuss a three-step iterative expression for solving nonlinear equations. In fact, we derive a derivative-free form for one of the existing optimal eighth-order methods and preserve its convergence order. Theoretical results will be upheld by numerical experiments.

2011 ◽  
Vol 5 (2) ◽  
pp. 298-317 ◽  
Author(s):  
Miodrag Petkovic ◽  
Jovana Dzunic ◽  
Ljiljana Petkovic

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


2012 ◽  
Vol 2012 ◽  
pp. 1-12 ◽  
Author(s):  
Rajinder Thukral

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.


Mathematics ◽  
2020 ◽  
Vol 8 (4) ◽  
pp. 540 ◽  
Author(s):  
Xiaofeng Wang ◽  
Qiannan Fan

In this paper, a self-accelerating type method is proposed for solving nonlinear equations, which is a modified Ren’s method. A simple way is applied to construct a variable self-accelerating parameter of the new method, which does not increase any computational costs. The highest convergence order of new method is 2 + 6 ≈ 4.4495 . Numerical experiments are made to show the performance of the new method, which supports the theoretical results.


2011 ◽  
Vol 2011 ◽  
pp. 1-12 ◽  
Author(s):  
R. Thukral

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.


2015 ◽  
Vol 2015 ◽  
pp. 1-5
Author(s):  
M. Sharifi ◽  
S. Karimi Vanani ◽  
F. Khaksar Haghani ◽  
M. Arab ◽  
S. Shateyi

The aim of this paper is to construct a method with memory according to King’s family of methods without memory for nonlinear equations. It is proved that the proposed method possesses higherR-order of convergence using the same number of functional evaluations as King’s family. Numerical experiments are given to illustrate the performance of the constructed scheme.


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 ◽  
2020 ◽  
Vol 8 (2) ◽  
pp. 271 ◽  
Author(s):  
Ramandeep Behl ◽  
Ioannis K. Argyros

Many real-life problems can be reduced to scalar and vectorial nonlinear equations by using mathematical modeling. In this paper, we introduce a new iterative family of the sixth-order for a system of nonlinear equations. In addition, we present analyses of their convergences, as well as the computable radii for the guaranteed convergence of them for Banach space valued operators and error bounds based on the Lipschitz constants. Moreover, we show the applicability of them to some real-life problems, such as kinematic syntheses, Bratu’s, Fisher’s, boundary value, and Hammerstein integral problems. We finally wind up on the ground of achieved numerical experiments, where they perform better than other competing schemes.


2013 ◽  
Vol 2013 ◽  
pp. 1-5 ◽  
Author(s):  
Malik Zaka Ullah ◽  
A. S. Al-Fhaid ◽  
Fayyaz Ahmad

We present an iterative method for solving nonlinear equations. The proposed iterative method has optimal order of convergence sixteen in the sense of Kung-Traub conjecture (Kung and Traub, 1974); it means that the iterative scheme uses five functional evaluations to achieve 16(=25-1) order of convergence. The proposed iterative method utilizes one derivative and four function evaluations. Numerical experiments are made to demonstrate the convergence and validation of the iterative method.


Algorithms ◽  
2020 ◽  
Vol 13 (1) ◽  
pp. 25
Author(s):  
Janak Raj Sharma ◽  
Sunil Kumar ◽  
Ioannis K. Argyros

We discuss the local convergence of a derivative-free eighth order method in a Banach space setting. The present study provides the radius of convergence and bounds on errors under the hypothesis based on the first Fréchet-derivative only. The approaches of using Taylor expansions, containing higher order derivatives, do not provide such estimates since the derivatives may be nonexistent or costly to compute. By using only first derivative, the method can be applied to a wider class of functions and hence its applications are expanded. Numerical experiments show that the present results are applicable to the cases wherein previous results cannot be applied.


Sign in / Sign up

Export Citation Format

Share Document