The Aberth method, or Aberth–Ehrlich method, named after Oliver Aberth and Louis W. Ehrlich, is a root-finding algorithm developed in 1967 for simultaneous approximation of all the roots of a univariate polynomial.
There are no implementations available for this algorithm yet.
About the speed performance (complexity)?
How much readable is this code?
This code compiles?
AlgPedia - 2014
A project made by Computer Science students of UFRJ.