research
∙
02/13/2023
Fast evaluation and root finding for polynomials with floating-point coefficients
Evaluating or finding the roots of a polynomial f(z) = f_0 + ⋯ + f_d z^d...
share
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
∙
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
∙
11/15/2019
New practical advances in polynomial root clustering
We report an ongoing work on clustering algorithms for complex roots of ...
research
∙
06/11/2019
Polynomial root clustering and explicit deflation
We seek complex roots of a univariate polynomial P with real or complex ...
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
∙
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
∙
06/26/2018
Clustering Complex Zeros of Triangular System of Polynomials
This report is about finding clusters of complex solutions of triangular...
research
∙
06/26/2018
Local solution clustering for a triangular system of polynomials
This report is about finding clusters of complex solutions of triangular...
research
∙
03/25/2016