Tell me more ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

In Secant method - $$x_{n} = x_{n-1} - f(x_{n-1})\frac{x_{n-1}-x_{n-2}}{f(x_{n-1})-f(x_{n-2})}$$

I have to choose 2 initial - $x_0$ and $x_1$ .

How could I know whether those 2 $x$'s going to converge to the zero of $f(x)$ with no calculate the above iteration ?

share|improve this question
Do you know anything about f(x)? Do you know where the root of f is, or anything about its derivative? – in_wolfram_we_trust Apr 24 at 13:38
No , I talk about general case . – URL87 Apr 24 at 13:41
Then there is no way to know: f may not even have a root. – in_wolfram_we_trust Apr 24 at 13:42

1 Answer

up vote 2 down vote accepted

Wikipedia says:

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 is differentiable on that interval and there is a point where $f'=0$ on the interval, then the algorithm may not converge.

The relevant page is here.

If you want a method that is guaranteed to converge to a root, then you should look into bisection or regula falsi. They require initial values that "bracket" the root you're seeking, though.

For some fascinating (and unusual) discussions of root-finding, I recommend papers by Bill Kahan, especially this one.

share|improve this answer
If the $x_0$, $x_1$ straddle one root, and you modify the secant method so this is always true for $x_{n + 1}$ and $x_n$, it does converge. – vonbrand Apr 24 at 15:35
Thanks. I thought that might be the case, but couldn't find a reference, and didn't have the energy to attempt a proof. – bubba Apr 24 at 16:32

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.