1. Möller, H., Convergence and Visualization of Laguerre’s Rootfinding Algorithm, arXiv:1501.02168 [math.NA], 2015.
2. Mekwi, W.R., Iterative Methods for Roots of Polynomials, Master Thesis, Univ. of Oxford, UK, 2001.
3. Press, W.H., Teukolsky, S.A., Vetterling, W.T., and Flannery, B.P., Numerical Recipes: The Art of Scientific Computing, New York: Cambridge Univ. Press, 2007, 3rd ed.
4. Laguerre, E., OEuvres, vol. 1, Paris: Gauthier-Villars, 1898.
5. Möller, H., An Efficient Reliable Algorithm for the Approximation of All Polynomial Roots Based on the Method of D. Bernoulli, Sovr. Probl. Matem., 2012, vol. 16, pp. 52–65 [Proc. Steklov Inst. Math. (Suppl. Issues) (Engl. Transl.), 2013, vol. 280, suppl. 2, pp. S43–S55].