Nth root algorithm: Difference between revisions

Revision as of 16:19, 19 September 2012

Revision as of 20:30, 19 September 2012

Line 12:

#Repeat step 2 until the desired precision is reached.

A special case is the more familiar [[Methods_of_computing_square_roots#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>