Newton’s method requires the analytical derivative f′(xk) at every step. When the function is too complicated to differentiate, or when only function values (not derivatives) are available, the secant method provides a practical alternative. It replaces the exact derivative with a finite difference approximation constructed from the two most recent iterates.
Motivation
Recall from numerical differentiation that the backward difference formula approximates the derivative:
f′(xk)≈xk−xk−1f(xk)−f(xk−1)
Substituting this approximation directly into Newton’s formula:
Unlike Newton’s method, which requires only one starting point x0, the secant method requires two starting points x0 and x1 to compute the very first iterate x2.
Comparison with Newton’s Method
Property
Newton’s Method
Secant Method
Derivative required
Yes, f′(xk) at each step
No
Starting points needed
1 (just x0)
2 (x0 and x1)
Convergence rate
Super-linear (λ=0)
Super-linear (order ≈1.618)
Cost per iteration
1 function + 1 derivative evaluation
1 function evaluation (derivative is reused)
The secant method converges slightly slower than Newton’s method in theory, but avoids the need for any derivative, making it the preferred choice when differentiation is expensive or impossible.
Worked Example
Problem: Find the root of f(x)=x1−0.5 using the secant method with x0=0.25 and x1=0.5.
Using x1=0.5 and x2=0.6875, compute f(x2) and apply the formula again to find x3. Continuing this process, the iterates converge rapidly toward the root.
x∗=2.00000
The true root is confirmed analytically: x1=0.5⟹x=2. The secant method reaches this value in fewer iterations than fixed-point iteration, though it starts from a much broader initial bracket than Newton’s method would typically need.