Revision as of 20:11, 13 June 2014 edit 84.144.69.163 (talk) replaced "Root-finding algorithms" with "Nth-root algorithms". This article describes a method to find the Nth root of a number, while "root-finding algorithm" refers to the concept of finding the root of a function. ← Previous edit		Revision as of 00:42, 15 June 2014 edit undo Bearcat (talk \| contribs) Autopatrolled, Administrators 1,641,422 edits m no redlinked categories on articles; only categories that actually exist are permitted. using AWB Next edit →
Line 12: #Repeat step 2 until the desired precision is reached, i.e. <math> \| \Delta x_k \| < \epsilon</math> . A special case is the familiar [[~~Methods_of_computing_square_roots~~Methods of computing square roots#~~Babylonian_method~~Babylonian method\|square-root algorithm]]. By setting ''n'' = 2, the ''iteration rule'' in step 2 becomes the square root iteration rule: :<math>x_{k+1} = \frac{1}{2}\left(x_k + \frac{A}{x_k}\right)</math> Line 47: *{{Citation \|first=Kendall E. \|last=Atkinson \|title=An introduction to numerical analysis \|___location=New York \|publisher=Wiley \|year=1989 \|edition=2nd \|isbn=0-471-62489-6 }}. {{Uncategorized\|date=June 2014}} ~~[[Category:Nth-root algorithms]]~~

Nth root algorithm: Difference between revisions