Always-convergent hybrid methods for finding roots of nonlinear equations
Abstract
New hybrid iterative methods for solving nonlinear equations are introduced. These methods combine the well-known Newton and Chebyshev’s methods with the always convergent bisection method making them always convergent and faster than the combined methods themselves. Numerical experiments, comparing the new algorithms with others, are performed showing the efficiency of the new proposed methods.
Copyright © 2020 Karim Hitti, Samir Haddad, Jinane Sayah, Stephanie Feghali. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Cite this article
K. Hitti, S. Haddad, J. Sayah, S. Feghali, Always-convergent hybrid methods for finding roots of nonlinear equations, J. Math. Comput. Sci. 11 (2021), 165–172. https://doi.org/10.28919/jmcs/5090
BibTeX
@article{Hitti2021,
author = {Hitti, Karim and Haddad, Samir and Sayah, Jinane and Feghali, Stephanie},
title = {Always-convergent hybrid methods for finding roots of nonlinear equations},
journal = {J. Math. Comput. Sci.},
volume = {11},
year = {2021},
pages = {165--172},
doi = {10.28919/jmcs/5090}
}