We depart from our approximation of 2000 all root radii a polynomial, which has readily extended Schönhage’s efficient algorithm 1982 for single radius. revisit this extension, advance it, based on simple but novel idea, and yield significant practical acceleration the known near optimal subdivision algorithms complex real root-finding user’s choice. achieve by means saving exclusion tests Tayl...
