6 citations · 7 across the 3 of their papers we have counts for
3 papers
math.NA2024
Bounds for the maximum modulus of polynomial roots with nearly optimal worst-case overestimation
Prashant Batra
Many upper bounds for the moduli of polynomial roots have been proposed but reportedly assessed on selected examples or restricted classes only. Regarding quality measured in terms…
cs.DS2019★ 1 cited
Complexity of a Root Clustering Algorithm
Prashant Batra, Vikram Sharma
Approximating the roots of a holomorphic function in an input box is a fundamental problem in many domains. Most algorithms in the literature for solving this problem are condition…
math.NA2015★ 6 cited
Near Optimal Subdivision Algorithms for Real Root Isolation
Vikram Sharma, Prashant Batra
We describe a subroutine that improves the running time of any subdivision algorithm for real root isolation. The subroutine first detects clusters of roots using a result of Ostro…