Convergence of the sequence from Heron's method.

Click For Summary
The discussion focuses on proving the convergence of the sequence defined by Heron's method, specifically that it converges to the square root of b. It is established that the sequence is nonincreasing and bounded below by √b, which implies convergence. The transformation of the sequence into a new sequence δ_n, defined as δ_n = a_n - √b, simplifies the proof of convergence to zero. The conditions for the terms of the sequence to remain above √b and the nonincreasing nature of the sequence are confirmed. The conversation concludes with an acknowledgment of the sequence's rapid convergence rate, which is significant for numerical applications.
Coffee_
Messages
259
Reaction score
2
##a_1=1##

##a_{n+1}=\frac{1}{2} ( a_{n} + \frac{b}{a_n} )##

This should converge to ##\sqrt{b}## but I seem not to be able to prove this. Could someone give me a hint.
 
Physics news on Phys.org
First prove that a limit exists. Show this by proving (by induction) that the sequence (starting from ##a_2##) is nonincreasing and bounded below.
 
One can define a new sequence \delta_1,\delta_2,\delta_3,\ldots by setting \delta_n=a_n-\sqrt{b}, and then solve an equivalent recursion formula for \delta_{n+1}. Proving \delta_n\to 0 can turn out more natural than proving the original claim directly.
 
First we prove that any term that is given by the recursion formula is either larger or equal to ##\sqrt{b}##.

##\frac{1}{2}(a_n + \frac{b}{a_n}) \ge \sqrt{b}##
This can be rewritten as :

##(a_n-\sqrt{b})^{2} \ge 0 ##

Which is obviously always the case. To conclude, any term starting from ##a_2## is larger or equal to ##\sqrt{b}##

Next we will look at when the succeeding term is non increasing:

##a_{n+1}=\frac{1}{2}(a_n + \frac{b}{a_n}) \le a_n ## ?

## a_n + \frac{b}{a_n} \le 2 a_n ##

##b \le a_n^{2} ##

This means that as long as the previous term was above ##\sqrt{b}## the next one will be smaller. However I proved that from ##a_2## all the terms are above ##\sqrt{b}## which means that from ##a_2## on it is non decreasing and bounded from below by ##\sqrt{b}##.
 
That is correct. So now you've shown that ##(a_n)_n## is decreasing and bounded below, which means that it converges. Now we use a dirty trick to find the actual limit of ##(a_n)_n##. We have

\lim_{n\rightarrow +\infty} a_n = \lim_{n\rightarrow +\infty} a_{n+1} = \lim_{n\rightarrow +\infty} \frac{1}{2}\left(a_n + \frac{b}{a_n}\right)

I'll let you do the rest.
 
Last edited:
Wow that is indeed a dirty trick! However it clearly does follow from it, thanks a lot.
 
It seems my advice wasn't useful for the precise requested task, but I insist that it can be useful for other purposes. For example here the sequence converges towards \sqrt{b} at a rate that is faster than exponential, and that can be relevant for numerical purposes, but it wasn't yet proven by the used tricks.
 
Last edited:

Similar threads

  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 17 ·
Replies
17
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 9 ·
Replies
9
Views
2K
Replies
1
Views
2K
  • · Replies 13 ·
Replies
13
Views
2K
  • · Replies 6 ·
Replies
6
Views
2K
Replies
3
Views
2K
  • · Replies 16 ·
Replies
16
Views
4K
  • · Replies 15 ·
Replies
15
Views
2K