A family of multiple-root finding iterative methods based on weight functions

Abstract

A straightforward family of one-point multiple-root iterative methods is introduced. The family is generated using the technique of weight functions. The order of convergence of the family is determined in its convergence analysis, which shows the constraints that the weight function must satisfy to achieve order three. In this sense, a family of iterative methods can be obtained with a suitable design of the weight function. That is, an iterative algorithm that depends on one or more parameters is designed. This family of iterative methods, starting with proper initial estimations, generates a sequence of approximations to the solution of a problem. A dynamical analysis is also included in the manuscript to study the long-term behavior of the family depending on the parameter value and the initial guess considered. This analysis reveals the good properties of the family for a wide range of values of the parameter. In addition, a numerical test on academic and engineering multiple-root functions is performed.