most citedComplexity of a Root Clustering Algorithm

1 citations · 1 across the 2 of their papers we have counts for

collaborators
Showing math.NAShow all

1 paper · 1 filter

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…