BISECTION METHOD

Given a function f x0, continuous on a closed interval a,b, such that f af b0, then, the
function f x0 has at least a root or zero in the interval a,b. The method calls for a repeated halving

of subintervals of a,bcontaining the root. The root always converges, though very slow in converging
NEWTON-RAPHSON METHOD
THE SECANT METHOD/ CHORD METHOD