DeepAI AI Chat
Log In Sign Up

Finding polynomial roots by dynamical systems – a case study

by   Sergey Shemyakov, et al.
Jacobs University Bremen

We investigate two well known dynamical systems that are designed to find roots of univariate polynomials by iteration: the methods known by Newton and by Ehrlich-Aberth. Both are known to have found all roots of high degree polynomials with good complexity. Our goal is to determine in which cases which of the two algorithms is more efficient. We come to the conclusion that Newton is faster when the polynomials are given by recursion so they can be evaluated in logarithmic time with respect to the degree, or when all the roots are all near the boundary of their convex hull. Conversely, Ehrlich-Aberth has the advantage when no fast evaluation of the polynomials is available, and when roots are in the interior of the convex hull of other roots.


Generalized Companion Subresultants of Several Univariate Polynomials in Newton Basis

In this paper, the concept of companion subresultant for polynomials in ...

The Weierstrass root finder is not generally convergent

Finding roots of univariate polynomials is one of the fundamental tasks ...

Sums of Separable and Quadratic Polynomials

We study separable plus quadratic (SPQ) polynomials, i.e., polynomials t...

Computing Approximate Common Factors of Matrix Polynomials

Computation of (approximate) polynomials common factors is an important ...

Complexity, combinatorial positivity, and Newton polytopes

The Nonvanishing Problem asks if a coefficient of a polynomial is nonzer...

Fast Computation of the Roots of Polynomials Over the Ring of Power Series

We give an algorithm for computing all roots of polynomials over a univa...

The Lagrangian remainder of Taylor's series, distinguishes O(f(x)) time complexities to polynomials or not

The purpose of this letter is to investigate the time complexity consequ...