The Aberth method, or Aberth–Ehrlich method, named after Oliver Aberth[1] and Louis W. Ehrlich,[2] is a root-finding algorithm developed in 1967 for simultaneous approximation of all the roots of a univariate polynomial.  [More Information]
There are no implementations available for this algorithm yet.