‎in this paper‎, ‎we present a new modification of chebyshev-halley‎ ‎method‎, ‎free from second derivatives‎, ‎to solve nonlinear equations‎. ‎the convergence analysis shows that our modification is third-order‎ ‎convergent‎. ‎every iteration of this method requires one function and‎ ‎two first derivative evaluations‎. ‎so‎, ‎its efficiency index is‎ ‎$3^{1/3}=1.442$ that is better than that o...

Keywords: Basin of attraction Simple roots Nonlinear equations Halley method Euler–Chebyshev method a b s t r a c t There are many methods for solving a nonlinear algebraic equation. Here we introduce a family of Halley-like methods and show that Euler–Chebyshev and BSC are just members of the family. We discuss the conjugacy maps and the effect of the extraneous roots on the basins of attracti...

We present a unified local convergence analysis for Chebyshev-Halleytype methods in order to approximate a solution of a nonlinear equation in a Banach space setting. Our methods include the Chebyshev; Halley; super-Halley and other high order methods. The convergence ball and error estimates are given for these methods under the same conditions. Numerical examples are also provided in this stu...

A one-parameter family of iteration functions for finding the simple roots of nonlinear equations is presented. The iteration process is based on one-point approximation by the quadratic equation x + ay + bx + cy + d = 0, where the unknowns b, c and d are determined in terms of a. Different choices of a correspond to different approximating quadratic curves, viz. parabola, circle, ellipse and h...

From a dynamical point of view applied to complex polynomials, we study a number of root–finding iterative methods. We consider Newton’s method, Newton’s method for multiple roots, Jarratt’s method, the super–Halley method, the convex as well as the double convex acceleration of Whittaker’s method, the methods of Chebyshev, Stirling, and Steffensen, among others. Since all of the iterative root...

In this paper, we present a new third-order family of iterative methods in order to compute the multiple roots nonlinear equations when multiplicity (m?1) is known advance. There plethora point-to-point methods, available literature; but our are based on geometric derivation and converge required zero even though derivative becomes or close vicinity zero. We use exponential fitted curve tangenc...

The dynamics of Steffesen-type methods, using a graphical tool for showing the basins of attraction, is presented. The study includes as particular cases, Steffesen-type modifications of the Newton, the two-steps, the Chebyshev, the Halley and the super– Halley iterative methods. The goal is to show that if we are interesting to preserve the convergence properties we must ensure that the deriva...

We 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-Halley root-finding algorithms, as well as the so-called c-methods. The conjugacy classes of these iterative methods are found explicitly....

In this paper, the dynamics of the Chebyshev-Halley family is studied on quadratic polynomials. A singular set, that we call cat set, appears in the parameter space associated to the family. This cat set has interesting similarities with the Mandelbrot set. The parameters space has allowed us to find different elements of the family such that can not converge to any root of the polynomial, sinc...