The Root and Bell's disk iteration methods are of the same error propagation characteristics in the simultaneous determination of the zeros of a polynomial, Part I: Correction methods

Authors:
M. N. O. Ikhile
Affiliations:
African Institute for Mathematical Sciences (AIMS), 6 Melrose Road, Muizenberg 7945, Cape Town, South Africa and Department of Mathematics, University of Benin, P.M.B. 1154, Benin City, Nigeria
Venue:
Computers & Mathematics with Applications
Year:
2008

Citing 4
Cited 1

Applied and computational complex analysis. Vol. 3: discrete Fourier analysis—Cauchy integrals—construction of conformal maps---univalent functions

Applied and computational complex analysis. Vol. 3: discrete Fourier analysis—Cauchy integrals—construction of conformal maps---univalent functions
New computer methods for global optimization

New computer methods for global optimization
Schro¨der-like algorithms for multiple complex zeros of a polynomial

Computing
Introduction to scientific computing: a matrix-vector approach using MATLAB

Introduction to scientific computing: a matrix-vector approach using MATLAB

The root and Bell's disk iteration methods are of the same error propagation characteristics in the simultaneous determination of the zeros of a polynomial, Part II: Round-off error analysis by use of interval arithmetic

Computers & Mathematics with Applications

Quantified Score

Hi-index	0.09

Visualization

Abstract

In this paper we consider the error propagation of the Root and Bell's disk iteration methods enhanced by incorporating a correction term and a choice of a disk inversion formula in the methods, for the simultaneous computation of the zeros of a polynomial. The asymptotic error propagation is proved to be the same in both methods. This result is important considering the fact that these methods are in popular usage in the simultaneous computation of the zeros of a polynomial. The proof of the results herein follows the ideas of [M.S. Petkovic, C. Carstensen, Some improved inclusion methods for polynomial roots with Weierstrass corrections, Comput. Math. Appl. 25 (3) (1993) 59-67]. When the refinement process of correction is efficient, it is this mode of correction we have desired to propose.