Tropical algebraic geometry in Maple: a preprocessing algorithm for finding common factors for multivariate polynomials with approximate coefficients
From MaRDI portal
Publication:540325
DOI10.1016/j.jsc.2010.08.011zbMath1225.14050arXiv0809.0298OpenAlexW2088216433MaRDI QIDQ540325
Publication date: 1 June 2011
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0809.0298
Newton polygonmultivariate polynomialPuiseux seriesamoebacommon factor\texttt{Maple}tropical algebraic geometrytropism
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Numerical factorization of multivariate complex polynomials
- An algorithm for lifting points in a tropical variety
- Rational algebraic curves. A computer algebra approach
- Deformation techniques for sparse systems
- Towards toric absolute factorization
- Puiseux expansion for space curves
- The number of roots of a system of equations
- Toric Newton method for polynomial homotopies
- Fractional power series solutions for systems of equations.
- Early termination in sparse interpolation algorithms
- Real algebraic curves, the moment map and amoebas
- A new algorithm for sparse interpolation of multivariate polynomials
- On the frontiers of polynomial computations in tropical geometry
- Computing tropical varieties
- An efficient sparse adaptation of the polytope method over \(\mathbb F_q\) and a record-high binary bivariate factorisation
- Approximate factorization of multivariate polynomials using singular value decomposition
- Towards factoring bivariate approximate polynomials
- Tropical Implicitization and Mixed Fiber Polytopes
- Polyhedral Methods in Numerical Algebraic Geometry
- Homotopies Exploiting Newton Polytopes for Solving Sparse Polynomial Systems
- Lectures on Polytopes
- Algorithm 795
- Computing multiple roots of inexact polynomials
- The approximate GCD of inexact polynomials
- Truncation of systems of polynomial equations, ideals and varieties
- A Polyhedral Method for Solving Sparse Polynomial Systems
- A polynomial-time complexity bound for the computation of the singular part of a Puiseux expansion of an algebraic function
- Good reduction of puiseux series and complexity of the Newton-Puiseux algorithm over finite fields
- A Rank-Revealing Method with Updating, Downdating, and Applications
- Computing Amoebas
- Algorithms – ESA 2005
- The Logarithmic Limit-Set of an Algebraic Variety
- Symbolic-numeric sparse interpolation of multivariate polynomials
- Decomposition of polytopes and polynomials
This page was built for publication: Tropical algebraic geometry in Maple: a preprocessing algorithm for finding common factors for multivariate polynomials with approximate coefficients
