Non-divergent circular arc root algorithm

Document Type : Original Article

Author

Department of Mechanical Engineering, Manisa Celal Bayar University, Manisa, Turkey

Abstract
A new iteration algorithm for numerically locating the roots of nonlinear algebraic functions is proposed. The algorithm is non-divergent even in the vicinity of local extrema. The algorithm depends of drawing a tangent circular arc to the initial estimation point on the curve. The radius of curvature of the circular arc is equal to the functions radius of curvature at the estimated point. The intersection points of the circular arc with the x axis determine the first iteration for the roots. The iteration equation is derived first. The conditions for which the algorithm works are discussed. It is proven that the convergence rate of the new algorithm is quadratic. Using sample problems, the algorithm is contrasted with the well-known Newton-Raphson algorithm and the parabolic algorithm. It is shown that the algorithm requires less iterations, has a wider convergence interval in general and does not diverge in the vicinity of local extrema as compared to the Newton-Raphson method. For the example considered, the algorithm is better than the parabolic algorithm in terms of the iterations and computational times.

Keywords

Subjects


[1] S. Abbasbandy, Improving Newton-Raphson method for nonlinear equations by modified Adomian decomposition method, Applied Mathematics and Computation, 145, 887-893, 2003.
[2] S. Abbasbandy, Modified Homotopy Perturbation Method for nonlinear equations and comparison with Adomian Decomposition Method, Applied Mathematics and Computation, 172, 431-438, 2006. 
[3] A. Constantin and R. S. Johnson, The dynamics of waves interacting with the Equatorial undercurrent, Geophysical and Astrophysical Fluid Dynamics, 109(4), 311-358, 2015. 
[4] Y. Ding, C. Sui and J. Li, An experimental investigation into combustion fitting in a direct injection marine diesel engine, Applied Sciences, 8, 2489, 2018. 
[5] B. Ghanbari, A new general fourth order family of methods for finding simple roots of nonlinear equations, Journal of King Saud University, 23, 395-398, 2011. 
[6] T. Gemechu and S. Thota, On new root finding algorithms for solving nonlinear transcendental equations, International Journal of Chemistry, Mathematics and Physics, 4(2), 18-24, 2020. 
[7] A. S. Householder, The numerical treatment of a single nonlinear equation, McGraw-Hill, New York, 1970. 
[8] N. Jaksic, Numerical algorithm for natural frequencies computation of an axially moving beam model, Meccanica, 44, 687-695, 2009. 
[9] S. M. Kang, A. Naseem, W. Nazeer and A. Jan, Modification of Abbasbandy’s method and polynomiography, International Journal of Mathematical Analysis, 10, 1197-1210, 2016. 
[10] A. Naseem, M. A. Rehman and Jihad Younis, A new root finding algorithm for solving real world problems and its complex dynamics via computer technology, Complexity, 2021, Article ID 6369466, 2021. 
[11] A. Özyapıcı, Z. B. ¸ Sensoy and T. Karanfiller, Effective root finding methods for nonlinear equations based on multiplicative calculi, Journal of Mathematics, 2016. 
[12] M. Pakdemirli and H. A. Yurtsever, Estimating roots of polynomials using perturbation theory, Applied Mathematics and Computation, 188, 2025-2028, 2007. 
[13] M. Pakdemirli and G. Sarı, A comprehensive perturbation theorem for estimating magnitudes of roots of polynomials, LMS Journal of Computation and Mathematics 16,1-8, 2013. 
[14] M. Pakdemirli, G. Sarı and N. Elmas, Approximate determination of polynomial roots, Applied and Computational Mathematics 15(1), 67-77, 2016. 
[15] M. Pakdemirli and H. Boyacı, Generation of Root Finding Algorithms via Perturbation Theory and Some Formulas, Applied Mathematics and Computation, 184, 783-788, 2007. 
[16] M. Pakdemirli, H. Boyacı and H. A. Yurtsever, Perturbative derivation and comparisons of root-finding algorithms with fourth order derivatives, Mathematical and Computational Applications, 12(2), 117-124, 2007. 
[17] M. Pakdemirli, H. Boyacı and H. A. Yurtsever, A root finding algorithm with fifth order derivatives, Mathematical and Computational Applications, 13(2), 123-128, 2008. 
[18] M. Pakdemirli and  I. T. Dolapci, Functional root algorithms for transcendental equations, Applied and Computational Mathematics, 23(1), 99-109, 2024. 
[19] 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, 1996, 2021. 
[20] H. Susanto and N. Karjanto, Newton’s methods’ basins of attraction revisited, Applied Mathematics and Computation, 215, 1084-1090, 2009. 
[21] M. Shams, N. Rafiq, N. Kausar, P. Agarwal, N. A. Mir, and Y. M. Li, On highly efficient simultaneous schemes for finding all polynomial roots, Fractals, 30(10), p.2240198, 2022. 
[22] M. Shams, N. Rafiq, N. Kausar, P. Agarwal, C. Park and N. A. Mir, On iterative techniques for estimating all roots of nonlinear equation and its system with application in differential equation, Advances in Difference Equations, 2021, 1-18, 2021. 
[23] M. Shams, N. Kausar, P. Agarwal, S. Jain, M. A. Salman and M. A. Shah, M.A., On family of the Caputo-type fractional numerical scheme for solving polynomial equations, Applied Mathematics in Science and Engineering, 31(1), p.2181959, 2023. 
[24] M. Shams and B. Carpentieri, An efficient and stable caputo-type inverse fractional parallel scheme for solving nonlinear equations, Axioms, 13(10), p.671, 2024. 
[25] C. L. Sabharwal, An iterative hybrid algorithm for roots of nonlinear equations, Engineering, 2, 80-98, 2021. 
[26] M. Türkyılmazo˘ glu, A simple algorithm for high order Newton iteration formula and some new variants, Hacettepe Journal of Mathematics and Statistics, 49(1), 425-438, 2020. 
[27] C. Vanhille, A note on the convergence of the irrational Halley’s iterative algorithm for solving nonlinear equations, International Journal of Computer Mathematics, 97(9), 1840-1848, 2020. 
[28] 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), 50-65, 2020. 
[29] Y. Wu and K. F. Cheung, Two parameter homotopy method for nonlinear equations, Numerical Algorithms, 53, 555-572, 2010.
Volume 6, Issue 3
Summer 2025
Pages 77-88

  • Receive Date 06 May 2024
  • Revise Date 09 July 2025
  • Accept Date 19 September 2025