8 citations · 16 across the 5 of their papers we have counts for
Showing cs.SCShow all
3 papers · 1 filter
cs.SC2014
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…
cs.SC2013★ 6 cited
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…
cs.SC2012★ 8 cited
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…