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

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.

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.


2018 ◽  
Vol 15 (03) ◽  
pp. 1850010 ◽  
Author(s):  
Janak Raj Sharma ◽  
Ioannis K. Argyros ◽  
Deepak Kumar

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.


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.


Mathematics ◽  
2019 ◽  
Vol 7 (12) ◽  
pp. 1221 ◽  
Author(s):  
Raudys R. Capdevila ◽  
Alicia Cordero ◽  
Juan R. Torregrosa

In this work, a new class of iterative methods for solving nonlinear equations is presented and also its extension for nonlinear systems of equations. This family is developed by using a scalar and matrix weight function procedure, respectively, getting sixth-order of convergence in both cases. Several numerical examples are given to illustrate the efficiency and performance of the proposed 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.


2010 ◽  
Vol 2010 ◽  
pp. 1-12 ◽  
Author(s):  
Muhammad Aslam Noor ◽  
Khalida Inayat Noor ◽  
Eisa Al-Said ◽  
Muhammad Waseem

We suggest and analyze some new iterative methods for solving the nonlinear equationsf(x)=0using the decomposition technique coupled with the system of equations. We prove that new methods have convergence of fourth order. Several numerical examples are given to illustrate the efficiency and performance of the new methods. Comparison with other similar methods is given.


2012 ◽  
Vol 2012 ◽  
pp. 1-15 ◽  
Author(s):  
H. Montazeri ◽  
F. Soleymani ◽  
S. Shateyi ◽  
S. S. Motsa

We consider a system of nonlinear equationsF(x)=0. A new iterative method for solving this problem numerically is suggested. The analytical discussions of the method are provided to reveal its sixth order of convergence. A discussion on the efficiency index of the contribution with comparison to the other iterative methods is also given. Finally, numerical tests illustrate the theoretical aspects using the programming package Mathematica.


2018 ◽  
Vol 14 (1) ◽  
pp. 179-187
Author(s):  
Jivandhar Jnawali ◽  
Chet Raj Bhatta

 The main purpose of this paper is to derive two higher order iterative methods for solving nonlinear equations as variants of Mir, Ayub and Rafiq method. These methods are free from higher order derivatives. We obtain these methods by amalgamating Mir, Ayub and Rafiq method with standard secant method and modified secant method given by Amat and Busquier. The order of convergence of new variants are four and six. Also, numerical examples are given to compare the performance of newly introduced methods with the similar existing methods. 2010 AMS Subject Classification: 65H05 Journal of the Institute of Engineering, 2018, 14(1): 179-187


2014 ◽  
Vol 11 (05) ◽  
pp. 1350078 ◽  
Author(s):  
XIAOFENG WANG ◽  
TIE ZHANG

In this paper, we present some three-point Newton-type iterative methods without memory for solving nonlinear equations by using undetermined coefficients method. The order of convergence of the new methods without memory is eight requiring the evaluations of three functions and one first-order derivative in per full iteration. Hence, the new methods are optimal according to Kung and Traubs conjecture. Based on the presented methods without memory, we present two families of Newton-type iterative methods with memory. Further accelerations of convergence speed are obtained by using a self-accelerating parameter. This self-accelerating parameter is calculated by the Hermite interpolating polynomial and is applied to improve the order of convergence of the Newton-type method. The corresponding R-order of convergence is increased from 8 to 9, [Formula: see text] and 10. The increase of convergence order is attained without any additional calculations so that the two families of the methods with memory possess a very high computational efficiency. Numerical examples are demonstrated to confirm theoretical results.


2021 ◽  
Vol 2 (1) ◽  
pp. 17-24
Author(s):  
Jivandhar Jnawali

In this work, we present two Newton type iterative methods for finding the solution of nonlinear equations of single variable. One is obtained as variant of McDougall and Wotherspoon method, and another is obtained by amalgamation of Potra and Pta’k method and our newly introduced method. The order of convergence of these methods are 1 + √2 and 3.5615. Some numerical examples are given to compare the performance of these methods with some similar existing methods.


Sign in / Sign up

Export Citation Format

Share Document