next up previous
Next: About this document ...

``Approximate Zero-points'' of Univariate Polynomial with Small Error Terms

Akira Terui $^{\dagger}$ and Tateaki Sasaki $^{\ddagger}$
$^{\dagger}$Doctoral Program in Mathematics
$^{\ddagger}$Institute of Mathematics
University of Tsukuba
Tsukuba-shi, Ibaraki 305-8571, Japan


Let P(x) be a given univariate polynomial and $\tilde{P}(x)=P(x)+{\mit\Delta}_P(x)$, where ${\mit\Delta}_P(x)$ is a sum of error terms, i.e., a polynomial with small unknown but bounded coefficients. We first consider specifying small domains in which the zero-points of $\tilde{P}(x)$ exist, by the (approximate) zero-points of P(x) and the coefficient bounds of ${\mit\Delta}_P(x)$. The existential domains are determined fairly small by applying Smith's theorem which specify the error bounds of the approximations for the zero-points. This leads us to a concept of ``approximate zero-points'' of an approximate polynomial. We next consider counting the number of approximate real zero-points of $\tilde{P}(x)$, by investigating the Sturm sequence. For polynomials with small error terms, calculating the Sturm sequence imposes us two problems: 1) some leading term may become very small, and 2) it is not easy to count the approximately multiple zero-points because the termination criterion is unclear. For the first problem, we apply the subresultant theory to the sequence and show that very small leading terms may be discarded. For the second problem, we propose a method of counting the number of approximately multiple zero-points by using approximate square-free decomposition and calculating existential domains of the zero-points of the approximate polynomial as the above.

next up previous
Next: About this document ...
IMACS ACA'98 Electronic Proceedings