TY - JOUR
T1 - ON A COMPENSATED EHRLICH-ABERTH METHOD FOR THE ACCURATE COMPUTATION OF ALL POLYNOMIAL ROOTS
AU - Cameron, Thomas R.
AU - Graillat, Stef
N1 - Funding Information:
∗Received September 12, 2021. Accepted February 10, 2022. Published online on March 21, 2022. Recommended by Dario Bini. This work was partly supported by the NuSCAP (ANR-20-CE48-0014) project of the French National Agency for Research (ANR). †Department of Mathematics, Penn State Behrend, Erie, PA (trc5475@psu.edu). https://behrend.psu.edu/person/thomas-cameron-phd ‡Sorbonne UniversitÃl’, CNRS, LIP6, F-75005 Paris, France (stef.graillat@sorbonne-universite.fr). http://www-pequan.lip6.fr/~graillat
Publisher Copyright:
Copyright © 2022, Kent State University
PY - 2021
Y1 - 2021
N2 - In this article, we use the complex compensated Horner method to derive a compensated Ehrlich-Aberth method for the accurate computation of all roots, real or complex, of a polynomial. In particular, under suitable conditions, we prove that the limiting accuracy for the compensated Ehrlich-Aberth iterations is as accurate as if computed in twice the working precision and then rounded to the working precision. Moreover, we derive a running error bound for the complex compensated Horner method and use it to form robust stopping criteria for the compensated Ehrlich-Aberth iterations. Finally, extensive numerical experiments illustrate that the backward and forward errors of the root approximations computed via the compensated Ehrlich-Aberth method are similar to those obtained with a quadruple precision implementation of the Ehrlich-Aberth method with a significant speed-up in terms of computation time.
AB - In this article, we use the complex compensated Horner method to derive a compensated Ehrlich-Aberth method for the accurate computation of all roots, real or complex, of a polynomial. In particular, under suitable conditions, we prove that the limiting accuracy for the compensated Ehrlich-Aberth iterations is as accurate as if computed in twice the working precision and then rounded to the working precision. Moreover, we derive a running error bound for the complex compensated Horner method and use it to form robust stopping criteria for the compensated Ehrlich-Aberth iterations. Finally, extensive numerical experiments illustrate that the backward and forward errors of the root approximations computed via the compensated Ehrlich-Aberth method are similar to those obtained with a quadruple precision implementation of the Ehrlich-Aberth method with a significant speed-up in terms of computation time.
UR - http://www.scopus.com/inward/record.url?scp=85128870844&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85128870844&partnerID=8YFLogxK
U2 - 10.1553/ETNA_VOL55S401
DO - 10.1553/ETNA_VOL55S401
M3 - Article
AN - SCOPUS:85128870844
SN - 1068-9613
VL - 55
SP - 401
EP - 423
JO - Electronic Transactions on Numerical Analysis
JF - Electronic Transactions on Numerical Analysis
ER -