Thursday, July 16 2020
14:00 - 15:00

IMSc Webinar

(Webinar) Root Separation Bounds

Vikram Sharma


(Webinar: to join, follow the link ) Root separation for a polynomial is the minimum distance between any pair of its distinct roots. This parameter naturally occurs in the analysis of many algebraic algorithms, e.g., algorithms that isolate the roots of a polynomial. A non-trivial lower bound on this parameter, therefore, plays a crucial role in the analysis of these algorithms. In this talk, we will see some classic and recent root separation bounds and the tools and techniques required in deriving them.

Download as iCalendar