A new higher-order family of inclusion zero-finding methods

Starting from a suitable fixed point relation, a new one-parameter family of iterative methods for the simultaneous inclusion of complex zeros in circular complex arithmetic is constructed. It is proved that the order of convergence of this family is four. The convergence analysis is performed under computationally verifiable initial conditions. An approach for the construction of accelerated methods with negligible number of additional operations is discussed. To demonstrate convergence properties of the proposed family of methods, two numerical examples results are given.