Hybrid inclusion algorithms for polynomial multiple complex zeros in rectangular arithmetic

DOI10.1016/0168-9274(91)90036-YzbMath0724.65047OpenAlexW2051279564MaRDI QIDQ758126

Miodrag S. Petković, Jürgen Herzberger

Publication date: 1991

Published in: Applied Numerical Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0168-9274(91)90036-y

zbMATH Keywords

numerical exampleserror boundsiterative methodsimplementationinterval methodscomputational costsrectangular arithmeticcomplex floating point arithmeticpolynomial zeroes

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)

Related Items (1)

A hybrid method for polynomial complex zero

Cites Work

• An interval version of the secant method
• Locating multiple zeros interactively
• Some interval iterations for finding a zero of a polynomial with error bounds
• A family of root finding methods
• Iterative methods for simultaneous inclusion of polynomial zeros
• Circular arithmetic and the determination of polynomial zeros
• Iterative methods for interval inclusion of fixed points
• Complex interval arithmetic
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Hybrid inclusion algorithms for polynomial multiple complex zeros in rectangular arithmetic