Optimization strategies for the approximate GCD problem
ISSAC '98 Proceedings of the 1998 international symposium on Symbolic and algebraic computation
Fundamental problems of algorithmic algebra
Fundamental problems of algorithmic algebra
A priori estimates for the zeros of interval polynomials
Journal of Computational and Applied Mathematics
On the computation of solutions of systems of interval polynomial equations
Journal of Computational and Applied Mathematics
Zeros of univariate interval polynomials
Journal of Computational and Applied Mathematics
QR factoring to compute the GCD of univariate approximate polynomials
IEEE Transactions on Signal Processing
| Hi-index | 7.29 |
In this paper, we develop a rigorous algorithm for counting the real interval zeros of polynomials with perturbed coefficients that lie within a given interval, without computing the roots of any polynomials. The result generalizes Sturm's Theorem for counting the roots of univariate polynomials to univariate interval polynomials.