2011
DOI: 10.1016/j.jsc.2010.08.011
|View full text |Cite
|
Sign up to set email alerts
|

Tropical algebraic geometry in Maple: A preprocessing algorithm for finding common factors for multivariate polynomials with approximate coefficients

Abstract: Finding a common factor of two multivariate polynomials with approximate coefficients is a problem in symbolic-numeric computing. Taking a tropical view on this problem leads to efficient preprocessing techniques, applying polyhedral methods on the exact exponents with numerical techniques on the approximate coefficients. With Maple we will illustrate our use of tropical algebraic geometry.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
9
0

Year Published

2012
2012
2019
2019

Publication Types

Select...
2
2
1

Relationship

3
2

Authors

Journals

citations
Cited by 10 publications
(9 citation statements)
references
References 55 publications
0
9
0
Order By: Relevance
“…In [1,Proposition 5.3], it is stated that, given f i (X 1 , X 2 ) = p i (X 2 ) + P i (X 1 , X 2 ) for i = 1, 2, where p i have nonzero constant term and all terms in P i have a positive power in X 1 , and…”
Section: And Thementioning
confidence: 99%
See 1 more Smart Citation
“…In [1,Proposition 5.3], it is stated that, given f i (X 1 , X 2 ) = p i (X 2 ) + P i (X 1 , X 2 ) for i = 1, 2, where p i have nonzero constant term and all terms in P i have a positive power in X 1 , and…”
Section: And Thementioning
confidence: 99%
“…For a system of two polynomials in two variables, in [1,Proposition 5.3] it is stated that, under certain hypotheses, if the second term in the Puiseux series expansion at a common root ξ can be computed, then there exists a curve of solutions for the original system; however, the result does not hold for arbitrary bivariate polynomial systems. In [2] the authors extend this result to the case of n variables and apply it successfully to produce exact representations for solution sets of the cyclic n-roots problem.…”
Section: Introductionmentioning
confidence: 99%
“…Once we have those roots, we can further grow the Puiseux series expansion symbolically, or apply numerical predictor-corrector methods to sample points along the solution curve. In Figure 4 (slightly adapted from [1]) we sketch the idea for computing this certificate.…”
Section: Tropisms and Initial Formsmentioning
confidence: 99%
“…Our Contributions. This paper is a thorough revision of the unpublished preprint [2], originating in the dissertation of the first author [1], which extended [3] from the plane to space curves. In [4] we gave a tropical version of Backelin's Lemma in case n = m 2 , in this paper we generalize to the case n = ℓm 2 .…”
Section: Introductionmentioning
confidence: 99%