Secant Method (L3)
Secant Method (L3)
The secant method is a root-finding procedure in numerical analysis that uses a series of
roots of secant lines to better approximate a root of a function f. Let us learn more about the
second method, its formula, advantages and limitations, and secant method solved example
with detailed explanations in this article.
q(x) = a0 + a1x
The secant method procedures are given below using equation (1).
Step 1: Initialization
Step 2: Iteration
In the case of n = 1, 2, 3, …,
until a specific criterion for termination has been met (i.e., The desired accuracy of the
answer or the maximum number of iterations has been attained).
Secant Method Convergence
If the initial values x0 and x1 are close enough to the root, the secant method iterates
xn and converges to a root of function f. The order of convergence is given by φ, where
φ=1+√5 /2≈1.618,
It converges quicker than a linear rate, making it more convergent than the
bisection method.
It does not necessitate the usage of the function’s derivative, which is not
available in a number of applications.
Unlike Newton’s technique, which requires two function evaluations in every
iteration, it only requires one.
Example:
Compute two iterations for the function f(x) = x3 – 5x + 1 = 0 using the secant method,
in which the real roots of the equation f(x) lies in the interval (0, 1).
Solution:
x0 = 0, x1 = 1, and
f(x0) = 1, f(x1) = -3
= 1 – [(0 – 1) / ((1-(-3))](-3)
= 0.25.
= 0.186441