On a class of higher order methods for simultaneous rootfinding of generalized polynomials
The paper is devoted to the study of a class of iterative methods for simultaneous computation of all zeros of generalized polynomials. It is proved that these methods are of convergence order \(N\), and also certain relations to other methods are discussed. Finally, a priori and a posteriori error estimates and some illustrating numerical examples are given.
scientific article; zbMATH DE number 569142