Abstract
In this paper we deal with the problem of locating all the zeros of a given polynomialp(x) and approximating them to any degree of precision: by combining classical iterative methods with homotopy path tracking techniques, we introduce a new algorithm for polynomial root finding, prove its convergence and estimate its computational cost.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Aberth, O.: Iteration methods for finding all zeros of a polynomial simultaneously. Math. Comput.27, 339–344 (1973).
Braess, D., Hadeler, K. P.: Simultaneous inclusion of the zeros of a polynomial. Numer. Math.21, 161–165 (1973).
Li, T. Y., Garcia, C.: On the number of solution to polynomial systems of equations. SIAM J. Numer. Anal.17, 540–545 (1980).
Carstensen, C., Petković, M. S., Trajcović, M.: Weierstrass formula and zero-finding methods. Numer. Math.69, 353–372 (1995).
Demmel, J. W.: On condition numbers and the distance to the nearest ill-posed problem. Numer. Math.51, 251–289 (1987).
Gao, Z., Wang, T.: On the complexity of a PL homotopy algorithm for zeros of polynomials. Acta Math. Appl. Sinica9, 135–142 (1993).
Guggenheimer, H.: Initial approximations in Durand-Kerner’s root finding method. BIT26, 537–539 (1986).
Henrici, P.: Applied and computational complex analysis. New York: J. Wiley 1974.
Haegemans, A., Verschelde, J., Beckers, M.: A new start system for solving deficient polynomial systems using continuation. Appl. Math. Comp.44, 225–239 (1991).
Li, T. Y.: Solving polynomial systems. Math. Intell.9, 37–39 (1987).
Petković, M. S., Stefanović, L. V.: On some iteration functions for the simultaneous computation of multiple complex polynomial zeros. BIT27, 111–122 (1987).
Rudin: Real and complex analysis. New York: McGraw-Hill 1974.
Shub, M., Smale, S.: Complexity of Bezout’s theorem I, geometric aspects. J. Am. Math. Soc.6, 459–501 (1993).
Yorke, J., Li, T. Y., Sauer, T.: Numerical solution of a class of deficient polynomial systems. SIAM J. Numer. Anal.24, 435–451 (1987).
Yorke, J., Li, T. Y., Sauer, T.: The random product homotopy and deficient polynomial systems. Numer. Math.51, 481–500 (1987).
Wang, X., Li, T. Y.: Solving deficient polynomial systems with homotopies which keep the subschemes at infinity invariant. Math. Comput.56, 693–710 (1991).
Tilli, P.: Convergence conditions for three classical methods for polynomial root finding. Calcolo, 1997 (to appear).
Wasserstrom, E.: Numerical solutions by the continuation method. SIAM Rev.15, 89–119 (1973).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Tilli, P. Polynomial root finding by means of continuation. Computing 59, 307–324 (1997). https://doi.org/10.1007/BF02684414
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02684414