Tropical algebraic geometry in Maple: a preprocessing algorithm for finding common factors for multivariate polynomials with approximate coefficients (Q540325): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
Property / review text | |||
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. | |||
Property / review text: 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. / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Carlos D'Andrea / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 14T05 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 14Q05 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 68W30 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 5903423 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
amoeba | |||
Property / zbMATH Keywords: amoeba / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
common factor | |||
Property / zbMATH Keywords: common factor / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
\texttt{Maple} | |||
Property / zbMATH Keywords: \texttt{Maple} / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
multivariate polynomial | |||
Property / zbMATH Keywords: multivariate polynomial / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
Newton polygon | |||
Property / zbMATH Keywords: Newton polygon / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
Puiseux series | |||
Property / zbMATH Keywords: Puiseux series / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
tropical algebraic geometry | |||
Property / zbMATH Keywords: tropical algebraic geometry / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
tropism | |||
Property / zbMATH Keywords: tropism / rank | |||
Normal rank |
Revision as of 11:03, 1 July 2023
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Tropical algebraic geometry in Maple: a preprocessing algorithm for finding common factors for multivariate polynomials with approximate coefficients |
scientific article |
Statements
Tropical algebraic geometry in Maple: a preprocessing algorithm for finding common factors for multivariate polynomials with approximate coefficients (English)
0 references
1 June 2011
0 references
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.
0 references
amoeba
0 references
common factor
0 references
\texttt{Maple}
0 references
multivariate polynomial
0 references
Newton polygon
0 references
Puiseux series
0 references
tropical algebraic geometry
0 references
tropism
0 references