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

DOI10.1016/0898-1221(87)90060-5zbMath0633.65045OpenAlexW2069148510MaRDI 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

convergencenumerical examplescircular arithmeticerror boundinterval arithmeticNewton-like methodinterval iterative methodscomplex zero of a polynomialHalley-like method

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

Related Items (5)

A local convergence theorem for the super-Halley method in a Banach space ⋮ A computational test for the existence of a polynomial zero ⋮ 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

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

This page was built for publication: Some interval iterations for finding a zero of a polynomial with error bounds