Nth root algorithm: Difference between revisions

Revision as of 21:32, 18 March 2005

Revision as of 08:28, 19 March 2005

Line 44:

Note that this requires a computation of <math>x_n^{n-1}</math> on each step, which for large ''n'' should be done with an exponentiation algorithm rather than repeated multiplication.

[[Category:Root-finding algorithms]]