A Novel Root-Finding Algorithm With Engineering Applications and its Dynamics via Computer Technology

Abstract

Root-finding of non-linear equations is one of the most appearing problems in engineering sciences. Most of the complicated engineering problems can be modeled easily by means of non-linear functions. The role of iterative algorithms via computers for solving such functions is much important and cannot be denied in the modern age. In an iterative algorithm, the convergence order and the computational cost per iteration are the main characteristics that depict its efficiency and performance i.e., a method with higher-order and lower computational cost will be more efficient and vice versa. Keeping these facts into consideration, the main goal of this paper is to introduce a new derivative-free iterative method that performs better. We develop this algorithm by utilizing the forward- and finite-difference schemes on well-known Househölder’s method, resulting in an efficient and derivative-free algorithm with a low per iteration computing cost. We also look at the developed algorithm’s convergence criterion and show that it is quartic-order convergent. We investigate nine test-examples and solve them to demonstrate its correctness, validity, and efficiency numerically. Some real-world engineering problems in civil and chemical engineering are also included in these examples. The numerical results of the test-examples reveal that the newly constructed method outperforms the existing similar algorithms found in the literature. We consider various different-degrees complex polynomials for the graphical analysis and used a computer tool to create the polynomiographs of the proposed quartic-order algorithm and compare it to other comparable existing approaches. The graphical findings show that the developed method has a faster convergence speed than the other comparable algorithms.