Secant method

The secant method is a root-finding algorithm that uses a succession of roots of secant lines to better approximate a root of a function f. A brief secant method description can be found below the calculator

This page exists due to the efforts of the following people:



Karen Luckhurst

Created: 2014-06-24 08:20:39, Last updated: 2021-09-30 12:31:31

PLANETCALC, Secant method

Secant method

Digits after the decimal point: 4
The file is very large. Browser slowdown may occur during loading and creation.

Secant method

The secant method can be thought of as a finite difference approximation of Newton's method, where a derivative is replaced by a secant line.

We use the root of a secant line (the value of x such that y=0) as a root approximation for function f.

Suppose we have starting values x0 and x1, with function values f(x0) and f(x1).
The secant line has the equation

\frac{y - f(x_1)}{f(x_1)-f(x_0)}=\frac{x - x_1}{x_1-x_0}

Hence, the root of secant line (where у=0) is

x = x_1 - \frac{x_1 - x_0}{f(x_1)-f(x_0)}f(x_1)

This is a recurrence relation for the secant method. A graphical interpretation can be seen below.



The secant method does not require that the root remains bracketed like the bisection method does (see below), and hence it does not always converge.



As can be seen from the recurrence relation, the secant method requires two initial values, x0 and x1, which should ideally be chosen to lie close to the root.

The tolerance condition can be either:

f(x_k)< \epsilon — function value is less than ε.

\left|x_k-x_{k-1}\right| < \epsilon — the difference between two subsequent хk is less than ε.

More: Secant method

URL copied to clipboard
PLANETCALC, Secant method