This method finds a root by drawing a secant line through the two most recent guess points (xn-1, xn) and finding its x-intercept. It requires two initial guesses.
Iteration (n) | xₙ |
---|
This method finds a root by drawing a tangent line at the current guess (xn) and finding its x-intercept. It is very fast but requires the function's derivative, f'(x).
Iteration (n) | xₙ | f(xₙ) | f'(xₙ) |
---|