4 citations · 5 across the 4 of their papers we have counts for
Showing cs.SCShow all
2 papers · 1 filter
cs.SC2021
Complexity Analysis of Root Clustering for a Complex Polynomial
Ruben Becker, Michael Sagraloff, Vikram Sharma +2
Let be an arbitrary complex polynomial. We introduce the local root clustering problem, to compute a set of natural -clusters of roots of in some box reg…
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…