A new higher-order family of inclusion zero-finding methods

DOI10.1016/j.cam.2004.12.020zbMath1079.65059OpenAlexW2055925486MaRDI QIDQ557779

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

Publication date: 30 June 2005

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

Full work available at URL: https://doi.org/10.1016/j.cam.2004.12.020

zbMATH Keywords

numerical examplesConvergenceAcceleration of convergenceCircular interval arithmeticInclusion methodsPolynomial zerosSimultaneous methods

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 solutions to single equations (65H05)

Related Items

A family of root-finding methods with accelerated convergence ⋮ Efficient methods for the inclusion of polynomial zeros

Cites Work

• Parallel Laguerre iterations: The complex case
• 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
• 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
• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item