Complexity Analysis of Root Clustering for a Complex Polynomial

05/11/2021
by   Ruben Becker, et al.
0

Let F(z) be an arbitrary complex polynomial. We introduce the local root clustering problem, to compute a set of natural ε-clusters of roots of F(z) in some box region B_0 in the complex plane. This may be viewed as an extension of the classical root isolation problem. Our contribution is two-fold: we provide an efficient certified subdivision algorithm for this problem, and we provide a bit-complexity analysis based on the local geometry of the root clusters. Our computational model assumes that arbitrarily good approximations of the coefficients of F are provided by means of an oracle at the cost of reading the coefficients. Our algorithmic techniques come from a companion paper (Becker et al., 2018) and are based on the Pellet test, Graeffe and Newton iterations, and are independent of Schönhage's splitting circle method. Our algorithm is relatively simple and promises to be efficient in practice.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/21/2015

A Near-Optimal Subdivision Algorithm for Complex Root Isolation based on the Pellet Test and Newton Iteration

We describe a subdivision algorithm for isolating the complex roots of a...
research
06/11/2019

Polynomial root clustering and explicit deflation

We seek complex roots of a univariate polynomial P with real or complex ...
research
04/23/2017

Efficiently Computing Real Roots of Sparse Polynomials

We propose an efficient algorithm to compute the real roots of a sparse ...
research
06/27/2018

Implementation of a Near-Optimal Complex Root Clustering Algorithm

We describe Ccluster, a software for computing natural ϵ-clusters of com...
research
05/09/2021

The D-plus Discriminant and Complexity of Root Clustering

Let p(x) be an integer polynomial with m≥ 2 distinct roots ρ_1,…,ρ_m who...
research
06/07/2023

On Isolating Roots in a Multiple Field Extension

We address univariate root isolation when the polynomial's coefficients ...
research
12/05/2019

Complexity of a Root Clustering Algorithm

Approximating the roots of a holomorphic function in an input box is a f...

Please sign up or login with your details

Forgot password? Click here to reset