Abstract
We give a practical version of the exclusion algorithm for localizing the zeros of an analytic function and in particular of a polynomial in a compact of ℂ. We extend the real exclusion algorithm to a Jordan curve and give a method which excludes discs without any zero. The result of this algorithm is a set of discs arbitrarily small which contains the zeros of the analytic function.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
T.M. Apostol,Mathematical Analysis (Addison-Wesley, 1957).
R. Coleman, Algoritme de Weyl pour le calcul simultané des racines d'un polynôme, rapport de recherche, LMCIMAG, Université Joseph Fourier, Grenoble (1991).
H.M. Edwards,Rieman's Zeta Function (Academic Press, New York and London, 1974).
J. P. Dedieu and J.C. Yakoubsohn, Localization of an algebraic hypersurface by the exclusion algorithm, AAECC 2 (1992) 239–256.
J.P. Dedieu and J.C. Yakoubsohn, Computing the real roots of a polynomial, Numer. Algor. 4 (1993) 1–24.
P. Henrici and I. Gargantini Uniformly convergent algorithms for the simultaneous approximation of all zeros of a polynomial, in:Constructive Aspects of the Fundamental Theorem of Algebra, eds. B. Dejon and P. Henrici (Wiley Interscience, 1970).
B. Salvy, G. Gourdon and F. Flageolet, Sur une famille de polynômes issus de l'analyse numérique, La Gazette des Mathématiciens (1993), to appear.
Author information
Authors and Affiliations
Additional information
Communicated by J. Della Dora
Rights and permissions
About this article
Cite this article
Yakoubsohn, JC. Approximating the zeros of analytic functions by the exclusion algorithm. Numer Algor 6, 63–88 (1994). https://doi.org/10.1007/BF02149763
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02149763