Computing clustered close-roots of univariate polynomials

ABSTRACT

Given a univariate polynomial having well-separated clusters of close roots, we give a method of computing close roots in a cluster simultaneously, without computing other roots. We first determine the position and the size of the cluster, as well as the number of close roots contained. Then, we move the origin to a near center of the cluster and perform the scale transformation so that the cluster is enlarged to be of size O(1). These operations transform the polynomial to a very characteristic one. We modify Durand-Kerner's method so as to compute only the close roots in the cluster. The method is very efficient because we can discard most terms of the transformed polynomial. We also give a formula of quite tight error bound. We show high efficiency of our method by empirical experiments.

References

1. D. Bini and V. Y. Pan. Polynomial and Matrix Computations. Vol. 1. Progress in Theoretical Computer Science. Birkhäuser Boston Inc., Boston, MA, 1994.
2. E. Durand. Solutions Numériques des Équations Algébriques, Tome I. Masson, Paris, 1960.
3. S. Fortune. An iterated eigenvalue algorithm for approximating roots of univariate polynomials. In Proc. Intern'l Symp. on Symbolic and Algebraic Computation, pages 121--128, ACM, 2001; also J. Symb. Comput., 33(5):627--646, 2002.
4. Y. Hida, X. S. Li and D. H. Bailey. Algorithms for quad-double precision floating point arithmetic. In Proc. 15th IEEE Symp. on Computer Arithmetic (ARITH'01), pages 155--162, 2001. Software can be obtained from http://www.cs.berkeley.edu/~yozo/
5. V. Hribernig and H. J. Stetter. Detection and validation of clusters of polynomial zeros. J. Symbolic Comput., 24(6):667--681, 1997.
6. I. O. Kerner. Ein Gesamtschrittverfahren zur Berechnung der Nullstellen von Polynomen. Numer. Math., 8:290--294, 1966.
7. M. Mignotte. Mathematics for Computer Algebra, Springer-Verlag, 1991.
8. V. Y. Pan. Optimal (up to polylog factors) sequential and parallel algorithms for approximating complex polynomial zeros. In Proc. 27th Annual ACM Symp. on Theory of Computing (STOC 95), pages 741--750, ACM Press, 1995.
9. V. Y. Pan. Optimal and nearly optimal algorithms for approximating polynomial zeros. Comp. Math. Appl., 31(12):97--138,1996.
10. V. Y. Pan. Univariate polynomials: Nearly optimal algorithms for factorization and rootfinding. In G. Villard, editor, Proc. Intern'l Symp. on Symbolic and Algebraic Computation, pages 253--267, ACM, 2001.
11. T. Sasaki. Formula manipulation system GAL. In Y. Watase and F. Abe, editors, Computing in High Energy Physics '91, Tsukuba 1991, pages 383--389. Universal Academy Press, Tokyo, 1991.
12. T. Sasaki and F. Kako. An algebraic method for separating close-root clusters and the minimum root separation. In D. Wang and L. Zhi, editors, Proc. Intern'l Workshop on Symbolic-Numeric Computation, pages 126--143, Xi'en, China, 2005; also, Symbolic-Numeric Computation, Trends in Mathematics, pages 149--166. Birkhäuser, Basel, 2007.
13. B. T. Smith. Error bounds for zeros of a polynomial based upon Gerschgorin's theorem. J. ACM, 17(4):661--674, 1970.
14. T. Sasaki and M.-T. Noda. Approximate square-free decomposition and root-finding of ill-conditioned algebraic equations. J. Inform. Process., 12(2):159--168, 1989.
15. T. Sakurai, H. Sugiura and T. Torii. Numerical factorization of a polynomial by rational Hermite interpolation. Numer. Algorithms, 3(1-4):411--418, 1992.
16. T. Sasaki and A. Terui. A formula for separating small roots of a polynomial. ACM SIGSAM Bulletin, 36(3):19--29, 2002.
17. A. Terui and T. Sasaki. "Approximate zero-points" of real univariate polynomial with large error terms. IPSJ J., 41(4):974--989, 2000.
18. A. Terui and T. Sasaki. Durand-Kerner method for the real roots. Japan J. Indus. Appl. Math., 19(1):19--38, 2002.
19. J. H. Wilkinson. The evaluation of the zeros of ill-conditioned polynomials, Part I. Numerishe Mathematik, 1:150--166, 1959.

Index Terms

• Mathematics of computing

  • Mathematical analysis

    • Nonlinear equations