On derivative free cubic convergence iterative methods for solving nonlinear equations

2011 ◽  
Vol 51 (4) ◽  
pp. 513-519 ◽  
Author(s):  
M. Dehghan ◽  
M. Hajarian
Keyword(s):  
Iterative Methods ◽  
Nonlinear Equations ◽  
Cubic Convergence ◽  
Derivative Free

scholarly journals Solving Nonsmooth Equations Using Derivative-Free Methods

2012 ◽  
Vol 3 ◽  
pp. 37-45
Author(s):  
M.S.M. Bahgat ◽  
M.A. Hafiz
Keyword(s):  
Error Analysis ◽  
Nonlinear Equations ◽  
Divided Differences ◽  
Nonsmooth Equations ◽  
Linear Combinations ◽  
Cubic Convergence ◽  
Numerical Examples ◽  
Derivative Free ◽  
Derivative Free Methods ◽  
The Given

In this paper, a family of derivative-free methods of cubic convergence for solving nonlinear equations is suggested. In the proposed methods, several linear combinations of divided differences are used in order to get a good estimation of the derivative of the given function at the different steps of the iteration. The efficiency indices of the members of this family are equal to 1.442. The convergence and error analysis are given. Also, numerical examples are used to show the performance of the presented methods and to compare with other derivative-free methods. And, were applied these methods on smooth and nonsmooth equations.

scholarly journals Generating optimal derivative free iterative methods for nonlinear equations by using polynomial interpolation

2013 ◽  
Vol 57 (7-8) ◽  
pp. 1950-1956 ◽  
Author(s):  
Alicia Cordero ◽  
José L. Hueso ◽  
Eulalia Martínez ◽  
Juan R. Torregrosa
Keyword(s):  
Iterative Methods ◽  
Nonlinear Equations ◽  
Polynomial Interpolation ◽  
Derivative Free

scholarly journals Higher-Order Derivative-Free Iterative Methods for Solving Nonlinear Equations and Their Basins of Attraction

Mathematics ◽  
2019 ◽  
Vol 7 (11) ◽  
pp. 1052 ◽  
Author(s):  
Jian Li ◽  
Xiaomeng Wang ◽  
Kalyanasundaram Madhu
Keyword(s):  
Iterative Methods ◽  
Nonlinear Equations ◽  
Complex Plane ◽  
Dynamical Behavior ◽  
Efficiency Index ◽  
Basins Of Attraction ◽  
Type Method ◽  
New Methods ◽  
Derivative Free ◽  
Higher Order Derivative

Based on the Steffensen-type method, we develop fourth-, eighth-, and sixteenth-order algorithms for solving one-variable equations. The new methods are fourth-, eighth-, and sixteenth-order converging and require at each iteration three, four, and five function evaluations, respectively. Therefore, all these algorithms are optimal in the sense of Kung–Traub conjecture; the new schemes have an efficiency index of 1.587, 1.682, and 1.741, respectively. We have given convergence analyses of the proposed methods and also given comparisons with already established known schemes having the same convergence order, demonstrating the efficiency of the present techniques numerically. We also studied basins of attraction to demonstrate their dynamical behavior in the complex plane.

scholarly journals Numerical Algorithms for Finding Zeros of Nonlinear Equations and Their Dynamical Aspects

2020 ◽  
Vol 2020 ◽  
pp. 1-11 ◽  
Author(s):  
Amir Naseem ◽  
M. A. Rehman ◽  
Thabet Abdeljawad ◽  
Francisco Balibrea
Keyword(s):  
Iterative Methods ◽  
Nonlinear Equations ◽  
Order Of Convergence ◽  
Numerical Algorithms ◽  
One Dimension ◽  
Second Derivative ◽  
Numerical Examples ◽  
Derivative Free ◽  
Interpolation Technique ◽  
Taylor’S Series

In this paper, we developed two new numerical algorithms for finding zeros of nonlinear equations in one dimension and one of them is second derivative free which has been removed using the interpolation technique. We derive these algorithms with the help of Taylor’s series expansion and Golbabai and Javidi’s method. The convergence analysis of these algorithms is discussed. It is established that the newly developed algorithms have sixth order of convergence. Several numerical examples have been solved which prove the better efficiency of these algorithms as compared to other well-known iterative methods of the same kind. Finally, the comparison of polynomiographs generated by other well-known iterative methods with our developed algorithms has been made which reflects their dynamical aspects.

Sign in / Sign up

Export Citation Format

Share Document