On Wednesday, April 27, 2016 at 7:15:35 AM UTC-4, Mosè Giordano wrote: > > Dear all, > > I am happy to announce the first version of CmplxRoots.jl > <https://github.com/giordano/CmplxRoots.jl>, a fast root finder of real > and complex polynomials. > > This is a Julia implementation of the algorithm described in > > - J. Skowron & A. Gould, 2012, "General Complex Polynomial Root Solver > and Its Further Optimization for Binary Microlenses", arXiv:1203.1034 > <http://arxiv.org/abs/1203.1034> > > Out of curiosity, how does the performance and accuracy compare to the "roots" function in the Polynomials.jl package, which uses the standard companion-matrix approach?
(I find it a little bit worrying that the Skowron and Gould paper justify their method on account of it being "1.6 to 3 times" faster than the roots function in *Numerical Recipes* (NR), and that NR was the inspiration for their algorithm. NR routines typically have deeply suboptimal performance, and that book is terrible starting point for developing state-of-the-art algorithms because NR's approaches are typically antiquated.)
