Hybrid inclusion algorithms for polynomial multiple complex zeros in rectangular arithmetic (Q758126)

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.