Modified Chebyshev‐Halley type method and its variants for computing multiple roots

Modified Chebyshev‐Halley type method and its variants for computing multiple roots

0.00 Avg rating0 Votes
Article ID: iaor20127269
Volume: 61
Issue: 4
Start Page Number: 567
End Page Number: 578
Publication Date: Dec 2012
Journal: Numerical Algorithms
Authors: ,
Keywords: algebra, root finding algorithm
Abstract:

We present two families of third order methods for finding multiple roots of nonlinear equations. One family is based on the Chebyshev‐Halley scheme (for simple roots) and includes Halley, Chebyshev and Chun‐Neta methods as particular cases for multiple roots. The second family is based on the variant of Chebyshev‐Halley scheme and includes the methods of Dong, Homeier, Neta and Li et al. as particular cases. The efficacy is tested on a number of relevant numerical problems. It is observed that the new methods of the families are equally competitive with the well known special cases of the families.

Reviews

Required fields are marked *. Your email address will not be published.