Journal of the ACM · 1970 · 75 citations · 5 references
ComputingMathematicsAlgorithmsComputational GeometryTheory Of ComputationAlgebraic GeometryApproximation AlgorithmsApproximation MethodsError EstimationGeometric ApproximationNumerical AnalysisError BoundingError BoundsError Bounds EstimationLower Bounds Of ErrorZeros
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.
5
Corrections to numerical data on Q-D algorithm
Richard F. Thomas, Peter Henrici · Communications of the ACM · 1966 · 11 citations · Full text