Secant Method Root Finding Calculator

What is the Secant Method?

The secant method is a root-finding algorithm that uses a succession of roots of secant lines to better approximate the root of a function. It's particularly useful when the derivative of the function is difficult or expensive to compute.

Key characteristics of the secant method include:

• Uses two initial guesses to start the iteration
• Converges superlinearly (faster than linear convergence)
• Doesn't require the derivative of the function
• Can be less stable than Newton-Raphson for some functions

How to Use the Secant Method

To use the secant method effectively:

1. Choose an initial interval [x0, x1] that contains the root
2. Compute the function values at these points (f(x0) and f(x1))
3. Iteratively apply the secant formula to get better approximations
4. Continue until the difference between successive approximations is smaller than your tolerance

Common pitfalls to avoid:

• Choosing initial points too close together
• Not checking if the function changes sign between x0 and x1
• Using too small a tolerance without considering computational limits

Formula

Where:

• x_n is the current approximation
• x_n-1 is the previous approximation
• f(x) is the function for which we're finding roots

Worked Example

Let's find the root of f(x) = x³ - 2x² - 5 using the secant method with initial guesses x0 = 2 and x1 = 3.

1. Compute f(2) = 8 - 8 - 5 = -5
2. Compute f(3) = 27 - 18 - 5 = 4
3. First iteration: x2 = 3 - 4*(3-2)/(4-(-5)) = 3 - 4/9 ≈ 2.5556
4. Compute f(2.5556) ≈ 16.73 - 13.01 - 5 ≈ -1.28
5. Second iteration: x3 = 2.5556 - (-1.28)*(2.5556-3)/(-1.28-4) ≈ 2.5556 + 0.4444 ≈ 3.0000

After two iterations, we've found the root x ≈ 3.0000.