5 citations · 6 across the 7 of their papers we have counts for
5 papers · 1 filter
Fast evaluation and root finding for polynomials with floating-point coefficients
Rémi Imbach, Guillaume Moroz
Evaluating or finding the roots of a polynomial with floating-point number coefficients is a ubiquitous problem. By using a piecewise approximation…
Accelerated Subdivision for Clustering Roots of Polynomials given by Evaluation Oracles
Rémi Imbach, Victor Y. Pan
In our quest for the design, the analysis and the implementation of a subdivision algorithm for finding the complex roots of univariate polynomials given by oracles for their evalu…
Root Radii and Subdivision for Polynomial Root-Finding
Rémi Imbach, Victor Y. Pan
We depart from our approximation of 2000 of all root radii of a polynomial, which has readily extended Sch{ö}nhage's efficient algorithm of 1982 for a single root radius. We revisi…
New practical advances in polynomial root clustering
Rémi Imbach, Victor Y. Pan
We report an ongoing work on clustering algorithms for complex roots of a univariate polynomial of degree with real or complex coefficients. As in their previous best subdi…
Polynomial root clustering and explicit deflation
Rémi Imbach, Victor Y. Pan
We seek complex roots of a univariate polynomial with real or complex coefficients. We address this problem based on recent algorithms that use subdivision and have a nearly op…