Numerical approximation of the root-finding problem its important tool for  process involves finding a root, or solution of nonlinear equation of the form , for a given function f. A root of this equation is also called a zero of the function When we implementing the method on a computer we need to consider the effects of round-off error. For example the computation of the midpoint of the interval should be found from the equation . The Bisection method is used to determine to any specified accuracy that your computer will permit a solution to  on an interval , provided that f  is continuous on the interval and that  are of opposite sign. Although the method will work for the case when more than one root is contained in the interval , we assume for simplicity of our discussion that the root in this interval is unique.  the method stops if one of the midpoints happens to coincide with the root. It also stops when the length of the search interval is less than some prescribed tolerance.  The having method is characterized by the fact that it always includes convergence of the individual islands. It is also characterized by the case of calculating errors, but one of its disadvantages is that it is slow to converge to reach the solution. To compare with the a new technical method of the solution . We followed applied numerical method using a new technical method in computer and we found that the new technical method of solution is much faster and more accurate.