On a Fifth-Order Method for Multiple Roots of Nonlinear Equations

Abstract

There are several measures for comparing methods for solving a single nonlinear equation. The first is the order of convergence, then the cost to achieve such rate. This cost is measured by counting the number of functions (and derivatives) evaluated at each step. After that, efficiency is defined as a function of the order of convergence and cost. Lately, the idea of basin of attraction is used. This shows how far one can start and still converge to the root. It also shows the symmetry/asymmetry of the method. It was shown that even methods that show symmetry when solving polynomial equations are not so when solving nonpolynomial ones. We will see here that the Euler–Cauchy method (a member of the Laguerre family of methods for multiple roots) is best in the sense that the boundaries of the basins have no lobes. The symmetry in solving a polynomial equation having two roots at ±1 with any multiplicity is obvious. In fact, the Euler–Cauchy method converges very fast in this case. We compare one member of a family of fifth-order methods for multiple roots with several well-known lower-order and efficient methods. We will show using a basin of attraction that the fifth-order method cannot compete with most of those lower-order methods.

Keywords

• nonlinear equations
• multiple roots
• basins of attraction