1 citations · 2 across the 3 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.SC2020
Generalizing The Davenport-Mahler-Mignotte Bound -- The Weighted Case
Vikram Sharma
Root separation bounds play an important role as a complexity measure in understanding the behaviour of various algorithms in computational algebra, e.g., root isolation algorithms…