Newton's Method: Checking that ff'' >0 - Why and What if Not?

tysonk
Messages
33
Reaction score
0
When using Newton's method to find roots, why should we check that ff'' >0 . I can't find an adequate reason for this. Does Newton's method fail otherwise? If so why? Thanks.
 
Physics news on Phys.org
You should check out the discussion at http://en.wikipedia.org/wiki/Newton's_method#Analysis The method doesn't necessarily fail, but f f'' >0 is a condition that the sequence monotonically converges to the root. If you read on a bit further into the next section on that page, they explain that f'\neq 0, f'' finite are conditions for quadratic convergence. These latter conditions are much weaker than the f f'' >0 condition.
 
Oh so if that condition is not met, it converges linearly?
 
tysonk said:
Oh so if that condition is not met, it converges linearly?

No, there's no reason to conclude that. If you want to understand the f'\neq 0, f~ f''>0, you might want to consider a few sketches of the behavior of the function to the right of a root. You'll see how that condition leads to the sequence being monotone decreasing.

If the other set of conditions, f'\neq 0, f'' finite, is not met, it's possible that the sequence does not converge at all.
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...
Back
Top