Hybrid inclusion algorithms for polynomial multiple complex zeros in rectangular arithmetic

complex floating point arithmetic computational costs error bounds implementation interval methods iterative methods numerical examples polynomial zeroes rectangular arithmetic

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

In order to improve existing algorithms for finding polynomial zeroes, the authors combine iterative methods in ordinary complex floating point arithmetic and interval methods in rectangular arithmetic. The advantages of the resulting hybrid procedure are high efficiency and guaranteed error bounds. After an introduction to rectangular arithmetic and hybrid methods the authors study special cases of practical importance. The paper includes numerical examples, remarks concerning computational costs on various computers as well as remarks on implementation of the presented combined method.

Recommendations

Cites work

Cited in

(3)

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

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