Non-divergent circular arc root algorithm

• Published in: Mathematics and computational sciences Vol. 6; no. 3; pp. 77 - 88
• Main Author: Mehmet Pakdemirli
• Format: Journal Article
• Language: English
• Published: Qom University of Technology 01.09.2025
• Subjects: convergence rate; newton-raphson method; non-divergent algorithm; nonlinear equations; root finding algorithms
• ISSN: 2717-2708
• DOI: 10.30511/mcs.2025.2028349.1171

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.