Efficient methods for the inclusion of polynomial zeros

DOI10.1016/J.AMC.2011.02.065zbMath1253.65071OpenAlexW1996778902MaRDI 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 examplespolynomial zerosacceleration of convergencesimultaneous methodscircular interval arithmeticconvergence conditionsinclusion methodssimple complex zerosinterval iterative methodsNewton's and Halley's corrections

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) General theory of numerical methods in complex analysis (potential theory, etc.) (65E05) Numerical computation of roots of polynomial equations (65H04)

Related Items (1)

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

This page was built for publication: Efficient methods for the inclusion of polynomial zeros