On Approximate GCDs of Univariate Polynomials

In this paper, we consider computations involving polynomials with inexact coefficients, i.e. with bounded coefficient errors. The presence of input errors changes the nature of questions traditionally asked in computer algebra. For instance, given two polynomials, instead of trying to compute their greatest common divisor, one might now try to compute a pair of polynomials with a non-trivial common divisor close to the input polynomials. We consider the problem of finding approximate common divisors in the context of inexactly specified polynomials. We develop efficient algorithms for the so-called nearest common divisor problem and several of its variants.

[1]  D. Hough.  Explaining and ameliorating the ill condition of zeros of polynomials. , 1977 .

[2]  George E. Collins,et al.  The Calculation of Multivariate Polynomial Resultants , 1971, JACM.

[3]  Hans J. Stetter,et al.  Detection and Validation of Clusters of Polynomial Zeros , 1997, J. Symb. Comput..

[4]  Stephen M. Watt,et al.  The singular value decomposition for polynomial systems , 1995, ISSAC '95.

[5]  Joseph F. Traub,et al.  On Euclid's Algorithm and the Theory of Subresultants , 1971, JACM.

[6]  Dinesh Manocha,et al.  Algorithms for intersecting parametric and algebraic curves I: simple intersections , 1994, TOGS.

[7]  J. Renegar,et al.  On the Computational Complexity and Geometry of the First-Order Theory of the Reals, Part I , 1989 .

[8]  James Renegar,et al.  On the Computational Complexity and Geometry of the First-Order Theory of the Reals, Part III: Quantifier Elimination , 1992, J. Symb. Comput..

[9]  Arnold Schönhage,et al.  Quasi-GCD computations , 1985, J. Complex..

[10]  George E. Collins,et al.  Subresultants and Reduced Polynomial Remainder Sequences , 1967, JACM.

[11]  V. Pan.  Numerical Computation of a Polynomial GCD and Extensions , 1996 .

[12]  Scott McCallum,et al.  A Polynomial-Time Algorithm for the Topological Type of a Real Algebraic Curve , 1984, J. Symb. Comput..

[13]  André Galligo,et al.  Numerical Univariate Polynomial GCD , 1996 .

[14]  Narendra Karmarkar,et al.  Approximate polynomial greatest common divisors and nearest singular polynomials , 1996, ISSAC '96.

[15]  Dima Grigoriev,et al.  Solving Systems of Polynomial Inequalities in Subexponential Time , 1988, J. Symb. Comput..

[16]  Matu-Tarow Noda,et al.  Approximate GCD and its application to ill-conditioned algebraic equations , 1991 .

[17]  Scott McCallum,et al.  A polynomial-time algorithm for the topological type of a real algebraic curve , 1984 .

[18]  Jeremy R. Johnson,et al.  Polynomial real root isolation using approximate arithmetic , 1997, ISSAC.

[19]  James Renegar.  On the computational complexity and geome-try of the first-order theory of the reals , 1992 .

[20]  I. Emiris,et al.  Certified approximate univariate GCDs , 1997 .