On the weierstrass and some petkovic-like methods for numerical determination of polynomial zeros

DOI10.1080/00207160310001603280zbMath1046.65037OpenAlexW1980429301MaRDI QIDQ4467346

M. N. O. Ikhile

Publication date: 9 June 2004

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

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

zbMATH Keywords

numerical examplesconvergence accelerationerror boundsinterval arithmeticWeierstrass methodinclusion methodscombination method

Mathematics Subject Classification ID

Related Items (1)

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

Cites Work

• Unnamed Item
• Parallel square-root iterations for multiple roots
• Comparing parallel Newton's method with parallel Laguerre's method
• The numerical stability of simultaneous iterations via square-rooting
• Some improved inclusion methods for polynomial roots with Weierstrass' corrections
• Circular arithmetic and the determination of polynomial zeros
• On The Convergence Of Some Interval Methods For Simultaneous Computation Of Polynomial Zeros
• On the Convergence Speed of Some Algorithms for the Simultaneous Approximation of Polynomial Roots

This page was built for publication: On the weierstrass and some petkovic-like methods for numerical determination of polynomial zeros