Secant Method for Root Finding

🔍 About the Secant Method

The secant method is an iterative root-finding algorithm that uses a succession of roots of secant lines to approximate a root of a function. It's faster than the bisection method but doesn't require the derivative like Newton's method.

c = (a × f(b) - b × f(a)) / (f(b) - f(a))

Advantages: Faster convergence than bisection method, doesn't require derivative calculation.

Requirements: Two initial guesses (a and b) near the root.

Function f(x):

Initial Guess (a):

Initial Guess (b):

Tolerance (E):

Supported Functions: Use x^2 for x², sin(x), cos(x), tan(x), ln(x), log(x), sqrt(x), exp(x), abs(x)
Examples: x^3 - x - 1, sin(x) - x/2, x^2 - 4, ln(x) - 1
Note: Choose a and b close to the expected root for better convergence.

📈 Secant Method

🔍 About the Secant Method

Secant Method Results