An efficient class of fourth-order derivative-free method for multiple-roots
Authors:
- 29 April 2021
- journal article
- research article
- Published by Walter de Gruyter GmbH in International Journal of Nonlinear Sciences and Numerical Simulation
- Vol. 24 (1) , 265-275
Abstract
Many optimal order multiple root techniques, which use derivatives in the algorithm, have been proposed in literature. Many researchers tried to construct an optimal family of derivative-free methods for multiple roots, but they did not get success in this direction. With this as a motivation factor, here, we present a new optimal class of derivative-free methods for obtaining multiple roots of nonlinear functions. This procedure involves Traub–Steffensen iteration in the first step and Traub–Steffensen-like iteration in the second step. Efficacy is checked on a good number of relevant numerical problems that verifies the efficient convergent nature of the new methods. Moreover, we find that the new derivative-free methods are just as competent as the other existing robust methods that use derivatives.Keywords
This publication has 20 references indexed in Scilit:
- A class of two-point sixth-order multiple-zero finders of modified double-Newton type and their dynamicsApplied Mathematics and Computation, 2015
- Finding the solution of nonlinear equations by a class of optimal methodsComputers & Mathematics with Applications, 2012
- Some fourth-order nonlinear solvers with closed formulae for multiple rootsComputers & Mathematics with Applications, 2010
- A new fourth-order iterative method for finding multiple roots of nonlinear equationsApplied Mathematics and Computation, 2009
- New third order nonlinear solvers for multiple rootsApplied Mathematics and Computation, 2008
- An optimal multiple root-finding method of order threeJournal of Computational and Applied Mathematics, 1994
- A family of multiopoint iterative functions for finding multiple roots of equationsInternational Journal of Computer Mathematics, 1987
- A family of root finding methodsNumerische Mathematik, 1976
- Optimal Order of One-Point and Multipoint IterationJournal of the ACM, 1974
- Ueber unendlich viele Algorithmen zur Auflösung der GleichungenMathematische Annalen, 1870