Resumen
In this paper, we present a new third-order family of iterative methods in order to compute the multiple roots of nonlinear equations when the multiplicity (m≥1)" role="presentation">(??=1)(m=1)
(
m
=
1
)
is known in advance. There is a plethora of third-order point-to-point methods, available in the literature; but our methods are based on geometric derivation and converge to the required zero even though derivative becomes zero or close to zero in vicinity of the required zero. We use the exponential fitted curve and tangency conditions for the development of our schemes. Well-known Chebyshev, Halley, super-Halley and Chebyshev?Halley are the special members of our schemes for m=1" role="presentation">??=1m=1
m
=
1
. Complex dynamics techniques allows us to see the relation between the element of the family of iterative schemes and the wideness of the basins of attraction of the simple and multiple roots, on quadratic polynomials. Several applied problems are considered in order to demonstrate the performance of our methods and for comparison with the existing ones. Based on the numerical outcomes, we deduce that our methods illustrate better performance over the earlier methods even though in the case of multiple roots of high multiplicity.