Related papers: The Weierstrass root finder is not generally conve…
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…
Evaluating or finding the roots of a polynomial $f(z) = f_0 + \cdots + f_d z^d$ with floating-point number coefficients is a ubiquitous problem. By using a piecewise approximation of $f$ obtained with a careful use of the Newton polygon of…
We consider the sequence of polynomials $W_n(x)$ defined by the recursion $W_n(x)=(ax+b)W_{n-1}(x)+dW_{n-2}(x)$, with initial values $W_0(x)=1$ and $W_1(x)=t(x-r)$, where $a,b,d,t,r$ are real numbers, $a,t>0$, and $d<0$. We show that every…
In this paper, we study the root distribution of some univariate polynomials $W_n(z)$ satisfying a recurrence of order two with linear polynomial coefficients over positive numbers. We discover a sufficient and necessary condition for the…
We present a practical implementation based on Newton's method to find all roots of several families of complex polynomials of degrees exceeding one billion ($10^9$) so that the observed complexity to find all roots is between $O(d\ln d)$…
In large-scale applications, such as machine learning, it is desirable to design non-convex optimization algorithms with a high degree of parallelization. In this work, we study the adaptive complexity of finding a stationary point, which…
We study Hermitian non-commutative quadratic polynomials of multiple independent Wigner matrices. We prove that, with the exception of some specific reducible cases, the limiting spectral density of the polynomials always has a square root…
We describe a new incomplete but terminating method for real root finding for large multivariate polynomials. We take an abstract view of the polynomial as the set of exponent vectors associated with sign information on the coefficients.…
We propose an approach to constructing iterative methods for finding polynomial roots simultaneously. One feature of this approach is using the fundamental theorem of symmetric polynomials. Within this framework, we reconstruct many of the…
We introduce a new iterative root-finding method for complex polynomials, dubbed {\it Newton-Ellipsoid} method. It is inspired by the Ellipsoid method, a classical method in optimization, and a property of Newton's Method derived in…
We combine the known methods for univariate polynomial root-finding and for computations in the Frobenius matrix algebra with our novel techniques to advance numerical solution of a univariate polynomial equation, and in particular…
The real roots of the cubic and quartic polynomials are studied geometrically with the help of their respective Siebeck--Marden--Northshield equilateral triangle and regular tetrahedron. The Vi\`ete trigonometric formulae for the roots of…
We survey developments, over the last thirty years, in the theory of Shape Preserving Approximation (SPA) by algebraic polynomials on a finite interval. In this article, "shape" refers to (finitely many changes of) monotonicity, convexity,…
In this paper, we revisit the chaotic number of iterations needed by Newton's method to converge to a root. Here, we consider a simple modified Newton method depending on a parameter. It is demonstrated using polynomiography that even in…
New modifications of the methods for simultaneous extraction of all roots of polynomials over an arbitrary Chebyshev system are elaborated. A cubic convergence of iterations is proved. The method presented is a generalisation of the…
We study the dynamics of Stirling's iterative root-finding method $St_f(z)$ for rational and polynomial functions. It is seen that the Scaling theorem is not satisfied by Stirling's iterative root-finding method. We prove that for a…
When exploring the literature, it can be observed that the operator obtained when applying \textit{Newton-like} root finding algorithms to the quadratic polynomials $z^2-c$ has the same form regardless of which algorithm has been used. In…
Several conditions are known for a self-inversive polynomial that ascertain the location of its roots, and we present a framework for comparison of those conditions. We associate a parametric family of polynomials $p_\alpha$ to each such…
We extend the definition of an orbit portrait to the context of non-autonomous iteration, both for the combinatorial version involving collections of angles and for the dynamic version involving external rays where combinatorial portraits…
Finding roots of equations is at the heart of most computational science. A well-known and widely used iterative algorithm is the Newton's method. However, its convergence depends heavily on the initial guess, with poor choices often…