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

DOI10.1080/00207160212706MaRDI QIDQ3147312zbMATH OpenOpenAlexFDO

Authors 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 examplescomplex polynomialcircular arithmeticisolated roots

Mathematics Subject Classification ID

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) Interval and finite arithmetic (65G30)

Cites work

• scientific article; zbMATH DE number 3489473 (Why is no real title available?)
• Circular arithmetic and the determination of polynomial zeros
• Comparing parallel Newton's method with parallel Laguerre's method
• Further Applications of Circular Arithmetic: Schroeder-Like Algorithms with Error Bounds for Finding Zeros of Polynomials
• Parallel square-root iterations for multiple roots
• Some improved inclusion methods for polynomial roots with Weierstrass' corrections

Cited in

(11)

• Convergence analysis of Sakurai-Torii-Sugiura iterative method for simultaneous approximation of polynomial zeros
• A unified semilocal convergence analysis of a family of iterative algorithms for computing all zeros of a polynomial simultaneously
• On the convergence of closed interpolatory integration rules based on the zeros of Gegenbauer polynomials
• scientific article; zbMATH DE number 440790 (Why is no real title available?)
• An unconditionally convergent method for computing zeros of splines and polynomials
• On the weierstrass and some petkovic-like methods for numerical determination of polynomial zeros
• The interval symmetric single-step \textit{ISS1} procedure for simultaneously bounding simple polynomial zeros
• 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
• scientific article; zbMATH DE number 5296548 (Why is no real title available?)
• The convergence of Euler-like method for the simultaneous inclusion of polynomial zeros
• An efficient interval symmetric single step procedure ISS1-5D for simultaneous bounding of real polynomial zeros

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3147312)