An effective implementation of a modified Laguerre method for the roots of a polynomial
- 34 Downloads
Two common strategies for computing all roots of a polynomial with Laguerre’s method are explicit deflation and Maehly’s procedure. The former is only a semi-stable process and is not suitable for solving large degree polynomial equations. In contrast, the latter implicitly deflates the polynomial using previously accepted roots and is, therefore, a more practical strategy for solving large degree polynomial equations. However, since the roots of a polynomial are computed sequentially, this method cannot take advantage of parallel systems. In this article, we present an implementation of a modified Laguerre method for the simultaneous approximation of all roots of a polynomial. We provide a derivation of this method along with a detailed analysis of our algorithm’s initial estimates, stopping criterion, and stability. Finally, the results of several numerical experiments are provided to verify our analysis and the effectiveness of our algorithm.
KeywordsLaguerre’s method Polynomial roots Mathematical software
Mathematics Subject Classification (2010)26C10 65H04 65Y20
Unable to display preview. Download preview PDF.
We are grateful to the NAG for providing a free trial that was used in the testing of our work. In addition, we are thankful for numerous private conversations with Dario Bini and David Watkins throughout our research and for the referees’ comments and suggestions that significantly improved this manuscript.
- 9.Chandrasekaran, S., Gu, M., Xia, J., Zhu, J.: A fast QR algorithm for companion matrices. In: Recent Advances in Matrix and Operator Theory, pp. 111–143. Basel, Birkhäuser (2008)Google Scholar
- 10.Chen, T.C.: Improving Laguerre’s method to cope with symmetry pitfalls in polynomial root-finding. In: Proceedings of the Eigth International Colloquium on Differential Equations, pp. 105–110. VSP, Utrecht (1998)Google Scholar
- 20.Kahan, W.: Laguerre’s method and a circle which contains at least one zero of a polynomial. SIAM J. Numer. Anal, 4(3) (1967)Google Scholar
- 22.Lancaster, P.: Lambda-Matrices and Vibrating Systems International Series of Monographs on Pure and Applied Mathematics, vol. 94. Pergamon, Oxford (1966)Google Scholar
- 26.Mekwi, W.: Iterative Methods for Roots of Polynomials. Master’s thesis, University of Oxford, Oxford (2001)Google Scholar
- 27.MPFUN: Multiprecision Software, http://www.netlib.org/mpfun. Accessed 18 June 2018 (2005)
- 28.NAG: Nag Library, Mark 26, https://www.nag.com/numeric/fl/nagdoc_latest/html/c02/c02aff.html. Accessed 27 May 2018 (2017)
- 34.Petković, M.S., Petković, L., živković, D.: Laguerre-like methods for the simultaneous approximation of polynomial zeros. In: Topics in Numerical Analysis, pp. 189–209. Springer, Vienna (2001)Google Scholar
- 38.Smith, B.T.: A Zero Finding Algorithm using Laguerre’s Method. Master’s thesis, University of Toronto, Toronto (1967)Google Scholar
- 40.Wilkinson, J.H.: Rounding Errors in Algebraic Processes. Prentice-Hall Inc (1963)Google Scholar