33 citations · 106 across the 19 of their papers we have counts for
Showing 2017 · cs.SCShow all
2 papers · 2 filters
cs.SC2017
Counting Solutions of a Polynomial System Locally and Exactly
Ruben Becker, Michael Sagraloff
We propose a symbolic-numeric algorithm to count the number of solutions of a polynomial system within a local region. More specifically, given a zero-dimensional system $f_1=\cdot…
cs.SC2017
Efficiently Computing Real Roots of Sparse Polynomials
Gorav Jindal, Michael Sagraloff
We propose an efficient algorithm to compute the real roots of a sparse polynomial having non-zero real-valued coefficients. It is assumed that arbitrarily…