Abstract
In this paper, we present a new variant of Chebyshev’s method for solving non-linear equations. Analysis of convergence shows that the new method has sixth-order convergence. Per iteration the new method requires two evaluations of the function, one of its first derivative and one of its second derivative. Thus the efficiency, in term of function evaluations, of the new method is better than that of Chebyshev’s method. Numerical examples verifying the theory are given.
Similar content being viewed by others
References
Traub, J.F.: Iterative Methods for the Solution of Equations. Prentice-Hall, Englewood Cliffs, NJ (1964)
Amat, S., Busquier, S., Gutiérrez, J.M.: Geometric constructions of iterative functions to solve nonlinear equations. J. Comput. Appl. Math. 157, 197–205 (2003)
Grau, M., Díaz-Barrero, J.L.: An improvement of the Euler-Chebyshev iterative method. J. Math. Anal. Appl. 315, 1–7 (2006)
Gautschi, W.: Numerical Analysis: An Introduction. Birkhäuser, Cambridge, MA (1997)
Weerakoon, S., Fernando, T.G.I.: A variant of Newton’s method with accelerated third-order convergence. Appl. Math. Lett. 13, 87–93 (2000)
Grau, M.: An improvement to the computing of nonlinear equation solutions. Numer. Algor. 34, 1–12 (2003)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Kou, J., Li, Y. A variant of Chebyshev’s method with sixth-order convergence. Numer Algor 43, 273–278 (2006). https://doi.org/10.1007/s11075-006-9058-y
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11075-006-9058-y