An effective implementation of a modified Laguerre method for the roots of a polynomial

Research output: Contribution to journalArticlepeer-review

Abstract

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.

Original languageEnglish (US)
Pages (from-to)1065-1084
Number of pages20
JournalNumerical Algorithms
Volume82
Issue number3
DOIs
StatePublished - Nov 1 2019

All Science Journal Classification (ASJC) codes

  • Applied Mathematics

Fingerprint Dive into the research topics of 'An effective implementation of a modified Laguerre method for the roots of a polynomial'. Together they form a unique fingerprint.

Cite this