On the new fourth-order methods for the simultaneous approximation of polynomial zeros

Abstract

a b s t r a c tA new iterative method of the fourth-order for the simultaneous determination of polynomial zeros is proposed. This method is based on a suitable zero-relation derived from the fourth-order method for a single zero belonging to the Schröder basic sequence. One of the most important problems in solving polynomial equations, the construction of initial conditions that enable both guaranteed and fast convergence, is studied in detail for the proposed method. These conditions are computationally verifiable since they depend only on initial approximations, the polynomial coefficients and the polynomial degree, which is of practical importance. The construction of improved methods in ordinary complex arithmetic and complex circular arithmetic is discussed. Finally, numerical examples and the comparison with existing fourth-order methods are given.

Traub’s accelerating generator of iterative root-finding methods

“…In this way their computational efficiency is significantly increased. Such an approach for simple zeros is presented in the papers [12,13], together with an extensive discussion of initial computationally verifiable conditions that guarantee the convergence of the methods presented in this paper, numerical examples and comparison of various methods of the similar type, including the basic methods (10) and (17) and their improvements. For this reason and the required limit of papers addressed to this journal, the reviews of computational aspects and convergence conditions are omitted.…”

On the Critical Points of Kyurkchiev’s Method for Solving Algebraic Equations

“…In [14] Petkovic, Rancic and Milosevic explore all known methods with fourth order of convergence (they suggest also new methods) and give to the reader serious computer experiments.…”