New practical advances in polynomial root clustering

11/15/2019
by   Rémi Imbach, et al.
0

We report an ongoing work on clustering algorithms for complex roots of a univariate polynomial p of degree d with real or complex coefficients. As in their previous best subdivision algorithms our root-finders are robust even for multiple roots of a polynomial given by a black box for the approximation of its coefficients, and their complexity decreases at least proportionally to the number of roots in a region of interest (ROI) on the complex plane, such as a disc or a square, but we greatly strengthen the main ingredient of the previous algorithms. Namely our new counting test essentially amounts to the evaluation of a polynomial p and its derivative p', which is a major benefit, e.g., for sparse polynomials p. Moreover with evaluation at about log(d) points (versus the previous record of order d) we output correct number of roots in a disc whose contour has no roots of p nearby. Moreover we greatly soften the latter requirement versus the known subdivision algorithms. Our second and less significant contribution concerns subdivision algorithms for polynomials with real coefficients. Our tests demonstrate the power of the proposed algorithms.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/11/2019

Polynomial root clustering and explicit deflation

We seek complex roots of a univariate polynomial P with real or complex ...
research
12/31/2022

Fast Approximation of Polynomial Zeros and Matrix Eigenvalues

We approximate the d complex zeros of a univariate polynomial p(x) of a ...
research
06/26/2019

Counting Roots of a Polynomial in a Convex Compact Region by Means of Winding Number Calculation via Sampling

In this paper, we propose a novel efficient algorithm for calculating wi...
research
06/17/2022

Accelerated Subdivision for Clustering Roots of Polynomials given by Evaluation Oracles

In our quest for the design, the analysis and the implementation of a su...
research
06/26/2018

Clustering Complex Zeros of Triangular Systems of Polynomials

This paper gives the first algorithm for finding a set of natural ϵ-clus...
research
05/30/2022

New Progress in Classic Area: Polynomial Root-squaring and Root-finding

The DLG root-squaring iterations by Dandelin 1826, Lobachevsky 1834, and...
research
01/01/2023

Parametric "Non-nested" Discriminants for Multiplicities of Univariate Polynomials

We consider the problem of complex root classification, i.e., finding th...

Please sign up or login with your details

Forgot password? Click here to reset