8 citations · 15 across the 4 of their papers we have counts for
5 papers
Computing all Affine Solution Sets of Binomial Systems
Danko Adrovic, Jan Verschelde
To compute solutions of sparse polynomial systems efficiently we have to exploit the structure of their Newton polytopes. While the application of polyhedral methods naturally excl…
A Polyhedral Method to Compute All Affine Solution Sets of Sparse Polynomial Systems
Danko Adrovic, Jan Verschelde
To compute solutions of sparse polynomial systems efficiently we have to exploit the structure of their Newton polytopes. While the application of polyhedral methods naturally excl…
Computing Puiseux Series for Algebraic Surfaces
Danko Adrovic, Jan Verschelde
In this paper we outline an algorithmic approach to compute Puiseux series expansions for algebraic surfaces. The series expansions originate at the intersection of the surface wit…
Polyhedral Methods for Space Curves Exploiting Symmetry Applied to the Cyclic n-roots Problem
Danko Adrovic, Jan Verschelde
We present a polyhedral algorithm to manipulate positive dimensional solution sets. Using facet normals to Newton polytopes as pretropisms, we focus on the first two terms of a Pui…
Tropical Algebraic Geometry in Maple, a preprocessing algorithm for finding common factors to multivariate polynomials with approximate coefficients
Danko 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 on this problem leads to ef…