Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Nonlinear Sciences and Numerical Simulation
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
