From an approximate to an exact absolute polynomial factorization

We propose an algorithm for computing an exact absolute factorization of a bivariate polynomial from an approximate one. This algorithm is based on some properties of the algebraic integers over Z and is certified. It relies on a study of the perturbations in a Vandermonde system. We provide a sufficient condition on the precision of the approximate factors, depending only on the height and the degree of the polynomial.

[1]  David Rupprecht,et al.  Semi-numerical absolute factorization of polynomials with integer coefficients , 2004, J. Symb. Comput..

[2]  A. Galligo.  Real Factorization of Multivariate Polynomials with Integer Coefficients , 2002 .

[3]  W. J. Thron,et al.  Encyclopedia of Mathematics and its Applications. , 1982 .

[4]  P. Ribenboim.  Classical Theory Of Algebraic Numbers , 2001 .

[5]  Henri Cohen,et al.  A course in computational algebraic number theory , 1993, Graduate texts in mathematics.

[6]  Andrew J. Sommese,et al.  Numerical factorization of multivariate complex polynomials , 2004, Theor. Comput. Sci..

[7]  D. Eisenbud.  Commutative Algebra: with a View Toward Algebraic Geometry , 1995 .

[8]  Tateaki Sasaki,et al.  Approximate multivariate polynomial factorization based on zero-sum relations , 2001, ISSAC '01.

[9]  G. Chèze.  Des méthodes symboliques-numériques et exactes pour la factorisation absolue des polynômes en deux variables , 2004 .

[10]  Fabrice Rouillier,et al.  Solving Zero-Dimensional Systems Through the Rational Univariate Representation , 1999, Applicable Algebra in Engineering, Communication and Computing.

[11]  Erich Kaltofen,et al.  Approximate factorization of multivariate polynomials via differential equations , 2004, ISSAC '04.

[12]  Bernard Mourrain,et al.  Symbolic-numeric methods for solving polynomial equations and applications , 2005 .

[13]  P. Samuel.  Théorie algébrique des nombres , 1971 .

[14]  A. Schinzel.  Polynomials with Special Regard to Reducibility: Preface , 2000 .

[15]  David Rupprecht.  Elements de geometrie algebrique approchee : etude du pgcd et de la factorisation , 2000 .

[16]  Jacob T. Schwartz,et al.  Fast Probabilistic Algorithms for Verification of Polynomial Identities , 1980, J. ACM.

[17]  Stephen M. Watt,et al.  A geometric-numeric algorithm for absolute factorization of multivariate polynomials , 2002, ISSAC '02.

[18]  K. Brown,et al.  Graduate Texts in Mathematics , 1982 .

[19]  Erich Kaltofen,et al.  On approximate irreducibility of polynomials in several variables , 2003, ISSAC '03.

[20]  André Galligo,et al.  Irreducible Decomposition of Curves , 2002, J. Symb. Comput..

[21]  Guillaume Chèze,et al.  Absolute polynomial factorization in two variables and the knapsack problem , 2004, ISSAC '04.

[22]  Stephen M. Watt,et al.  A geometric-numeric algorithm for factoring multivariate polynomials , 2002, International Symposium on Symbolic and Algebraic Computation.

[23]  Richard Zippel,et al.  Effective polynomial computation , 1993, The Kluwer international series in engineering and computer science.

[24]  A. Galligo,et al.  Four lectures on polynomial absolute factorization , 2005 .