Related papers: Adleman-Manders-Miller Root Extraction Method Revi…
The problem of root mean square approximation of a square integrable function by finite linear combinations of exponential functions is considered. It is subdivided into linear and nonlinear parts. The linear approximation problem is…
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…
This paper has been withdrawn by the authors. There was an erroneous estimate of the degree of a transformed polynomial, making the method appear more effective than it really is. We thank an anonymous referee for pointing out this error.
We present a new algorithm to solve polynomial equations, and publish its code, which is 1.6-3 times faster than the ZROOTS subroutine that is commercially available from Numerical Recipes, depending on application. The largest improvement,…
In the computation of Feynman integrals which evaluate to multiple polylogarithms one encounters quite often square roots. To express the Feynman integral in terms of multiple polylogarithms, one seeks a transformation of variables, which…
Univariate polynomial root-finding is a classical subject, still important for modern computing. Frequently one seeks just the real roots of a polynomial with real coefficients. They can be approximated at a low computational cost if the…
The notions of special and extraspecial pairs of roots were introduced by Carter for calculating structure constants, [Ca72]. Let $\{r, s\}$ be a special pair of roots for which the structure constant $N(r,s)$ is sought, and let $\{r_1,…
Our work began as an effort to understand calculations by Morris & Szekeres (1961) and Walker (1991) regarding fractional iteration.
The Mahler measure of a polynomial is a measure of complexity formed by taking the modulus of the leading coefficient times the modulus of the product of its roots outside the unit circle. The roots of a real degree $N$ polynomial chosen…
We show that, generically, finding the $k$-th root of a braid is very fast. More precisely, we provide an algorithm which, given a braid $x$ on $n$ strands and canonical length $l$, and an integer $k>1$, computes a $k$-th root of $x$, if it…
Some near-optimal polynomial root-finders of 2024-25, based on subdivision iterations, approximate all complex roots of a polynomial or all roots in a fixed Region of Interest in the complex plane. The iterations can be applied to a black…
In this paper, we study iterative methods on the coefficients of the rational univariate representation (RUR) of a given algebraic set, called global Newton iteration. We compare two natural approaches to define locally quadratically…
This paper analyzes the iteration-complexity of a generalized alternating direction method of multipliers (G-ADMM) for solving linearly constrained convex problems. This ADMM variant, which was first proposed by Bertsekas and Eckstein,…
In 2021, Marco Besier and the first author introduced the concept of rationalizability of square roots to simplify arguments of Feynman integrals. In this work, we generalize the definition of rationalizability to field extensions. We then…
We investigate the mathematics behind 1500 year old root extraction methods presented by Aryabhata in his famous mathematical treatise "Aryabhatiya". Also, we look at their computational complexity.
It is well known that the repeated square and multiply algorithm is an efficient way of modular exponentiation. The obvious question to ask is if this algorithm has an inverse which would calculate the discrete logarithm efficiently. The…
Univariate polynomial root-finding is a classical subject, still important for modern computing. Frequently one seeks just the real roots of a real coefficient polynomial. They can be approximated at a low computational cost if the…
We propose a novel algorithm for finding square roots modulo p. Although there exists a direct formula to calculate square root of an element modulo prime (3 mod 4), but calculating square root modulo prime (1 mod 4) is non trivial.…
Newton's method for polynomial root finding is one of mathematics' most well-known algorithms. The method also has its shortcomings: it is undefined at critical points, it could exhibit chaotic behavior and is only guaranteed to converge…
Root-finders based on full linear multistep methods (LMMs) use previous function values, derivatives and root estimates to iteratively find a root of a nonlinear function. As ODE solvers, full LMMs are typically not zero-stable. However,…