Skip to main content
SpringerLink
Log in

The Laguerre-and-sums-of-powers algorithm for the efficient and reliable approximation of all polynomial roots

  • Large Systems
  • Published:
Problems of Information Transmission Aims and scope Submit manuscript

Abstract

We prove the first sufficient convergence criterion for Laguerre’s root-finding algorithm, which by empirical evidence is highly efficient. The criterion is applicable to simple roots of polynomials with degree greater than 3. The “Sums of Powers Algorithm” (SPA), which is a reliable iterative root-finding method, can be used to fulfill the condition for each root. Therefore, Laguerre’s method together with the SPA is now an efficient and reliable algorithm (LaSPA). In computational mathematics these results solve a central task which was first attacked by L. Euler 266 years ago.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Möller, H., Convergence and Visualization of Laguerre’s Rootfinding Algorithm, arXiv:1501.02168 [math.NA], 2015.

    Google Scholar 

  2. Mekwi, W.R., Iterative Methods for Roots of Polynomials, Master Thesis, Univ. of Oxford, UK, 2001.

    Google Scholar 

  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.

    Google Scholar 

  4. Laguerre, E., OEuvres, vol. 1, Paris: Gauthier-Villars, 1898.

    Google Scholar 

  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].

    Article  Google Scholar 

  6. Möller, H., Algorithmische Lineare Algebra, Braunschweig/Wiesbaden: Vieweg, 1997. Available at http: //wwwmath.uni-muenster.de/u/mollerh/data/AlLiAlC.pdf.

    Book  Google Scholar 

  7. Möller, H., Report on the Visualization of Laguerre’s Method, 2014. Available at http://wwwmath. uni-muenster.de/u/mollerh/data/VisReport.pdf.

    Google Scholar 

  8. Möller, H., Visualization of the First Stage of the SPA, 2012. Available at http://wwwmath. uni-muenster.de/u/mollerh/data/SPAview.pdf.

    Google Scholar 

  9. Turán, P., On a New Method of Analysis and Its Applications, New York: Wiley, 1978.

    Google Scholar 

  10. Euler, L., Introductio in Analysin Infinitorum, Lausannae: M.-M. Bousquet, 1748. Translated under the title Introduction to Analysis of the Infinite, Book I, Berlin: Springer, 1988.

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Mathematical Institute, University of Münster, Münster, Germany

    H. Möller

Authors
  1. H. Möller
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to H. Möller.

Additional information

Original Russian Text © H. Möller, 2015, published in Problemy Peredachi Informatsii, 2015, Vol. 51, No. 4, pp. 60–70.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Möller, H. The Laguerre-and-sums-of-powers algorithm for the efficient and reliable approximation of all polynomial roots. Probl Inf Transm 51, 361–370 (2015). https://doi.org/10.1134/S0032946015040055

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S0032946015040055

Keywords

Search

Navigation