On The Convergence Of Some Interval Methods For Simultaneous Computation Of Polynomial Zeros

DOI10.1080/00207160212706zbMath1007.65036OpenAlexW2017882748MaRDI QIDQ3147312

M. N. O. Ikhile

Publication date: 20 March 2003

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160212706

zbMATH Keywords

convergencenumerical examplescircular arithmeticcomplex polynomialisolated roots

Mathematics Subject Classification ID

Interval and finite arithmetic (65G30) Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15) Numerical computation of solutions to single equations (65H05)

Related Items (2)

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. I: Correction methods ⋮ On the weierstrass and some petkovic-like methods for numerical determination of polynomial zeros

Cites Work

• Unnamed Item
• Parallel square-root iterations for multiple roots
• Comparing parallel Newton's method with parallel Laguerre's method
• Some improved inclusion methods for polynomial roots with Weierstrass' corrections
• Circular arithmetic and the determination of polynomial zeros
• Further Applications of Circular Arithmetic: Schroeder-Like Algorithms with Error Bounds for Finding Zeros of Polynomials

This page was built for publication: On The Convergence Of Some Interval Methods For Simultaneous Computation Of Polynomial Zeros