On the perturbation of the zeros of complex polynomials

IMA Journal of Numerical Analysis

Volumn 20, Issue 2, 2000, Pages 185-202

  Schätzle, Reiner ^a  

^a UNIVERSITY OF FREIBURG   (Germany)

Author keywords

Perturbation of coefficients; Zeros of polynomials

Indexed keywords

COMPLEX POLYNOMIALS; NTH ROOT; OSTROWSKI; PERTURBATION OF COEFFICIENTS; SHARP ESTIMATES; ZEROS OF POLYNOMIAL;

POLYNOMIALS;

EID: 0034421315     PISSN: 02724979     EISSN: None     Source Type: Journal    
DOI: 10.1093/imanum/20.2.185     Document Type: Article

References (10)

1. FOX, L. & MAYERS, D. F. 1968 Computing Methods for Scientists and Engineers. Oxford: Clarendon.
2. GAUTSCHI, W. 1978 Questions of Numerical Condition Related to Polynomials, Recent Progress in Numerical Analysis (C. de Boor and G. H. Golub, eds). New York: Academic, pp 45-72.
3. GOURDON, X. 1993 Algorithmique du théorème fondamental de l'algèbre. INRIA Rocquencourt, Rapport de Recherche 1852.
4. GOURDON, X. 1996 Combinatoire, algorithmique et géométrie des polynômes. Doctoral Thesis, Ecole Polytechnique, available at http://pauillac.inria.fr/algo/gourdon.
5. HALL, P. 1935 On the representatives of subsets. J. London Math. Soc. 10, 25-30.
6. LOVASZ, L. & PLUMMER, M. D. 1986 Matching Theory. Amsterdam: North-Holland.
7. MARDEN, M. 1966 The Geometry of Polynomials 2nd edn. Providence, RI: American Mathematical Society.
8. OSTROWSKI, A. 1966 Solutions of Equations and Systems of Equations 2nd edn. New York: Academic.
9. SCHÖNHAGE, A. 1982 The fundamental theorem of algebra in terms of computational complexity. Universität Tübingen, preliminary report, available at http://web.informatik.uni-bonn.de/II/staff/schoe/SCHOENHAGEliteratur.html.
10. SCHÖNHAGE, A. 1985 Quasi-GCD computations. J. Complexity 1, 118-137.