Mathematics - Numerical Methods - Root finding algorithms - Root Finding Methods

10 steps: (1) PROBLEM: find x where f(x)=0. Many equations can't be solved algebraically! (2) BISECTION METHOD: if f(a)<0 and f(b)>0, a root exists between a and b (IVT). (3) Midpoint c=(a+b)/2. If f(c)<0, root in [c,b]. If f(c)>0, root in [a,c]. (4) Repeat. Each step halves the interval. After n st