The location of the zeros of the higher order derivatives of a polynomial
Author:
Piotr Pawlowski
Journal:
Proc. Amer. Math. Soc. 127 (1999), 14931497
MSC (1991):
Primary 30C15; Secondary 65E05
Published electronically:
February 4, 1999
MathSciNet review:
1476386
Fulltext PDF Free Access
Abstract 
References 
Similar Articles 
Additional Information
Abstract: Let be a complex polynomial of degree having zeros in a disk . We deal with the problem of finding the smallest concentric disk containing zeros of . We obtain some estimates on the radius of this disk in general as well as in the special case, where zeros in are isolated from the other zeros of . We indicate an application to the rootfinding algorithms.
 1.
Don
Coppersmith and C.
Andrew Neff, Roots of a polynomial and its derivatives,
Algorithms (Arlington, VA, 1994) ACM, New York, 1994,
pp. 271–279. MR 1285172
(95c:30008)
 2.
Morris
Marden, Geometry of polynomials, Second edition. Mathematical
Surveys, No. 3, American Mathematical Society, Providence, R.I., 1966. MR 0225972
(37 #1562)
 3.
Victor
Y. Pan, New techniques for approximating complex polynomial
zeros, Algorithms (Arlington, VA, 1994) ACM, New York, 1994,
pp. 260–270. MR 1285171
(95g:65194)
 4.
V.
Pan, Sequential and parallel complexity of approximate evaluation
of polynomial zeros, Comput. Math. Appl. 14 (1987),
no. 8, 591–622. MR 920483
(88j:65101), http://dx.doi.org/10.1016/08981221(87)901866
 5.
James
Renegar, On the worstcase arithmetic complexity of approximating
zeros of polynomials, J. Complexity 3 (1987),
no. 2, 90–113. MR 907192
(89a:68107), http://dx.doi.org/10.1016/0885064X(87)900227
 6.
Arnold
Schönhage, Equation solving in terms of computational
complexity, (Berkeley, Calif., 1986) Amer. Math. Soc., Providence,
RI, 1987, pp. 131–153. MR 934220
(89h:68071)
 7.
Steve
Smale, Newton’s method estimates from data at one point,
computational mathematics (Laramie, Wyo., 1985) Springer, New York,
1986, pp. 185–196. MR 870648
(88e:65076)
 1.
 D. Coppersmith, C.A. Neff, Roots of a Polynomial and its Derivatives. Proceedings of the Fifth Annual ACMSIAM Symposium on Discrete Algorithms (Arlington, VA, 1994), 271279, ACM, New York, 1994. MR 95c:30008
 2.
 M. Marden, Geometry of Polynomials. Math. Surveys 3, Amer. Math. Soc. Providence, R.I. 1966. MR 37:1562
 3.
 V.Y. Pan, New Techniques for Approximating Complex Polynomial Zeros Proceedings of the Fifth Annual ACMSIAM Symposium on Discrete Algorithms (Arlington, VA, 1994), 260270, ACM, New York, 1994. MR 95g:65194
 4.
 V.Y. Pan, Sequential and Parallel Complexity of Approximate Evaluation of Polynomial Zeros Computers and Math. (with Applications), 14 (1987) 8, 591622. MR 88j:65101
 5.
 J. Renegar, On the worstcase arithmetic complexity of approximating zeros of polynomials. Journal of Complexity, 3 (1987) 90113. MR 89a:68107
 6.
 A. Sch\H{o}nhage, Equation Solving in Terms of Computational Complexity, Proceedings of the International Congress of Mathematicians, Berkeley, California, 1986. MR 89h:68071
 7.
 S. Smale, Newton's method estimates from data at one point, The Merging Disciplines: New Directions in Pure, Applied and Computational Mathematics. 185196, SpringerVerlag, 1986. MR 88e:65076
Similar Articles
Retrieve articles in Proceedings of the American Mathematical Society
with MSC (1991):
30C15,
65E05
Retrieve articles in all journals
with MSC (1991):
30C15,
65E05
Additional Information
Piotr Pawlowski
Affiliation:
Department of Mathematics and Computer Science, Kent State University, Kent, Ohio 44242
Address at time of publication:
Summit Systems, Inc., 22 Cortlandt Street, New York, New York 10007
Email:
ppawlows@mcs.kent.edu, piotr_pawlowski@summithq.com
DOI:
http://dx.doi.org/10.1090/S000299399904695X
PII:
S 00029939(99)04695X
Received by editor(s):
February 5, 1997
Received by editor(s) in revised form:
September 3, 1997
Published electronically:
February 4, 1999
Communicated by:
Theodore W. Gamelin
Article copyright:
© Copyright 1999 American Mathematical Society
