na10
Numerical computation of polynomial zeros by means of Aberth’s method. n algorithm for computing polynomial zeros, based on Aberth’s method, is presented. The starting approximations are chosen by means of a suitable application of Rouché’s theorem. More precisely, an integerq ≥ 1 and a set of annuliA i,i=1,...,q, in the complex plane, are determined together with the numberk i of zeros of the polynomial contained in each annulusA i. As starting approximations we choosek i complex numbers lying on a suitable circle contained in the annulusA i, fori=1,...,q. The computation of Newton’s correction is performed in such a way that overflow situations are removed. A suitable stop condition, based on a rigorous backward rounding error analysis, guarantees that the computed approximations are the exact zeros of a “nearby” polynomial. This implies the backward stability of our algorithm. We provide a Fortran 77 implementation of the algorithm which is robust against overflow and allows us to deal with polynomials of any degree, not necessarily monic, whose zeros and coefficients are representable as floating point numbers. In all the tests performed with more than 1000 polynomials having degrees from 10 up to 25,600 and randomly generated coefficients, the Fortran 77 implementation of our algorithm computed approximations to all the zeros within the relative precision allowed by the classical conditioning theorems with 11.1 average iterations. In the worst case the number of iterations needed has been at most 17. Comparisons with available public domain software and with the algorithm PA16AD of Harwell are performed and show the effectiveness of our approach. A multiprecision implementation in MATHEMATICA ™ is presented together with the results of the numerical tests performed.
Keywords for this software
References in zbMATH (referenced in 48 articles , 1 standard article )
Showing results 1 to 20 of 48.
Sorted by year (- Khomovsky, Dmitry I.: On using symmetric polynomials for constructing root finding methods (2020)
- Petković, I.; Herceg, Đ.: Computer methodologies for comparison of computational efficiency of simultaneous methods for finding polynomial zeros (2020)
- Proinov, Petko D.; Petkova, Milena D.: Local and semilocal convergence of a family of multi-point Weierstrass-type root-finding methods (2020)
- Shemyakov, Sergey; Chernov, Roman; Rumiantsau, Dzmitry; Schleicher, Dierk; Schmitt, Simon; Shemyakov, Anton: Finding polynomial roots by dynamical systems -- a case study (2020)
- Cameron, Thomas R.: An effective implementation of a modified Laguerre method for the roots of a polynomial (2019)
- Akian, Marianne; Gaubert, Stéphane; Sharify, Meisam: Log-majorization of the moduli of the eigenvalues of a matrix polynomial by tropical roots (2017)
- De Terán, Fernando; Dopico, Froilán M.; Pérez, Javier: Eigenvalue condition numbers and pseudospectra of Fiedler matrices (2017)
- Pan, Victor Y.; Tsigaridas, Elias: Accelerated approximation of the complex roots and factors of a univariate polynomial (2017)
- Pan, Victor Y.; Zhao, Liang: Real polynomial root-finding by means of matrix and polynomial iterations (2017)
- Nakatsukasa, Yuji; Noferini, Vanni: On the stability of computing polynomial roots via confederate linearizations (2016)
- Proinov, Petko D.: On the local convergence of Ehrlich method for numerical computation of polynomial zeros (2016)
- Maity, Arunava; Gupta, U. C.: A comparative numerical study of the spectral theory approach of Nishimura and the roots method based on the analysis of (\mathrmBDMMAP/\mathrmG/1) queue (2015)
- Bini, Dario A.; Robol, Leonardo: Solving secular and polynomial equations: a multiprecision algorithm (2014)
- De Terán, Fernando; Dopico, Froilán M.; Pérez, Javier: New bounds for roots of polynomials based on Fiedler companion matrices (2014)
- Melman, A.: Implementation of Pellet’s theorem (2014)
- Bini, Dario A.; Noferini, Vanni: Solving polynomial eigenvalue problems by means of the Ehrlich-Aberth method (2013)
- Bini, Dario A.; Noferini, Vanni; Sharify, Meisam: Locating the eigenvalues of matrix polynomials (2013)
- Melman, A.: Generalization and variations of Pellet’s theorem for matrix polynomials (2013)
- McNamee, J. M.; Pan, Victor Y.: Efficient polynomial root-refiners: a survey and new record efficiency estimates (2012)
- Strobach, Peter: A fitting algorithm for real coefficient polynomial rooting (2012)