𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Fast computation of the Nth root

✍ Scribed by S.-G. Chen; P.Y. Hsieh

Publisher
Elsevier Science
Year
1989
Tongue
English
Weight
281 KB
Volume
17
Category
Article
ISSN
0898-1221

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Newton’s method and high-order algorithm
Newton’s method and high-order algorithms for the nth root computation
✍ FranΓ§ois Dubeau πŸ“‚ Article πŸ“… 2009 πŸ› Elsevier Science 🌐 English βš– 705 KB

Two modifications of Newton's method to accelerate the convergence of the nth root computation of a strictly positive real number are revisited. Both modifications lead to methods with prefixed order of convergence p ∈ N, p β‰₯ 2. We consider affine combinations of the two modified pth-order methods w

Calculus of nth roots and third order it
Calculus of nth roots and third order iterative methods
✍ J.M. GutiΓ©rrez; M.A. HernΓ‘ndez; M.A. Salanova πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 187 KB

We apply a family of iterative methods to the problem of extracting the \(n\)th root of a positive number \(R\), that is, to solve the nonlinear equation \(t^{n}-R=0\). For each value of \(n\) we obtain the method in the family for which the highest order of convergence is reached.