| Abstract: | In this paper, an algorithm for finding the roots of non-linear equations is developed by introducing a weight in the formula of the Bisection Method (BM). Initially, we use a fixed weight to solve an equation in the least possible number of iterations. In a second stage, we develop a method termed as the Adaptive Weighted Bisection Method (AWBM) in order to update the weight at each iteration. The adaptation is achieved by minimizing the function values of the iterates with respect to the weight. Our numerical experiments show that, the AWBM, based on minimizing a function value with respect to the weight, achieves quadratic convergence. However, the method differs from the classic second order Newton-Raphson by guaranteeing convergence through bracketing. |
