Numerical computation of polynomial zeros by means of Aberth's method
 Dario Andrea Bini
 … show all 1 hide
Rent the article at a discount
Rent now* Final gross prices may vary according to local VAT.
Get AccessAbstract
An 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.
 Aberth, O. (1973) Iteration methods for finding all zeros of a polynomial simultaneously. Math. Comp. 27: pp. 339344
 Adams, D. A. (1967) A stopping criterion for polynomial root finding. Comm. ACM 10: pp. 655658
 Alefeld, G., Herzberger, J. (1974) On the convergence speed of some algorithms for the simultaneous approximation of polynomial roots. SIAM J. Numer. Anal. 11: pp. 237243
 BenOr, M., Tiwari, P. (1990) Simple algorithms for approximating all roots of a polynomial with real roots. J. Complexity 6: pp. 417442
 D. Bini and G. Fiorentino, A multiprecision implementation of a polyalgorithm for univariate polynomial zeros, in:Proc. of the POSSO Workshop on Software, eds. J. C. Faugère, J. Marchand and R. Rioboo (Paris, 1995).
 BörschSupan, W. (1963) Aposteriori error bounds for the zeros of polynomials. Numer. Math. 5: pp. 380398
 Braess, D., Hadeler, K. P. (1973) Simultaneous inclusion of the zeros of a polynomial. Numer. Math. 21: pp. 161165
 Carstensen, C. (1991) Inclusion of the roots of a polynomial based on Gerschgorin's theorem. Numer. Math. 59: pp. 349360
 Cosnard, M., Fraigniaud, P. (1990) Asynchronous DurandKerner and Aberth polynomial root finding methods on a distributed memory multicomputer. Parallel Computing 89: pp. 7984
 Dunaway, D. K. (1974) Calculation of zeros of a real polynomial through factorization using Euclid's algorithm. SIAM J. Numer. Anal. 11: pp. 10871104
 Durand, E. (1960) Solutions Numériques des Équations Algébriques, Tome 1: Equations du Type F(X)=0;Racines d'un Polynôme. Masson, Paris
 Ehrlich, L. W. (1967) A modified Newton method for polynomials. Comm. ACM 10: pp. 107108
 Elsener, L. (1973) A remark on simultaneous inclusions of the zeros of a polynomial by Gerschgorin's theorem. Numer. Math. 21: pp. 425427
 P. Fraigniaud, Analytic and asynchronous root finding methods on a distributed memory multicomputer, Research Report LIPIMAG (1989).
 Fraigniaud, P. (1991) The DurandKerner's polynomials rootfinding method in case of multiple roots. BIT 31: pp. 112123
 Gargantini, I., Henrici, P. (1972) Circular arithmetic and the determination of polynomial zeros. Numer. Math. 18: pp. 305320
 Gautschi, W. Questions of numerical condition related to polynomials. In: Boor, C., Golub, G. H. eds. (1978) Recent Advances in Numerical Analysis. Academic Press, New York, pp. 4572
 Green, M. W., Korsak, A. J., Pease, M. C. (1976) Simultaneous iteration towards all roots of a complex polynomial. SIAM Rev. 18: pp. 501502
 Guggenheimer, H. (1986) Initial approximations in DurandKerner's root finding method. BIT 26: pp. 537539
 Gutknecht, M. (1972) Aposteriori error bounds for the zeros of a polynomial. Numer. Math. 20: pp. 139148
 Hansen, E., Patrick, M., Rusnak, J. (1977) Some modifications of Laguerre's method. BIT 17: pp. 409417
 P. Henrici,Applied and Computational Complex Analysis, Vol. 1 (Wiley, 1974).
 Householder, A. S. (1971) Generalization of an algorithm of Sebastião e Silva. Numer. Math. 16: pp. 375382
 Householder, A. S. (1970) The Numerical Treatment of a Single Nonlinear Equation. McGrawHill, Boston
 Igarashi, M. (1984) A termination criterion for iterative methods used to find the zeros of polynomials. Math. Comp. 42: pp. 165171
 Jenkins, M. A., Traub, J. F. (1970) A three stage variable shift iteration for polynomial zeros and its relation to generalized Rayleigh iteration. Numer. Math. 14: pp. 252263
 Kerner, I. O. (1966) Ein Gesamtschrittverfahren zur Berechnung der Nullstellen von Polynomen. Numer. Math. 8: pp. 290294
 Kjurkchev, N., Mahdi, K. (1994) Some remarks on Dvorcuk's rootfinding method. BIT 34: pp. 318322
 Lehmer, D. H. (1961) A machine method for solving polynomial equations. J. ACM 8: pp. 151162
 Madsen, K., Reid, K. (1975) Fortran subroutines for finding polynomial zeros. Report HL 75/1172(C13). Computer Science and Systems Divisions, A.E.R.E. Harwell, Oxford
 McNamee, J. M. (1993) A bibliography on roots of polynomials. J. Comput. Appl. Math. 47: pp. 391394
 McNamee, J. M. (1988) A comparison of methods for terminating polynomial iterations. J. Comput. Appl. Math. 21: pp. 239244
 Moiser, R. G. (1986) Root neighborhoods of a polynomial. Math. Comp. 47: pp. 265273
 C. A. Neff, Specified precision polynomial root isolation is in NC, in:Proc. 31st Annual IEEE Symp. on Foundation of Computer Science (IEEE Computer Science Press, 1990) pp. 152–162.
 Ostrowski, A. (1941) On a theorem by J. L. Walsh concerning the moduli of roots of algebraic equations. Bull. Amer. Math. Soc 47: pp. 742746
 V. Pan, On approximating complex polynomial zeros: modified quadtree (Weyl's) construction and improved Newton's iteration, in:5th Annual ACMSIAM Symposium on Discrete Algorithms, Arlington, VA (1994).
 Pan, V. (1987) Sequential and parallel complexity of approximate evaluation of polynomial zeros. Comput. Math. Appl. 14: pp. 591622
 Pasquini, L., Trigiante, D. (1985) A globally convergent method for simultaneously finding polynomial roots. Math. Comp. 44: pp. 135149
 A. Schönhage, The fundamental theorem of algebra in terms of computational complexity, Technical Report, Mathematisches Institut der Universität Tübingen (1982).
 Sidorov, Yu. V., Fedoryuk, M. V., Shabunin, M. I. (1985) Lectures on the Theory of Functions of a Complex Variable. Mir, Moscow
 Smale, S. (1981) The fundamental theorem of algebra and complexity theory. Bull. Amer. Math. Soc. 4: pp. 136
 Smith, B. T. (1970) Error bounds for the zeros of a polynomial based upon Gerschgorin's theorem. J. ACM 17: pp. 661674
 Stewart, G. W. (1970) On the convergence of Sebastião e Silva's method for finding a zero of a polynomial. Math. Comp. 12: pp. 458460
 Werner, W. (1982) On the simultaneous determination of polynomial roots. Lecture Notes in Mathematics 953. Springer, Berlin, pp. 188202
 Wilkinson, J. H. (1971) Practical problems arising in the solution of polynomial equations. J. Inst. Math. Appl. 8: pp. 1635
 Title
 Numerical computation of polynomial zeros by means of Aberth's method
 Journal

Numerical Algorithms
Volume 13, Issue 2 , pp 179200
 Cover Date
 19960201
 DOI
 10.1007/BF02207694
 Print ISSN
 10171398
 Online ISSN
 15729265
 Publisher
 Kluwer Academic Publishers
 Additional Links
 Topics
 Keywords

 polynomial zeros
 Aberth's method
 numerical test
 starting approximations
 65H05
 65Y20
 Industry Sectors
 Authors

 Dario Andrea Bini ^{(1)}
 Author Affiliations

 1. Dipartimento di Matematica, Università di Pisa, via Buonarroti 2, I56127, Pisa, Italy