Revision as of 23:22, 7 March 2011 edit Pulu (talk \| contribs) 383 edits Babylonian method convergence ← Previous edit		Revision as of 23:23, 7 March 2011 edit undo SineBot (talk \| contribs) Bots 2,564,775 edits m Signing comment by Pulu - "Babylonian method convergence" Next edit →
Line 134: Convergence: The Babylonian method only converges for <math>S \ge 0</math>. For <math>S < 0</math> the series is [[Chaos theory\|chaotic]], never converges, and is highly sensitive to both <math>S</math> and <math>x_0</math>. If you guess <math>x_0<0</math>, the series will converge to the negative root <math>-\sqrt{S}</math> [http://personal.bgsu.edu/~carother/babylon/Examples.html]. <small><span class="autosigned">— Preceding [[Wikipedia:Signatures\|unsigned]] comment added by [[User:Pulu\|Pulu]] ([[User talk:Pulu\|talk]] • [[Special:Contributions/Pulu\|contribs]]) 23:22, 7 March 2011 (UTC)</span></small><!-- Template:Unsigned --> <!--Autosigned by SineBot--> == Pell's equation ==

Talk:Square root algorithms: Difference between revisions