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

DOI10.1080/00207160212706zbMATH Open1007.65036OpenAlexW2017882748MaRDI QIDQ3147312FDOQ3147312

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

• Title not available (Why is that?)
• 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
• Parallel square-root iterations for multiple roots
• Comparing parallel Newton's method with parallel Laguerre's method

Cited In (11)

• A unified semilocal convergence analysis of a family of iterative algorithms for computing all zeros of a polynomial simultaneously
• Convergence analysis of Sakurai-Torii-Sugiura iterative method for simultaneous approximation of polynomial zeros
• 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
• On the convergence of closed interpolatory integration rules based on the zeros of Gegenbauer polynomials
• 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
• Title not available (Why is that?)
• Title not available (Why is that?)
• 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
• An unconditionally convergent method for computing zeros of splines and polynomials

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)