Hi, folks. I don't have much experience with Maple. At the moment I am trying to get an idea how the underlying algorithms for polynomial root-finders compare. For example, I believe MATLAB creates the companion matrix for a polynomial to then solve for its roots (eigenvalues). NAG routines use the method of Laguerre. NETLIB routines use the Jenkins-Traub Algorithm. What is the underlying algorithm used by Maple to compute the roots of polynomials?