Fast computation of the Nth root
A new class of iterative methods for computing a differentiable function is proposed, which is based on Padé approximation to Taylor's series of the function. It leads to a faster algorithm than Newton's method for \(x^{1/N}\) and a different interpretation of Newton's method. This algorithm uses 3rd degree approximation of continued fraction expansion to Taylor's series for \(x^{1/N}\), with adaptive expansion point for every iteration. Its major computational cost is \(O[(2 \log_ 2 N)(\log_ 4 M)]\) multiplications asymptotically, M is the number of precision bits desired, as opposed to existing bound of \(O[(2 \log_ 2 N)(\log_ 2 M)]\) for Newton's method.
- Best Rational Starting Approximations and Improved Newton Iteration for the Square Root
- scientific article; zbMATH DE number 4064339 (Why is no real title available?)
- scientific article; zbMATH DE number 3711249 (Why is no real title available?)
- scientific article; zbMATH DE number 3493262 (Why is no real title available?)
- Optimal starting approximations for Newton's method
- Approximating \(x^ n\) efficiently
- Fast calculation of inverse square root with the use of magic constant -- analytical approach
- Newton's method for the matrix nonsingular square root
- Integer roots for integer-power-content calculations
- An algorithm to compute integer th roots using subtractions
- Faster algorithms for the square root and reciprocal of power series
- scientific article; zbMATH DE number 1254286 (Why is no real title available?)
- High order algorithms for approximatingnth roots
- Remarks on Heron's cubic root iteration formula
- Newton-like algorithms for kth root calculation
This page was built for publication: Fast computation of the Nth root
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1263248)