On Euler-like methods for the simultaneous approximation of polynomial zeros (Q1128293): Difference between revisions

The authors consider some iterative methods based on a variant of the classical Euler third-order method \[ \widehat z= z-{2f(z)\over f'(z)\pm \sqrt{(f'(z))^2- 2f(z)f''(z)}}, \] combined with a Weierstrass correction \(W_i= P(z_i)/\prod_{j\neq i}(z_i- z_j)\), for simultaneous computation of all zeros of a polynomial \(f(z)\). The methods presented are shown to have order \(\geq 4\). Using interval arithmetic, two inclusion methods for simultaneous estimation of zeros are presented. Combining these methods in floating-point arithmetic and complex interval arithmetic, the authors construct an efficient hybrid method with automatic error bound estimation. The paper concludes with computational details and a numerical example, implementations for which are compared both on serial and parallel platforms.