An iterative algorithm for approximating roots of integers

01/08/2021
by   William Gerst, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/26/2019

Approximating the pth Root by Composite Rational Functions

A landmark result from rational approximation theory states that x^1/p o...
research
08/02/2023

Improved convergence rates of nonparametric penalized regression under misspecified total variation

Penalties that induce smoothness are common in nonparametric regression....
research
10/22/2020

Approximating the Minimal Lookahead Needed to Win Infinite Games

We present an exponential-time algorithm approximating the minimal looka...
research
03/06/2023

Near-Optimality Guarantees for Approximating Rational Matrix Functions by the Lanczos Method

We study the Lanczos method for approximating the action of a symmetric ...
research
09/07/2023

Generalized moving least squares vs. radial basis function finite difference methods for approximating surface derivatives

Approximating differential operators defined on two-dimensional surfaces...
research
01/14/2020

s-Step Orthomin and GMRES implemented on parallel computers

The Orthomin ( Omin ) and the Generalized Minimal Residual method ( GMRE...
research
08/27/2021

A Bisection Method Like Algorithm for Approximating Extrema of a Continuous Function

For a continuous function f defined on a closed and bounded domain, ther...

Please sign up or login with your details

Forgot password? Click here to reset