A geometric-numeric algorithm for absolute factorization of multivariate polynomials

In this paper, we propose a new semi-numerical algorithmic method for factoring multivariate polynomials absolutely. It is based on algebraic and geometric properties after reduction to the bivariate case in a generic system of coordinates. The method combines 4 tools: zero-sum relations at triplets of points, partial information on monodromy action, Newton interpolation on a structured grid, and a homotopy method. The algorithm relies on a probabilistic approach and uses numerical computations to propose a candidate factorization (with probability almost one) which is later validated.

[1]  Erich Kaltofen,et al.  Polynomial Factorization 1987-1991 , 1992, LATIN.

[2]  Dominique Duval,et al.  Absolute Factorization of Polynomials: A Geometric Approach , 1991, SIAM J. Comput..

[3]  R. J. Walker.  Algebraic curves , 1950 .

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

[5]  Stephen M. Watt,et al.  A numerical absolute primality test for bivariate polynomials , 1997, ISSAC.

[6]  Jean-François Ragot.  Sur la factorisation absolue des polynômes , 1997 .

[7]  André Galligo,et al.  Semi-numerical determination of irreducible branches of a reduced space curve , 2001, ISSAC '01.

[8]  Stephen M. Watt,et al.  Towards factoring bivariate approximate polynomials , 2001, ISSAC '01.

[9]  Jan Verschelde,et al.  Using Monodromy to Decompose Solution Sets of Polynomial Systems into Irreducible Components , 2001 .

[10]  Andrew J. Sommese,et al.  Numerical Decomposition of the Solution Sets of Polynomial Systems into Irreducible Components , 2000, SIAM J. Numer. Anal..

[11]  Joos Heintz,et al.  Absolute Primality of Polynomials is Decidable in Random Polynomial Time in the Number of Variables , 1981, ICALP.

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

[13]  Andrew J. Sommese,et al.  Symmetric Functions Applied to Decomposing Solution Sets of Polynomial Systems , 2002, SIAM J. Numer. Anal..

[14]  Joachim von zur Gathen,et al.  Modern Computer Algebra , 1998 .

[15]  Robert M. Corless,et al.  Initial value problems for ODEs in problem solving environments , 2000 .

[16]  S. Lang.  Introduction to Algebraic Geometry , 1972 .

[17]  A. Ostrowski.  Solution of equations and systems of equations , 1967 .

[18]  John F. Canny,et al.  Factoring rational polynomials over the complexes , 1989, ISSAC '89.

[19]  Tateaki Sasaki,et al.  Approximate factorization of multivariate polynomials and absolute irreducibility testing , 1991 .

[20]  Erich Kaltofen,et al.  Fast Parallel Absolute Irreducibility Testing , 1985, J. Symb. Comput..

[21]  Erich Kaltofen.  Effective Hilbert Irreducibility , 1985, Inf. Control..