In numerical analysis, the secant method is a root-finding algorithm that uses a succession of roots of secant lines to better approximate a root of a function f. The secant method can be thought of as a finite difference approximation of Newton's method. However, the method was developed independently of Newton's method, and predated the latter by over 3,000 years.
Read more about Secant Method: The Method, Derivation of The Method, Convergence, Comparison With Other Root-finding Methods, Generalizations, A Computational Example
Famous quotes containing the word method:
“You know, I have a method all my own. If you’ll notice, the coat came first, then the tie, then the shirt. Now, according to Hoyle, after that the pants should be next. There’s where I’m different. I go for the shoes next. First the right, then the left. After that, it’s every man for himself.”
—Robert Riskin (1897–1955)