Anonymous user
Talk:Nth root: Difference between revisions
→Comparison to Non-integer Exponentiation
m (→task expansion: corrected verb conjugation. -- ~~~~) |
|||
Line 1:
== More effient implementation by computing the diffence first ==
Most implementations use x(k+1) = (x(k)*(n-1) + A/x(k)^n) / n, d = x(k+1)-x(k) instead of d = (A/x(k)^n - x(k) / n, x(k+1) = x(k) + d; This leads to inefficient algorithm and should be corrected (see implementation for for AWK, C and Octave).
==Comparison to Non-integer Exponentiation==
Okay, I get that this task calls for implementing a particular algorithm (convergence by successive approximation). However, it seems like it would be appropriate to describe (in comments perhaps) whether the language supports a more direct method of computing an nth root (such as raising a number to a fractional power: x ** (1/n) for the nth root of x).
| |||