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

05/30/2022
by   Victor Y. Pan, et al.
0

The DLG root-squaring iterations by Dandelin 1826, Lobachevsky 1834, and Graeffe 1837 have been the main approach to root-finding for a univariate polynomial p(x) in the 19th century and beyond, but not so nowadays because of severe numerical instability of these iterations. We circumvent this problem based on simple but novel links of the iterations at first to the evaluation of high order derivatives of the ratio p'(x)/p(x) at x=0 and then further to computing the power sums of the reciprocals of the roots of p(x). By expressing the power sums as Cauchy integrals over a sufficiently large circle on a complex plane, we devise fast and numerically stable algorithms for the DLG iterations and for their more recent extension to Fiedler-Gemignani's iterations. Our algorithms can be applied to a black box polynomial p(x) – given by a black box for its evaluation rather than by its coefficients, which enables important computational benefits, including efficient recursive as well as concurrent approximation of a selected set of the zeros of p(x) or even all of the zeros.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/30/2018

Old and New Nearly Optimal Polynomial Root-finders

Univariate polynomial root-finding has been studied for four millennia a...
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
02/22/2021

Root Radii and Subdivision for Polynomial Root-Finding

We depart from our approximation of 2000 of all root radii of a polynomi...
research
09/01/2023

A novel Newton-Raphson style root finding algorithm

Many problems in applied mathematics require root finding algorithms. Un...
research
11/15/2019

New practical advances in polynomial root clustering

We report an ongoing work on clustering algorithms for complex roots of ...
research
05/30/2018

New Efficient Hybrid Polynomial Root-finders

Univariate polynomial root-finding has been studied for four millennia a...
research
05/30/2018

Nearly Optimal Hybrid Polynomial Root-finders

Univariate polynomial root-finding has been studied for four millennia a...

Please sign up or login with your details

Forgot password? Click here to reset