Optimal Fourth-Order Derivative-Free Numerical Algorithms for Multiple Roots Identification
PDF

Keywords

nonlinear functions
multiple zeros
derivative-free iteration
convergence

How to Cite

[1]
A. Jain, R. Kumar, T. K. Singh, L. Bianchi, V. Gupta, and M.-L. Zhang, “Optimal Fourth-Order Derivative-Free Numerical Algorithms for Multiple Roots Identification”, J. Comput. Eng., vol. 13, no. 2, Feb. 2024, Accessed: Apr. 13, 2026. [Online]. Available: https://journalofcomputerengineering.com/index.php/jce/article/view/1687

Abstract

A plethora of higher order iterative methods, involving derivatives in algorithms, are available in the literature for finding multiple roots. Contrary to this fact, the higher order methods without derivatives in the iteration are difficult to construct, and hence, such methods are almost non-existent. This motivated us to explore a derivative-free iterative scheme with optimal fourth order convergence. The applicability of the new scheme is shown by testing on different functions, which illustrates the excellent convergence. Moreover, the comparison of the performance shows that the new technique is a good competitor to existing optimal fourth order Newton-like techniques.
PDF
Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

Copyright (c) 2024 Aarav Jain, Rohan Kumar, Tanmay Kumar Singh, Lorenzo Bianchi, Vishal Gupta, Mei-Ling Zhang (Author)