posted on 2012-03-15, 00:00authored byDanko Adrovic, Jan Verschelde
Finding a common factor of two multivariate polynomials with approximate coefficients is a problem in symbolic-numeric computing. Taking a tropical view of 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.
History
Publisher Statement
NOTICE: this is the author’s version of a work that was accepted for publication in the Journal of Symbolic Computation. Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. A definitive version was subsequently published in the Journal of Symbolic Computation, Vol 46, Issue 7, (July 2011) DOI: 10.1016/j.jsc.2010.08.011. The original publication is available at www.elsevier.com.