A hybrid method for polynomial complex zero

DOI10.1016/0898-1221(91)90097-NzbMath0724.65048OpenAlexW2018314172MaRDI QIDQ758127

Miodrag S. Petković, Ljiljana Cvetković

Publication date: 1991

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

Full work available at URL: https://doi.org/10.1016/0898-1221(91)90097-n

zbMATH Keywords

iterative algorithmnumerical exampleerror boundspolynomialfloating-point arithmetichybrid methodrectangular arithmeticisolated simple complex zeroessimultaneous inclusionWeierstrass' interval formula

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)

Uses Software

• Pascal-SC

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Hybrid inclusion algorithms for polynomial multiple complex zeros in rectangular arithmetic
• An interval version of the secant method
• The numerical stability of the generalised root iterations for polynomial zeros
• On the efficiency of some combined methods for polynomial complex zeros
• A computational test for the existence of a polynomial zero
• The numerical stability of simultaneous iterations via square-rooting
• Iterative methods for simultaneous inclusion of polynomial zeros
• 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
• Iterative methods for interval inclusion of fixed points

This page was built for publication: A hybrid method for polynomial complex zero