An iterative algorithm for approximating roots of integers

2021/01/08 by William Gerst, Gerst, William
Computer Science · Mathematics · #Numerical Methods and Algorithms #Mathematical and Theoretical Analysis #History and Theory of Mathematics

paper · pdf · doi:10.48550/arxiv.2101.02898

Abstract

We explore an algorithm for approximating roots of integers, discuss its motivation and derivation, and analyze its convergence rates with varying parameters and inputs. We also perform comparisons with established methods for approximating square roots and other rational powers.

Related

• A counting method for finding rational approximates to arbitrary order roots of integers
• Iterative polynomial-root-finding procedure with enhanced accuracy
• Symbolic computation of the roots of any polynomial with integer coefficients
• Generalising the Fast Reciprocal Square Root Algorithm
• An algorithm to approximate reals by rationals of the form a/b²