A derivative-free root-finding algorithm usingexponential method and its implementation

BMC Research Notes

Research Note

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

[1] Department of Mathematics, Amrita School of Physical Sciences, Amrita Vishwa Vidyapeetham, 522503, Amaravati, Andhra Pradesh, India;Department of Mathematics, College of Natural & Computational Sciences, Mizan-Tepi University, Mizan Teferi, Ethiopia;Department of Mathematics, National Institute of Technology, Chaltlang, 796012, Aizawl, Mizoram, India;Mechanical Power Engineering Department, Faculty of Engineering, Mansoura University, 35516, Mansoura, Egypt;

关键词: Iterative algorithms;    Nonlinear equations;    Exponential method;    Algorithm implementation;    Root-finding algorithms;    65H04;    65Hxx;   

DOI  :  10.1186/s13104-023-06554-1

 received in 2022-10-20, accepted in 2023-10-04,  发布年份 2023

来源: Springer

【 摘 要 】

ObjectiveIn 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.ResultsSeveral 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.

【 授权许可】

CC BY   
© BioMed Central Ltd., part of Springer Nature 2023

【 图 表 】

Fig. 4

Fig. 10

Fig. 1

Fig. 1

Fig. 2

Scheme 1

12951_2016_223_Article_IEq1.gif

42004_2023_1031_Figa_HTML.png

12951_2016_246_Article_IEq9.gif

42004_2023_1031_Article_IEq16.gif

Fig. 5

Fig. 8