A computational test for the existence of a polynomial zero

DOI10.1016/0898-1221(89)90041-2MaRDI QIDQ1121639zbMATH OpenOpenAlexFDO

Authors M. S. Petković, L. D. 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

computational testNewton-like methodspolynomial 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)

Review text

A computational test for the existence of a polynomial complex zero in a given complex region is introduced. The test can be combined with Newton- like methods to improve circular (or rectangular) approximation of the requested zero. An example is given.

Recommendations

• A hybrid method for polynomial complex zero
• On zeros of a complex polynomial
• scientific article; zbMATH DE number 1929302
• A new proximity test for polynomial zeros
• On an interval method for the inclusion of one polynomial zero

Cites work

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

Cited in

(8)

• Verification of a low-degree polynomial vanishing at empirical points
• A higher order family for the simultaneous inclusion of multiple zeros of polynomials
• scientific article; zbMATH DE number 714514 (Why is no real title available?)
• Efficient zero location tests for delta-operator-based polynomials
• Existence of non-trivial complex unit neighborhoods
• A new proximity test for polynomial zeros
• A hybrid method for polynomial complex zero
• On the convergence condition of generalized root iterations for the inclusion of polynomial zeros

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1121639)