A hybrid method for polynomial complex zero

DOI10.1016/0898-1221(91)90097-NMaRDI QIDQ758127zbMATH OpenOpenAlexFDO

Authors M. 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

error boundsfloating-point arithmetichybrid methodisolated simple complex zeroesiterative algorithmnumerical examplepolynomialrectangular arithmeticsimultaneous inclusionWeierstrass' interval formula

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) General theory of numerical methods in complex analysis (potential theory, etc.) (65E05) Interval and finite arithmetic (65G30) Numerical computation of solutions to single equations (65H05)

Review text

The paper deals with an iterative algorithm for finding isolated simple complex zeroes of a polynomial. Using Weierstrass' interval formula for the simultaneous inclusion of all zeroes of the polynomial and rectangular floating-point arithmetic, a hybrid method with high computational efficiency is presented. Furthermore, error bounds of the approximate solution are determined. In a second part, a computationally verifiable test for the existence of a zero in a given disc is established. A numerical example is given, too.

Recommendations

• Hybrid inclusion algorithms for polynomial multiple complex zeros in rectangular arithmetic
• A Halley‐Like Hybrid Method for Solving Polynomial Equations
• Laguerre-like inclusion method for polynomial zeros
• On zeros of a complex polynomial
• On an interval method for the inclusion of one polynomial zero

Cites work

• A computational test for the existence of a polynomial zero
• An interval version of the secant method
• Circular arithmetic and the determination of polynomial zeros
• Further Applications of Circular Arithmetic: Schroeder-Like Algorithms with Error Bounds for Finding Zeros of Polynomials
• scientific article; zbMATH DE number 3880009 (Why is no real title available?)
• scientific article; zbMATH DE number 4043210 (Why is no real title available?)
• scientific article; zbMATH DE number 3489473 (Why is no real title available?)
• Hybrid inclusion algorithms for polynomial multiple complex zeros in rectangular arithmetic
• Iterative methods for interval inclusion of fixed points
• Iterative methods for simultaneous inclusion of polynomial zeros
• On Halley-Like Algorithms for Simultaneous Approximation of Polynomial Complex Zeros
• On the efficiency of some combined methods for polynomial complex zeros
• The numerical stability of simultaneous iterations via square-rooting
• The numerical stability of the generalised root iterations for polynomial zeros

Cited in

(6)

• A computational test for the existence of a polynomial zero
• On zeros of a complex polynomial
• scientific article; zbMATH DE number 1254285 (Why is no real title available?)
• A fixed-point approach to locating polynomial zeros
• Hybrid inclusion algorithms for polynomial multiple complex zeros in rectangular arithmetic
• On the efficiency of some combined methods for polynomial complex zeros

Describes a project that uses

Uses Software

• Pascal-SC

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

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