Nth root algorithm: Difference between revisions

Revision as of 02:58, 27 October 2006

Revision as of 14:48, 8 February 2007

Line 11:

#Repeat step 2 until the desired precision is reached.

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