A New Non-Divergent Root Finding Algorithm

Authors

DOI:

https://doi.org/10.26713/jims.v17i4.3334

Abstract

A new iteration algorithm is proposed. The algorithm does not diverge when the first derivative is zero or nearly zero as in the case of Newton-Raphson method. The convergence rate of the new algorithm is linear compared to the quadratic convergence of the Newton-Raphson method (The Newton-Raphson method is faster). The algorithm significantly increases the interval of convergence for roots. A hybrid algorithm combining the increase in the range of convergence of the new method and the faster rate of convergence of the Newton-Raphson method is suggested. The criterion to select the best choice during the running of the algorithm is given. Numerical examples are treated and the three methods (Non-Divergent Algorithm, Newton-Raphson method and the Hybrid method) are contrasted with each other. The hybrid method is recommended since it decreases the number of iterations and increases the range of convergence.

Views: 414Downloads: 186

Downloads

Download data is not yet available.

References

S. Abbasbandy, Improving Newton-Raphson method for nonlinear equations by modified Adomian decomposition method, Applied Mathematics and Computation 145(2-5) (2003), 887 – 893, DOI: 10.1016/S0096-3003(03)00282-0.

A. Constantin and R. S. Johnson, The dynamics of waves interacting with the Equatorial undercurrent, Geophysical and Astrophysical Fluid Dynamics 109(4) (2015), 311 – 358, DOI: 10.1080/03091929.2015.1066785.

Y. Ding, C. Sui and J. Li, An experimental investigation into combustion fitting in a direct injection marine diesel engine, Applied Sciences 8(12) (2018), 2489, DOI: 10.3390/app8122489.

T. Gemechu and S. Thota, On new root finding algorithms for solving nonlinear transcendental equations, International Journal of Chemistry, Mathematics and Physics 4(2) (2020), 18 – 24, DOI: 10.22161/ijcmp.4.2.1.

B. Ghanbari, A new general fourth-order family of methods for finding simple roots of nonlinear equations, Journal of King Saud University 23(4) (2010), 395 – 398, DOI: 10.1016/j.jksus.2010.07.018.

A. S. Householder, The Numerical Treatment of a Single Nonlinear Equation, McGraw-Hill, New York, (1970).

N. Jaksic, Numerical algorithm for natural frequencies computation of an axially moving beam model, Meccanica 44 (2009), 687 – 695, DOI: 10.1007/s11012-009-9203-5.

B. Kalantari, Polynomiography and application in art, education, and science, Computers & Graphics 28(3) (2004), 417 – 430, DOI: 10.1016/j.cag.2004.03.009.

S. M. Kang, A. Naseem, W. Nazeer and A. Jan, Modification of Abbasbandy’s method and polynomiography, International Journal of Mathematical Analysis 10(24) (2016), 1197 – 1210, DOI: 10.12988/ijma.2016.6898.

A. Naseem, M. A. Rehman and J. Younis, A new root-finding algorithm for solving real-world problems and its complex dynamics via computer technology, Complexity 2021(1) (2021), 6369466, DOI: 10.1155/2021/6369466.

A. Özyapıcı, Effective numerical methods for non-linear equations, International Journal of Applied and Computational Mathematics 6 (2020), article number 35, DOI: 10.1007/s40819-020-0785-x.

A. Özyapıcı, Z. B. Sensoy and T. Karanfiller, Effective root-finding methods for nonlinear equations based on multiplicative calculi, Journal of Mathematics 2016(1) (2016), 8174610, DOI: 10.1155/2016/8174610.

M. Pakdemirli and H. Boyacı, Generation of root finding algorithms via perturbation theory and some formulas, Applied Mathematics and Computation 184(2) (2007), 783 – 788, DOI: 10.1016/j.amc.2006.05.207.

M. Pakdemirli, H. Boyacı and H. A. Yurtsever, A root-finding algorithm with fifth order derivatives, Mathematical and Computational Applications 13(2) (2008), 123 – 128, DOI: 10.3390/mca13020123.

S. Qureshi, H. Ramos and A. K. Soamro, A new nonlinear ninth-order root-finding method with error analysis and basins of attraction, Mathematics 9(16) (2021), 1996, DOI: 10.3390/math9161996.

N. H. A. Rahman, A. Ibrahim and M. I. Jayes, Higher order homotopy Taylor perturbation via start-system, Applied Mathematics and Computational Intelligence 2 (2013), 85 – 94.

C. L. Sabharwal, An iterative hybrid algorithm for roots of non-linear equations, Engineering 2(1) (2021), 80 – 98, DOI: 10.3390/eng2010007.

H. Susanto and N. Karjanto, Newton’s method’s basins of attraction revisited, Applied Mathematics and Computation 215(3) (2009), 1084 – 1090, DOI: 10.1016/j.amc.2009.06.041.

M. Turkyilmazoglu, A simple algorithm for high order Newton iteration formula and some new variants, Hacettepe Journal of Mathematics and Statistics 49(1) (2020), 425 – 438, DOI: 10.15672/hujms.459810.

C. Vanhille, An improved secant algorithm of variable order to solve nonlinear equations based on the disassociation of numerical approximations and iterative progression, Journal of Mathematics Research 12(6) (2020), 50 – 65, DOI: 10.5539/jmr.v12n6p50.

Y. Wu and K. F. Cheung, Two-parameter homotopy method for nonlinear equations, Numerical Algorithms 53 (2010), 555 – 572, DOI: 10.1007/s11075-009-9319-7.

Downloads

Published

December 30, 2025

Issue

Section

Research Article

How to Cite

Pakdemirli, M. (2025). A New Non-Divergent Root Finding Algorithm. Journal of Informatics and Mathematical Sciences, 17(4), 365-374. https://doi.org/10.26713/jims.v17i4.3334