Tropical algebraic geometry in Maple: a preprocessing algorithm for finding common factors for multivariate polynomials with approximate coefficients (Q540325): Difference between revisions

The authors take advantage of the language and the tools of tropical geometry in order to design an algorithm for computing common factors of multivariate polynomials, which is well suited to the situation where the coefficients of the input polynomials are given approximately. The preprocessing method developed in the paper consists in building a Puiseux expansion starting at a common root at infinity. After this is done, it is shown then that the problem of deciding whether there is a common factor is reduced to univariate root finding, with the univariate polynomials supported on edges of the Newton polygons of the given equations. The complexity of the algorithm is analyzed, and its implementation in \texttt{Maple} is discussed. Some examples illustrate very well the theory developed along the paper.