New Families of Third-Order Iterative Methods for Finding Multiple Roots

الملخص EN

Two families of third-order iterative methods for finding multiple roots of nonlinear equations are developed in this paper.

Mild conditions are given to assure the cubic convergence of two iteration schemes (I) and (II).

The presented families include many third-order methods for finding multiple roots, such as the known Dong's methods and Neta's method.

Some new concrete iterative methods are provided.

Each member of the two families requires two evaluations of the function and one of its first derivative per iteration.

All these methods require the knowledge of the multiplicity.

The obtained methods are also compared in their performance with various other iteration methods via numerical examples, and it is observed that these have better performance than the modified Newton method, and demonstrate at least equal performance to iterative methods of the same order.