A New Root-Finding Algorithm for Solving Real-World Problems and Its Complex Dynamics via Computer Technology. (29th November 2021)

• Record Type: Journal Article
• Authors: Naseem, Amir; Rehman, M. A.; Younis, Jihad
• Other Names: Agop Maricel Academic Editor.
• Is Part Of: Complexity. Volume 2021(2021)
• Publication Date: 2021-11-29
• Subjects: Chaotic behavior in systems -- Periodicals; Complexity (Philosophy) -- Periodicals; 003
• DOI: 10.1155/2021/6369466
• Languages: English
• ISSNs: 1076-2787

Abstract

Abstract : Nowadays, the use of computers is becoming very important in various fields of mathematics and engineering sciences. Many complex statistics can be sorted out easily with the help of different computer programs in seconds, especially in computational and applied Mathematics. With the help of different computer tools and languages, a variety of iterative algorithms can be operated in computers for solving different nonlinear problems. The most important factor of an iterative algorithm is its efficiency that relies upon the convergence rate and computational cost per iteration. Taking these facts into account, this article aims to design a new iterative algorithm that is derivative-free and performs better. We construct this algorithm by applying the forward- and finite-difference schemes on Golbabai–Javidi's method which yields us an efficient and derivative-free algorithm whose computational cost is low as per iteration. We also study the convergence criterion of the designed algorithm and prove its quartic-order convergence. To analyze it numerically, we consider nine different types of numerical test examples and solve them for demonstrating its accuracy, validity, and applicability. The considered problems also involve some real-life applications of civil and chemical engineering. The obtained numerical results of the test examples show that the newly designed algorithm is working better against the other similar algorithms in the literature. For the graphical analysis, we consider some different degrees' complex polynomials and draw the polynomiographs of the designed quartic-order algorithm and compare it with the other similar existing methods with the help of a computer program. The graphical results reveal the better convergence speed and the other graphical characteristics of the designed algorithm over the other comparable ones.