Efficient methods for the inclusion of polynomial zeros

DOI10.1016/j.amc.2011.02.065zbMath1253.65071MaRDI QIDQ544062

Mimica R. Milošević, Dušan M. Milošević, Miodrag S. Petković

Publication date: 14 June 2011

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2011.02.065

zbMATH Keywords

numerical examples; polynomial zeros; acceleration of convergence; simultaneous methods; circular interval arithmetic; convergence conditions; inclusion methods; simple complex zeros; interval iterative methods; Newton's and Halley's corrections

Mathematics Subject Classification ID

65G30: Interval and finite arithmetic

30C15: Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral)

65E05: General theory of numerical methods in complex analysis (potential theory, etc.)

65H04: Numerical computation of roots of polynomial equations

Related Items

Improved methods for the simultaneous inclusion of multiple polynomial zeros

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new higher-order family of inclusion zero-finding methods
• On Euler-like methods for the simultaneous approximation of polynomial zeros
• On a generalisation of the root iterations for polynomial complex zeros in circular interval arithmetic
• Halley-like method with corrections for the inclusion of polynomial zeros
• An improvement of Gargantini's simultaneous inclusion method for polynomial roots by Schröder's correction
• Weierstrass formula and zero-finding methods
• Interval analysis: Theory and applications
• Iterative methods for simultaneous inclusion of polynomial zeros
• Some improved inclusion methods for polynomial roots with Weierstrass' corrections
• Circular arithmetic and the determination of polynomial zeros
• A Note on the Evaluation in Circular Arithmetics
• On Halley-Like Algorithms for Simultaneous Approximation of Polynomial Complex Zeros
• Further Applications of Circular Arithmetic: Schroeder-Like Algorithms with Error Bounds for Finding Zeros of Polynomials