Nth root algorithm: Difference between revisions

Revision as of 22:15, 29 August 2009

Revision as of 15:00, 19 November 2009

Line 7:

(for integer ''n'' there are ''n'' distinct [[complex number|complex]] solutions to this equation if <math>A > 0</math>, but only one is positive and real).

There is a very fast-[[convergenceLimit (mathematics)of a sequence|converging]] ''' ''n''th root algorithm''' for finding <math>\sqrt[n]{A}</math>:

#Make an initial guess <math>x_0</math>

#Set <math>x_{k+1} = \frac{1}{n} \left[{(n-1)x_k +\frac{A}{x_k^{n-1}}}\right]</math>