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.