Fast computation of the Nth root - ScienceDirect
1989-1-1 · Its major computational cost is O[(21ogZ N) (log, M)] multiplications asymptotically, M is the number of precision bits desired, as opposed to existing bound of O[(21092 N)(logZ M)] for Newton's method. A new periodic CFE for special case x'rz is obtained which is …
Get Price