Sharp Bounds on Interval Polynomial Roots

An algorithm is developed for computing sharp bounds on the real roots of polynomials with interval coefficients. The procedure is introduced by studying interval quadratic equations.

[1]  Eldon R. Hansen,et al.  Sharpness in Interval Computations , 1997, Reliab. Comput..