Skip to Main Content

Mathematics of Computation

Published by the American Mathematical Society since 1960 (published as Mathematical Tables and other Aids to Computation 1943-1959), Mathematics of Computation is devoted to research articles of the highest quality in computational mathematics.

ISSN 1088-6842 (online) ISSN 0025-5718 (print)

The 2020 MCQ for Mathematics of Computation is 1.78.

What is MCQ? The Mathematical Citation Quotient (MCQ) measures journal impact by looking at citations over a five-year period. Subscribers to MathSciNet may click through for more detailed information.

 

Root neighborhoods of a polynomial
HTML articles powered by AMS MathViewer

by Ronald G. Mosier PDF
Math. Comp. 47 (1986), 265-273 Request permission

Abstract:

The root neighborhoods of $p(z)$, a polynomial over the complex field, are the sets of complex numbers that are the roots of polynomials which are near to $p(z)$. The term ’near’ means that the coefficients of the polynomials are within some fixed magnitude of the coefficients of $p(z)$. A necessary and sufficient condition for a complex number to be in the root neighborhoods is given and it is proved that each root neighborhood contains at least one root of $p(z)$ and the same number of roots of each near polynomial. Finally, a necessary and sufficient condition is given for a root neighborhood to contain more than one root of $p(z)$, and consequently more than one root of any of the near polynomials.
References
Similar Articles
Additional Information
  • © Copyright 1986 American Mathematical Society
  • Journal: Math. Comp. 47 (1986), 265-273
  • MSC: Primary 65G05; Secondary 12D10, 30C10, 30C15
  • DOI: https://doi.org/10.1090/S0025-5718-1986-0842134-4
  • MathSciNet review: 842134