Secant Method Algorithm

The secant method is a root-finding algorithm that uses a succession of secant lines to approximate a root of a function. It can be regarded as a finite-difference approximation of Newton's method, and so is considered a quasi-Newton method, though historically it evolved from the much older method of false position, which predates Newton's method by more than three thousand years.