A general class of four parametric with- and without memory iterative methods for nonlinear equations

2019 ◽  
Vol 57 (5) ◽  
pp. 1448-1471
Author(s):  
Fiza Zafar ◽  
Alicia Cordero ◽  
Juan R. Torregrosa ◽  
Aneeqa Rafi
2011 ◽  
Vol 2011 ◽  
pp. 1-10 ◽  
Author(s):  
F. Soleymani

This paper contributes a very general class of two-point iterative methods without memory for solving nonlinear equations. The class of methods is developed using weight function approach. Per iteration, each method of the class includes two evaluations of the function and one of its first-order derivative. The analytical study of the main theorem is presented in detail to show the fourth order of convergence. Furthermore, it is discussed that many of the existing fourth-order methods without memory are members from this developed class. Finally, numerical examples are taken into account to manifest the accuracy of the derived 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.


2007 ◽  
Vol 48 (3) ◽  
pp. 343-359 ◽  
Author(s):  
Sergio Amat ◽  
Sonia Busquier ◽  
Sergio Plaza

AbstractWe study the dynamics of a family of third-order iterative methods that are used to find roots of nonlinear equations applied to complex polynomials of degrees three and four. This family includes, as particular cases, the Chebyshev, the Halley and the super-Halleyroot-finding algorithms, as well as the so-called c-methods. The conjugacy classes of theseiterative methods are found explicitly.


Sign in / Sign up

Export Citation Format

Share Document