Content deleted Content added
m Bot: Migrating 3 interwiki links, now provided by Wikidata on d:q2835826 |
No edit summary |
||
Line 10:
#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>. In practise we do <math>\Delta x_k = \frac{1}{n} \left[{\frac{A}{x_k^{n-1}}} - x_k\right]; x_{k+1} = x_{k} + \Delta x_k </math>.
#Repeat step 2 until the desired precision is reached, i.e. <math>
A special case is the 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:
| |||