×

Towards more accurate separation bounds of empirical polynomials. II. (English) Zbl 1169.65308

Ganzha, Victor G. (ed.) et al., Computer algebra in scientific computing. 8th international workshop, CASC 2005, Kalamata, Greece, September 12–16, 2005. Proceedings. Berlin: Springer (ISBN 3-540-28966-6/pbk). Lecture Notes in Computer Science 3718, 318-329 (2005).
Summary: We study the problem of bounding a polynomial which is absolutely irreducible, away from polynomials which are not absolutely irreducible. These separation bounds are useful for testing whether an empirical polynomial is absolutely irreducible or not, for the given tolerance or error bound of its coefficients. In Part I [SIGSAM/CCA 38, 119–129 (2004)], we studied some improvements on Kaltofen and May’s method which finds applicable separation bounds using an absolute irreducibility criterion due to Ruppert. In this paper, we study the similar improvements on the method using the criterion due to Gao and Rodrigues for sparse polynomials satisfying Newton polytope conditions, by which we are able to find more accurate separation bounds, for such bivariate polynomials. We also discuss a concept of separation bound continuations for both dense and sparse polynomials.
For the entire collection see [Zbl 1089.68009].

MSC:

65D99 Numerical approximation and computational geometry (primarily algorithms)

Software:

SACLIB; QEPCAD
PDFBibTeX XMLCite
Full Text: DOI