»
Arabic Bulgarian Chinese Croatian Czech Danish Dutch English Estonian Finnish French German Greek Hebrew Hindi Hungarian Icelandic Indonesian Italian Japanese Korean Latvian Lithuanian Malagasy Norwegian Persian Polish Portuguese Romanian Russian Serbian Slovak Slovenian Spanish Swedish Thai Turkish Vietnamese
Arabic Bulgarian Chinese Croatian Czech Danish Dutch English Estonian Finnish French German Greek Hebrew Hindi Hungarian Icelandic Indonesian Italian Japanese Korean Latvian Lithuanian Malagasy Norwegian Persian Polish Portuguese Romanian Russian Serbian Slovak Slovenian Spanish Swedish Thai Turkish Vietnamese

# definition - secant method

definition of Wikipedia

# Secant method

In numerical analysis, 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. The secant method can be thought of as a finite difference approximation of Newton's method. However, the method was developed independently of Newton's method, and predated the latter by over 3,000 years. [1]

## The method

The first two iterations of the secant method. The red curve shows the function f and the blue lines are the secants.

The secant method is defined by the recurrence relation

$x_n=x_{n-1}-f(x_{n-1})\frac{x_{n-1}-x_{n-2}}{f(x_{n-1})-f(x_{n-2})}$

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.

## Derivation of the method

Starting with initial values $x_0$ and $x_1$, we construct a line through the points $(~x_0,~f(x_0)~)$ and $(~x_1,~f(x_1)~)$, as demonstrated in the picture on the right. In point-slope form, this line has the equation

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

We find the root of this line – the value of $x$ such that $y=0$ – by solving the following equation for $x$:

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

The solution is

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

We then use this new value of $x$ as $x_2$ and repeat the process using $x_1$ and $x_2$ instead of $x_0$ and $x_1$. We continue this process, solving for $x_3$, $x_4$, etc., until we reach a sufficiently high level of precision (a sufficiently small difference between $x_n$ and $x_{n-1}$).

$x_2 = x_1 - f(x_1)\frac{x_1-x_0}{f(x_1)-f(x_0)}$
$x_3 = x_2 - f(x_2)\frac{x_2-x_1}{f(x_2)-f(x_1)}$
...
$x_n = x_{n-1} - f(x_{n-1})\frac{x_{n-1}-x_{n-2}}{f(x_{n-1})-f(x_{n-2})}$

## Convergence

The iterates $x_n$ of the secant method converge to a root of $f$, if the initial values $x_0$ and $x_1$ are sufficiently close to the root. The order of convergence is α, where

$\alpha = \frac{1+\sqrt{5}}{2} \approx 1.618$

is the golden ratio. In particular, the convergence is superlinear, but not quite quadratic.

This result only holds under some technical conditions, namely that $f$ be twice continuously differentiable and the root in question be simple (i.e., with multiplicity 1).

If the initial values are not close enough to the root, then there is no guarantee that the secant method converges. There is no general definition of "close enough", but the criterion has to do with how "wiggly" the function is on the interval $[~x_0,~x_1~]$. For example, if $f$ is differentiable on that interval and there is a point where $f^\prime = 0$ on the interval, then the algorithm may not converge.

## Comparison with other root-finding methods

The secant method does not require that the root remain bracketed like the bisection method does, and hence it does not always converge. The false position method (or regula falsi) uses the same formula as the secant method. However, it does not apply the formula on $x_{n-1}$ and $x_n$, like the secant method, but on $x_n$ and on the last iterate $x_k$ such that $f(x_k)$ and $f(x_n)$ have a different sign. This means that the false position method always converges.

The recurrence formula of the secant method can be derived from the formula for Newton's method

$x_{n} = x_{n-1} - \frac{f(x_{n-1})}{f^\prime(x_{n-1})}$

by using the finite difference approximation

$f^\prime(x_{n-1}) \approx \frac{f(x_{n-1}) - f(x_{n-2})}{x_{n-1} - x_{n-2}}$.

If we compare Newton's method with the secant method, we see that Newton's method converges faster (order 2 against α ≈ 1.6). However, Newton's method requires the evaluation of both $f$ and its derivative $f^\prime$ at every step, while the secant method only requires the evaluation of $f$. Therefore, the secant method may occasionally be faster in practice. For instance, if we assume that evaluating $f$ takes as much time as evaluating its derivative and we neglect all other costs, we can do two steps of the secant method (decreasing the logarithm of the error by a factor α² ≈ 2.6) for the same cost as one step of Newton's method (decreasing the logarithm of the error by a factor 2), so the secant method is faster. If however we consider parallel processing for the evaluation of the derivative, Newton's method proves its worth, being faster in time, though still spending more steps.

## Generalizations

Broyden's method is a generalization of the secant method to more than one dimension.

The following graph shows the function f in red and the last secant line in bold blue. In the graph, the x-intercept of the secant line seems to be a good approximation of the root of f.

## A computational example

The Secant method is applied to find a root of the function f(x)=x2−612. Here is an implementation in the Matlab language.

# From calculation, we expect that the iteration converges at x=24.7386

f=@(x)x^2-612;
x(1)=10;
x(2)=30;
for i=3:7
x(i)=x(i-1)-f(x(i-1))*(x(i-1)-x(i-2))/(f(x(i-1))-f(x(i-2)));
end
root=x(7)


## Notes

1. ^ Papakonstantinou, J., The Historical Development of the Secant Method in 1-D, retrieved 2011-06-29

## References

sensagent's content

• definitions
• synonyms
• antonyms
• encyclopedia

Dictionary and translator for handheld

New : sensagent is now available on your handheld

sensagent's office

Shortkey or widget. Free.

Windows Shortkey: . Free.

Vista Widget : . Free.

Webmaster Solution

Alexandria

A windows (pop-into) of information (full-content of Sensagent) triggered by double-clicking any word on your webpage. Give contextual explanation and translation from your sites !

Try here  or   get the code

SensagentBox

With a SensagentBox, visitors to your site can access reliable information on over 5 million pages provided by Sensagent.com. Choose the design that fits your site.

WordGame

The English word games are:
○   Anagrams
○   Wildcard, crossword
○   Lettris
○   Boggle.

Lettris

Lettris is a curious tetris-clone game where all the bricks have the same square shape but different content. Each square carries a letter. To make squares disappear and save space for other squares you have to assemble English words (left, right, up, down) from the falling squares.

boggle

Boggle gives you 3 minutes to find as many words (3 letters or more) as you can in a grid of 16 letters. You can also try the grid of 16 letters. Letters must be adjacent and longer words score better. See if you can get into the grid Hall of Fame !

English dictionary
Main references

Most English definitions are provided by WordNet .
English thesaurus is mainly derived from The Integral Dictionary (TID).
English Encyclopedia is licensed by Wikipedia (GNU).

The wordgames anagrams, crossword, Lettris and Boggle are provided by Memodata.
The web service Alexandria is granted from Memodata for the Ebay search.
The SensagentBox are offered by sensAgent.

Translation

Change the target language to find translations.
Tips: browse the semantic fields (see From ideas to words) in two languages to learn more.

last searches on the dictionary :

4929 online visitors

computed in 0.047s

I would like to report:
section :
a spelling or a grammatical mistake
an offensive content(racist, pornographic, injurious, etc.)