First step to proof of convergance using Newton's root finding method

AI Thread Summary
The discussion focuses on using Newton's root-finding method to prove the convergence of the sequence generated by the method for the function f(x) = x^m - c, where c and m are greater than 1. The initial guess x_0 = c leads to subsequent estimates x_n that are shown to be strictly decreasing and bounded below by c^(1/m). The participants explore the necessity of proving that x^m > c to establish the convergence of the sequence. They also suggest using the mean value theorem as a potential proof method, highlighting the relationship between the function's behavior and its derivative. Overall, the conversation emphasizes the need for formal proof in the context of convergence in Newton's method.
trelek2
Messages
86
Reaction score
0
Suppose I am looking for the root of a function of the form:
f(x)=x ^{m}-c, where c,m>1.

Suppose I take my first guess to be x _{0}=c.

Then using Newtons method my next guess will be given by:
x _{n+1}=x _{n} - \frac {f(x _{n})}{f'(x _{n})}.

From this, or thinking about this graphically it is obvoius that
x _{0}>x _{1}>x _{n}>x _{n+1}>c^{1/m}.

However I don't know how should I go about formally proving this.
 
Mathematics news on Phys.org
To save writing, let x be current value and x* the next.

x*=x - (xm-c)/mxm-1={(m-1)xm+c}/mxm-1
< mxm/mxm-1=x, since c<xm.
 
Hmm, I knew this, but is this a proof?

Don't we need to prove that x^{m}&gt;c ?

I get the impression that if I want to prove that
<br /> x _{0}&gt;x _{1}&gt;x _{n}&gt;x _{n+1}<br />
I need to use x^{m}&gt;c

And it is easy to prove that x^{m}&gt;c but only if we are sure that:
<br /> x _{0}&gt;x _{1}&gt;x _{n}&gt;x _{n+1}<br />

I'm a physics student so I'm not used to proving things formally. Are you sure what you have written is enough?

I also thought of the following proof:
We know that:
<br /> x _{0}&gt;x _{1}&gt;x _{n}&gt;x _{n+1}<br />
Due to the fact that the function as well as its derivative are >0.
This is true only for x_{n}&gt;c^{1/m}
But we can show that using Newtons method the function x* (what you had written) has a minimum at x_{n}=c^{1/m} (I do this by taking (x*)' and equating it to 0).

Hence we know that x_{n}&gt;=c^{1/m} Therefore the argument stated in the beginning is definitely true: using this fact we know that x* is strictly decreasing and from this it follows that x*>c^{1/m}
 
Initially you have c > 1, so the initial guess (c) needs cm > c, which is certainly true for c > 1.
 
Hi trelek, you could also use the "mean value theorem" to prove it fairly easily. An outline would go something like this :

Let "a" be the root and "b" (with b>a) be the inital guess. By the mean value theorem there exists some k : a < k < b, such that

f(b) - f(a) = f'(k)(b-a).

Since f' is monotonic increasing it follows that

f(b) - f(a) < f'(b)(b-a)

and since f(a)=0 it follows that f(b) / f'(b) < (b-a)

so

b - f(b)/f'(b) > a
 
Last edited:
Suppose ,instead of the usual x,y coordinate system with an I basis vector along the x -axis and a corresponding j basis vector along the y-axis we instead have a different pair of basis vectors ,call them e and f along their respective axes. I have seen that this is an important subject in maths My question is what physical applications does such a model apply to? I am asking here because I have devoted quite a lot of time in the past to understanding convectors and the dual...
Insights auto threads is broken atm, so I'm manually creating these for new Insight articles. In Dirac’s Principles of Quantum Mechanics published in 1930 he introduced a “convenient notation” he referred to as a “delta function” which he treated as a continuum analog to the discrete Kronecker delta. The Kronecker delta is simply the indexed components of the identity operator in matrix algebra Source: https://www.physicsforums.com/insights/what-exactly-is-diracs-delta-function/ by...
Back
Top