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 Family of Fourteenth-Order Convergent Iterative Methods for Solving Nonlinear Equations

2014 ◽  
Vol 2014 ◽  
pp. 1-7 ◽  
Author(s):  
Fiza Zafar ◽  
Gulshan Bibi
Keyword(s):  
Iterative Method ◽  
Iterative Methods ◽  
Nonlinear Equations ◽  
Order Of Convergence ◽  
Efficiency Index ◽  
Numerical Examples ◽  
New Class ◽  
First Derivative ◽  
New Methods ◽  
Specific Step

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.

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.

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
Keyword(s):  
Weight Function ◽  
Iterative Methods ◽  
Nonlinear Equations ◽  
Efficiency Index ◽  
Eighth Order ◽  
New Class ◽  
First Derivative ◽  
New Methods ◽  
New Family ◽  
Ostrowski’S Method

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.

scholarly journals On Some Iterative Methods with Memory and High Efficiency Index for Solving Nonlinear Equations

2014 ◽  
Vol 2014 ◽  
pp. 1-6 ◽  
Author(s):  
Tahereh Eftekhari
Keyword(s):  
Iterative Methods ◽  
Nonlinear Equations ◽  
Order Of Convergence ◽  
High Efficiency ◽  
Efficiency Index ◽  
Order Convergence ◽  
Eighth Order ◽  
Additional Function ◽  
Numerical Comparisons ◽  
With Memory

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.

scholarly journals Modification of Newton-Househölder Method for Determining Multiple Roots of Unknown Multiplicity of Nonlinear Equations

Mathematics ◽  
2021 ◽  
Vol 9 (9) ◽  
pp. 1020
Author(s):  
Syahmi Afandi Sariman ◽  
Ishak Hashim ◽  
Faieza Samat ◽  
Mohammed Alshbool
Keyword(s):  
Nonlinear Equations ◽  
Order Of Convergence ◽  
High Accuracy ◽  
Basins Of Attraction ◽  
Convergence Order ◽  
Multiple Roots ◽  
Eighth Order ◽  
Numerical Examples

In this study, we propose an extension of the modified Newton-Househölder methods to find multiple roots with unknown multiplicity of nonlinear equations. With four functional evaluations per iteration, the proposed method achieves an optimal eighth order of convergence. The higher the convergence order, the quicker we get to the root with a high accuracy. The numerical examples have shown that this scheme can compete with the existing methods. This scheme is also stable across all of the functions tested based on the graphical basins of attraction.

scholarly journals Some Class of Third- and Fourth-Order Iterative Methods for Solving Nonlinear Equations

2014 ◽  
Vol 2014 ◽  
pp. 1-17 ◽  
Author(s):  
J. P. Jaiswal
Keyword(s):  
Iterative Methods ◽  
Nonlinear Equations ◽  
Fourth Order ◽  
Basins Of Attraction ◽  
Order Method ◽  
Third Order ◽  
Numerical Examples ◽  
Multivariate Extension ◽  
New Class ◽  
Fourth Order Method

The object of the present work is to give the new class of third- and fourth-order iterative methods for solving nonlinear equations. Our proposed third-order method includes methods of Weerakoon and Fernando (2000), Homeier (2005), and Chun and Kim (2010) as particular cases. The multivariate extension of some of these methods has been also deliberated. Finally, some numerical examples are given to illustrate the performances of our proposed methods by comparing them with some well existing third- and fourth-order methods. The efficiency of our proposed fourth-order method over some fourth-order methods is also confirmed by basins of attraction.

scholarly journals A New Sixth Order Method for Nonlinear Equations inR

2014 ◽  
Vol 2014 ◽  
pp. 1-5 ◽  
Author(s):  
Sukhjit Singh ◽  
D. K. Gupta
Keyword(s):  
Iterative Method ◽  
Nonlinear Equations ◽  
Order Of Convergence ◽  
Performance Measure ◽  
Sixth Order ◽  
Order Method ◽  
Numerical Examples ◽  
Real Roots ◽  
New Iterative Method ◽  
Number Of Iterations

A new iterative method is described for finding the real roots of nonlinear equations inR. Starting with a suitably chosenx0, the method generates a sequence of iterates converging to the root. The convergence analysis is provided to establish its sixth order of convergence. The number of iterations and the total number of function evaluations used to get a simple root are taken as performance measure of our method. The efficacy of the method is tested on a number of numerical examples and the results obtained are summarized in tables. It is observed that our method is superior to Newton’s method and other sixth order methods considered.

Fast Root-Finding of Nonlinear Equations in Geometric Computation

2013 ◽  
Vol 756-759 ◽  
pp. 2808-2812
Author(s):  
Chang Chun Geng ◽  
Zhong Li ◽  
Tian He Zhou ◽  
Bin Yang
Keyword(s):  
Iterative Method ◽  
Nonlinear Equations ◽  
Order Of Convergence ◽  
Divided Difference ◽  
Order Convergence ◽  
Root Finding ◽  
Geometric Problems ◽  
New Family ◽  
Seventh Order ◽  
Roots Of Polynomials

Computing the roots of polynomials is an important issue in various geometric problems. In this paper, we introduce a new family of iterative methods with sixth and seventh order convergence for nonlinear equations (or polynomials). The new method is obtained by combining a different fourth-order iterative method with Newtons method and using the approximation based on the divided difference to replace the derivative. It can improve the order of convergence and reduce the required number of functional evaluations per step. Numerical comparisons demonstrate the performance of the presented methods.

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 An Efficient Family of Optimal Eighth-Order Iterative Methods for Solving Nonlinear Equations and Its Dynamics

2014 ◽  
Vol 2014 ◽  
pp. 1-14 ◽  
Author(s):  
Anuradha Singh ◽  
J. P. Jaiswal
Keyword(s):  
Iterative Methods ◽  
Nonlinear Equations ◽  
Order Of Convergence ◽  
Basins Of Attraction ◽  
Order Method ◽  
Eighth Order ◽  
New Family ◽  
Seventh Order ◽  
Prime Objective ◽  
And Performance

The prime objective of this paper is to design a new family of optimal eighth-order iterative methods by accelerating the order of convergence of the existing seventh-order method without using more evaluations for finding simple root of nonlinear equations. Numerical comparisons have been carried out to demonstrate the efficiency and performance of the proposed method. Finally, we have compared new method with some existing eighth-order methods by basins of attraction and observed that the proposed scheme is more efficient.

Sign in / Sign up

Export Citation Format

Share Document