A derivative-free root-finding algorithm using exponential method and its implementation

Srinivasarao Thota; Mohamed M Awad; P Shanmugasundaram; Laxmi Rathour

doi:10.1186/s13104-023-06554-1

A derivative-free root-finding algorithm using exponential method and its implementation

BMC Res Notes. 2023 Oct 17;16(1):276. doi: 10.1186/s13104-023-06554-1.

Authors

Srinivasarao Thota¹, Mohamed M Awad², P Shanmugasundaram³, Laxmi Rathour⁴

Affiliations

¹ Department of Mathematics, Amrita School of Physical Sciences, Amrita Vishwa Vidyapeetham, Amaravati, Andhra Pradesh, 522503, India.
² Mechanical Power Engineering Department, Faculty of Engineering, Mansoura University, Mansoura, 35516, Egypt.
³ Department of Mathematics, College of Natural & Computational Sciences, Mizan-Tepi University, Mizan Teferi, Ethiopia. psserode@mtu.edu.et.
⁴ Department of Mathematics, National Institute of Technology, Chaltlang, 796012, Aizawl, Mizoram, India.

Abstract

Objective: In this paper, we develop a new root-finding algorithm to solve the given non-linear equations. The proposed root-finding algorithm is based on the exponential method. This algorithm is derivative-free and converges fast.

Results: Several numerical examples are presented to illustrate and validation of the proposed methods. Microsoft Excel and Maple implementation of the proposed algorithm is presented with sample computations.

Keywords: Algorithm implementation; Exponential method; Iterative algorithms; Nonlinear equations; Root-finding algorithms.

MeSH terms

Acer*
Algorithms*