Error Bounds for Zeros of a Polynomial Based Upon Gerschgorin's Theorems
- 1 October 1970
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 17 (4) , 661-674
- https://doi.org/10.1145/321607.321615
Abstract
Given N approximations to the zeros of an N th-degree polynomial, N circular regions in the complex z -plane are determined whose union contains all the zeros, and each connected component of this union consisting of K such circular regions contains exactly K zeros. The bounds for the zeros provided by these circular regions are not excessively pessimistic; that is, whenever the approximations are sufficiently well separated and sufficiently close to the zeros of this polynomial, the radii of these circular regions are shown to overestimate the errors by at most a modest factor simply related to the configuration of the approximations. A few numerical examples are included.Keywords
This publication has 6 references indexed in Scilit:
- A stopping criterion for polynomial root findingCommunications of the ACM, 1967
- Correcting approximations to multiple roots of polynomialsNumerische Mathematik, 1966
- Corrections to numerical data on Q-D algorithmCommunications of the ACM, 1966
- Finding zeros of a polynomial by the Q-D algorithmCommunications of the ACM, 1965
- A Generalization of Hermite's Interpolation FormulaThe American Mathematical Monthly, 1960
- An elementary double inequality for the roots of an algebraic equation having greatest absolute valueBulletin of the American Mathematical Society, 1915