Fast evaluation and root finding for polynomials with floating-point coefficients
Fast evaluation and root finding for polynomials with floating-point coefficients
Evaluating or finding the roots of a polynomial f(z) = f0 + ⋅⋅⋅ + fdzd with floating-point number coefficients is a ubiquitous problem. By using a piecewise approximation of f obtained with a careful use of the Newton polygon of f, we improve state-of-the-art upper bounds on the number of …