Convergence of the sequence from Heron's method.

Click For Summary

Discussion Overview

The discussion revolves around the convergence of the sequence generated by Heron's method for approximating the square root of a number, specifically focusing on the sequence defined by the recursion formula. Participants explore the conditions under which the sequence converges to ##\sqrt{b}## and the methods to prove this convergence.

Discussion Character

  • Technical explanation
  • Mathematical reasoning
  • Exploratory

Main Points Raised

  • One participant presents the recursion formula for Heron's method and expresses difficulty in proving convergence to ##\sqrt{b}##.
  • Another participant suggests proving the existence of a limit by demonstrating that the sequence is nonincreasing and bounded below, using induction.
  • A different approach is proposed, defining a new sequence ##\delta_n = a_n - \sqrt{b}##, suggesting that proving ##\delta_n \to 0## may be more straightforward than proving the original claim directly.
  • One participant argues that all terms generated by the recursion are greater than or equal to ##\sqrt{b}##, providing a mathematical inequality to support this claim.
  • Further analysis is presented regarding the non-increasing nature of the sequence, contingent on the previous term being above ##\sqrt{b}##.
  • Another participant confirms the correctness of the previous arguments, stating that the sequence is decreasing and bounded below, thus converging.
  • One participant acknowledges the effectiveness of a method described as a "dirty trick" to find the limit of the sequence, although they do not provide a complete proof.
  • A later reply notes that while the advice may not have directly addressed the original request, it highlights the rapid convergence of the sequence, which could be relevant for numerical applications, though not yet proven.

Areas of Agreement / Disagreement

Participants generally agree on the convergence of the sequence and the methods to demonstrate it, but there are multiple approaches discussed, and the exact proofs and implications remain unresolved.

Contextual Notes

The discussion includes assumptions about the behavior of the sequence and relies on the definitions of convergence and boundedness, which may not be universally accepted without further proof.

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 [itex]\delta_1,\delta_2,\delta_3,\ldots[/itex] by setting [itex]\delta_n=a_n-\sqrt{b}[/itex], and then solve an equivalent recursion formula for [itex]\delta_{n+1}[/itex]. Proving [itex]\delta_n\to 0[/itex] 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

[tex]\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)[/tex]

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 [itex]\sqrt{b}[/itex] 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 15 ·
Replies
15
Views
4K
  • · Replies 16 ·
Replies
16
Views
4K