Polynomial Root Finders

RootFinder:
Finds all zeros (roots) of a polynomial of any degree with either real or complex coefficients using Bairstow's, Newton's, Halley's, Graeffe's, Laguerre's, Jenkins-Traub, Aberth-Ehrlich, Durand-Kerner, Ostrowski or the Eigenvalue method. Furthermore, Newton's methods are represented using 4 different approaches: The Method by Madsen, The Method by Grant-Hitchins, the Ostrowski method, and probably the most famous the method by Jenkins-Traub (not really Newton, but the method starts out using a simple Newton iteration until it is closer to the root thereafter it shift to there famous "A Three-Stage Algorithm for Real Polynomials using Quadratic Iteration". All 4 Newton variants exist in both real coefficients and a complex coefficients version. Bairstow´s method can only handle real coefficients while Halley's, Graeffe's, Laguerre's, Aberth-Ehrlich, and Durand-Kerner´s works on complex coefficients. Newton's method has quadratic convergence meaning that the number of significant digits doubles for each iteration while Halley's and Laguerre's have a cubic convergence meaning the number of significant digits tripel for each iteration. Ostrowski is a 4^th-order convergence method.