A computational test for the existence of a polynomial zero

DOI10.1016/0898-1221(89)90041-2zbMath0674.65021OpenAlexW1990531607MaRDI QIDQ1121639

Ljiljana D. Petković, Miodrag S. Petković

Publication date: 1989

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

Full work available at URL: https://doi.org/10.1016/0898-1221(89)90041-2

zbMATH Keywords

Newton-like methodscomputational testpolynomial complex zero

Mathematics Subject Classification ID

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 (3)

On the convergence condition of generalized root iterations for the inclusion of polynomial zeros ⋮ A higher order family for the simultaneous inclusion of multiple zeros of polynomials ⋮ A hybrid method for polynomial complex zero

Cites Work

• Some interval iterations for finding a zero of a polynomial with error bounds
• Further Applications of Circular Arithmetic: Schroeder-Like Algorithms with Error Bounds for Finding Zeros of Polynomials
• Complex interval arithmetic
• The solution of polynomial equations in interval arithmetic

This page was built for publication: A computational test for the existence of a polynomial zero