Schröder-like algorithms for multiple complex zeros of a polynomial (Q756374)

Using the iterative method of Newton's type in circular arithmetic, introduced by the author [Comput. Math. Appl. 14, 479-495 (1987; Zbl 0633.65045)], a new iterative method for finding a multiple complex zero of a polynomial is derived. This method can be regarded as a version of the classical Schröder's method. Initial conditions which guarantee a safe convergence of the proposed method are stated. The increase of the computational efficiency is achieved by a combination of the complex approximation methods of Schröder's type with some interval methods. The presented algorithms are analyzed in view of their efficiency and illustrated in the example of a polynomial equation.