Some interval iterations for finding a zero of a polynomial with error bounds

DOI10.1016/0898-1221(87)90060-5zbMath0633.65045MaRDI QIDQ1096334

Miodrag S. Petković

Publication date: 1987

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0898-1221(87)90060-5

zbMATH Keywords

convergence; numerical examples; circular arithmetic; error bound; interval arithmetic; Newton-like method; interval iterative methods; complex zero of a polynomial; Halley-like method

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)

65H05: Numerical computation of solutions to single equations

Related Items

The Root Separation of Polynomials and Some Applications, Schröder-like algorithms for multiple complex zeros of a polynomial, Hybrid inclusion algorithms for polynomial multiple complex zeros in rectangular arithmetic, A computational test for the existence of a polynomial zero, A local convergence theorem for the super-Halley method in a Banach space

Cites Work

• Circular arithmetic and the determination of polynomial zeros
• Further Applications of Circular Arithmetic: Schroeder-Like Algorithms with Error Bounds for Finding Zeros of Polynomials
• A Generalization of a Theorem of Bôcher
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item