Content deleted Content added
No edit summary |
No edit summary |
||
Line 19:
For large ''n'', the ''n''<sup>th</sup> root algorithm is somewhat less efficient since it requires the computation of <math>x_k^{n-1}</math> at each step, but can be efficiently implemented with a good [[exponentiation]] algorithm.
== Derivation from Newton's method
[[Newton's method]] is a method for finding a zero of a function ''f(x)''. The general iteration scheme is:
| |||