A New Root-Finding Algorithm for Solving Real-World Problems and Its Complex Dynamics via Computer Technology

Naseem, Amir; Rehman, M. A.; Younis, Jihad

doi:https://doi.org/10.1155/2021/6369466

Complexity

On this page

Abstract Introduction Applications Data Availability Conflicts of Interest Authors’ Contributions References Copyright Related Articles

Research Article | Open Access

Volume 2021 | Article ID 6369466 | https://doi.org/10.1155/2021/6369466

A New Root-Finding Algorithm for Solving Real-World Problems and Its Complex Dynamics via Computer Technology

Amir Naseem,¹M. A. Rehman,¹and Jihad Younis²

Academic Editor: Maricel Agop

Received10 Sept 2021

Accepted18 Oct 2021

Published29 Nov 2021

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.

1. Introduction

The role of computers in the fields of applied mathematics cannot be denied in the modern age. Using different computer programs such as Mathematica, Matlab, and Maple, a plethora of different types of complex problems can be solved easily. In recent years, the mathematicians employed the excessive use of computers in different fields of mathematics. The most important among them is the polynomial’s root finding which has played a significant role in applied and computational mathematics and covers many other fields of modern sciences. There exist several problems in engineering which arise in the form of nonlinear equations. For solving such type of engineering problems, we need iterative algorithms because in most of the cases, analytical methods do not work. The well-known classical iterative algorithm was given by Newton [1] in the last of fifteenth century. In the modern age, the researchers improved the order and efficiency of the existing methods and introduced multistep algorithms. For more details, see [2–11] and the references cited therein. Usually, multistep algorithms possess greater convergence with higher computational cost due to the involvement of higher derivatives which is the downside of these algorithms. It is really a tough task to balance the computational cost and the convergence order because if we increase one of them, the other would be decreased.

In the last few years, the researchers modified the existing iteration schemes by employing different mathematical techniques and suggested a new variety of multistep iterative methods. In [12], the author introduced the predictor-corrector method given aswhich is quartic-order algorithm suggested by Traub (TM) for root finding of scalar nonlinear equations.

Noor et al. [13], in 2012, introduced an iterative algorithm of the form:which is known as Noor’s method (NRM) for root finding of scalar nonlinear equations.

In 2010, Zhanlav et al. [14] introduced a new three-step iterative algorithm given aswhich is quartic-order algorithm for root finding of scalar nonlinear equations known as Zhanlav’s method (ZM).

In the present research article, we introduced a new fourth order and derivative-free algorithm for solving engineering and arbitrary problems in the form of scalar nonlinear functions. The construction of this algorithm is based upon the forward- and finite-difference schemes on Golbabai–Javidi’s method. We also certified that the designed algorithm has fourth-order convergence and then applied to different real-world engineering and arbitrary problems to demonstrate its applicability among the other fourth-order algorithms in the literature. The dynamical comparison of the designed algorithm with the other comparable ones has been also presented via computer technology using the program Mathematica 12.0.

The rest of the paper is divided as follows. An efficient and derivative-free algorithm has been constructed in Section 2. The convergence criterion of the designed algorithm has been discussed in Section 3. In Section 4, nine arbitrary and engineering problems have been solved. The graphical analysis of the designed algorithm has been presented in Section 5. Finally, the conclusion of the paper is given in Section 6.

2. Main Results

Let , be a function in one variable; then, by employing the modified homotopy perturbation method, Golbabai and Javidi [15] introduced the following root-finding algorithm:which is known as Golbabai–Javidi’s method of cubic convergence [15]. In [16], the authors modified it and suggested a two-step iteration scheme of the following form:which is a two-step iteration scheme for calculating zeros of nonlinear scalar equations. The major drawback of the above algorithm is its high computational cost per iteration as it requires first and second derivatives for its execution. To lower its computational cost and make it more effective, we approximate its derivatives and make it derivative-free so that it can be easily applied on those nonlinear functions whose first derivative becomes infinite or does not exist. To approximate , we employ the finite-difference approximation as

Now, we apply the forward-difference scheme to approximate first derivatives as follows:

Using (7) and (8) in (9),

Using (7)–(9) in (5), we are able to write Algorithm 1.

Algorithm 1. For a given initial guess , determine the approximate solution by the following iteration schemes:which is a novel derivative-free two-step iterative algorithm for calculating approximate zeros of nonlinear functions in one variable. The basic and important feature of the presented algorithm is its applicability area because it also covers such nonlinear functions in which first and second derivatives do not exist. The replacements of the first and second derivatives reduce its computational cost per iteration which yield higher efficiency index against the other similar iteration schemes. The obtained numerical results of test examples show better performance of the proposed algorithm against the other comparable ones in literature.

3. Convergence Analysis

In the present section, we proved the convergence order of the proposed method, i.e., Algorithm 1.

Theorem 1. Suppose be the simple zero of , where is sufficiently smooth near the exact root ; then, Algorithm 1 possesses quartic-order convergence. Moreover, it satisfies the following error equation:where .

Proof. To prove the theorem, suppose as the error at th iteration; then, and the Taylor series about implies whereUsing (13) and (14), we obtainUsing equations (13)–(18) in Algorithm 1, we get the following equality:which implies thatThe above equation established that Algorithm 1 is of quartic-order convergence.

4. Numerical Comparisons and Applications

In this section, we include five arbitrary and four engineering problems to demonstrate the validity, accuracy, and robust performance of the newly designed iteration scheme. We compare the suggested algorithm with Noor’s method [13], Traub’s method [12], and Zhanlav’s method (ZM) [14] by considering some nonlinear problems.

Example 1. Blood rheology model.
Blood rheology is a branch of science that works to study the physical and flow properties of the blood [17]. Blood is actually a non-Newtonian fluid and treated as Caisson Fluid. The model of Caisson fluid shows that the flow of simple fluids in a tube is such a way that the center core of the fluids will move as a plug with little deformation and velocity gradient occurs near the wall. To study the plug flow of Caisson fluids flow, we consider the following function in the form of nonlinear equation aswhere flow-rate reduction is computed by . Using in (16), we haveTo solve , the initial guess has been chosen as for starting the iteration process, and the results are given in Table 1.

Example 2. Finding volume from van der Waal’s equation.
In engineering, the famous and well-known van der Waal’s equation is used to examine gases behaviors [18] which was introduced by van der Waal:By assuming feasible values of the appearing parameters in (23), we obtain the following nonlinear problem:where denotes the volume and may be found easily by solving . Since is a polynomial with cubic degree, so clearly three roots exist and the only one among them is feasible positive real root 1.9298462428 as the volume of the gas is always positive. To start the iteration process, we take , and the results are inserted in Table 2.

Example 3. Open channel flow problem.
The flowing water in the open channel with the condition of uniform flow is described in the well-known Manning’s equation [19]:The parameters , , and in (25) denote hydraulic radius, slope, and area of the channel, respectively, and is Manning’s roughness coefficient. For a rectangular-shaped channel with depth and width , we haveUsing these values in (25), we obtainFor determining the depth of water, the above relation may be written asWe assign the values to the parameters as , , , and . We select the starting point to initialize the iteration process, and the results are inserted in Table 3.

Example 4. Plank’s radiation law.
For finding the energy density in the isothermal black body, Planck’s radiation law is used which was introduced by Planck [20] in 1914 having the following mathematical expression:To determine wavelength against the peak value of energy density , we convert equation (29) in nonlinear equation by considering , given as below:which can be converted into the form of nonlinear function as follows:The approximated root of denotes the highest wavelength of the radiation. We select as the initial guess in the iteration process, and the results are inserted in Table 4.

Example 5. Arbitrary problems.
To examine the numeric behavior of the designed algorithm, we take five arbitrary problems, and the results are inserted in Table 5.

In Tables 1–5, a detailed comparison of well-known iterative algorithms with the suggested algorithm has been presented. The columns of the tables give us details about the quantity of consumed iterations, the final approximated root, the absolute value of the function at that root, and the positive difference between the two consecutive approximations.

The obtained results of the test examples which are summarized in the form of Tables 1–5 show the performance of the proposed algorithm, and from these results, and we can claim the robust performance of the designed algorithm in terms of accuracy, speed, number of iterations, computational cost and can say that it is superior to the other comparable algorithms.

5. Complex Dynamics

In this section, we study the complex dynamics of the suggested root-finding algorithm for different complex polynomials in the form of polynomiographs which are generated in the process of polynomiography. The term polynomiography was first introduced in 2005 by Bahman Kalantari [21, 22] who defined it as a process of drawing aesthetically pleasing graphical objects by employing the mathematical convergence properties of iteration functions. By an iteration function, we mean such a function that is composed onto itself again and again such as Newton’s algorithm [23], Halley’s algorithm [24], and Householder’s algorithm [25]. As a result of polynomiography, the generated graphical objects are known as polynomiographs. To plot the polynomiographs on the complex plane via computer program by considering different complex polynomials, we take a rectangle of size , with the accuracy and maximum number of iterations . This rectangle contains the roots of the considered polynomial, and corresponding to the starting point in , we initialize the iteration process and assign a color to the point corresponding to . The black color is assigned to those particular points at which the algorithm fails to converge. The quality and resolution of the generated graphical objects are depended on the discretization of , i.e., if we discretize into the grid of , the plotted polynomiographs will have better resolution and image quality.

We know that if is an th-degree polynomial, then it must possess th number of zeros according to the theorem of algebra and may be expressed as

If are the roots (zeros) of , then (33) may be rewritten aswhere are the complex coefficients.

Any algorithm that involves iteration process may be applied to both above-described expressions of for plotting graphical objects. The general algorithm for plotting polynomiographs is given in Algorithm 2.

	Input: is a complex polynomial, is area in which polynomiographs are drawn, L is upper bound of iterations, is iterative scheme, is accuracy for the stopping criterion, colormap is colormap with C colors.
	Output: polynomiograph in the area in for the complex polynomial .
	fordo

	Whiledo

	ifthen
	break

	color via colormap.

We consider an algorithm to be converged if the convergence test returns TRUE and diverged if it returns False in Algorithm 1. The standard test for studying the convergence or divergence of an algorithm is given aswhere is the accuracy and and are the two consecutive estimations in the iteration process. In this study, we also consider equation (20) as a stopping criterion. A variety of different color graphical objects can be plotted by changing the parameters and and the iteration scheme. For further details about polynomiography and its applications, see [26–38] and the references therein.

We take the following four different complex polynomials for plotting graphical objects in the complex plane:

For coloring the iterations, we employ the colormap given in Figure 1.

Example 6. Polynomiographs for through various iteration schemes.
In the first example, we investigate and compare the dynamical results obtained through different iteration schemes with the newly designed quartic-order algorithm for the quadratic-degree polynomial which possesses two distinct zeros: 1 and . We executed all comparable algorithms to achieve the simple roots, and the results can be visualized in Figure 2.

(a)

(b)

(c)

(d)

Example 7. Polynomiographs for through various iteration schemes.
In the second example, we investigate and compare the dynamical results obtained through different iteration schemes with the newly designed quartic-order algorithm for the cubic-degree polynomial which possesses three distinct zeros: 1, , and . We executed all comparable algorithms to achieve the simple roots, and the results can be visualized in Figure 3.

(a)

(b)

(c)

(d)

Example 8. Polynomiographs for through various iteration schemes.
In the third example, we consider quartic-degree polynomial , having roots 1, , , and . We drew the aesthetically pleasing graphical objects by executing all comparable algorithms, and the results can be visualized in Figure 4.
In Examples 6–8, we ran all the comparable algorithms for drawing the aesthetically pleasing polynomiographs with the help of a computer program Mathematica 12.0. From the obtained graphical objects, we can easily examine the graphical behavior and stability of different algorithms. It should be noted that the convergence region of the newly designed algorithm is much larger as compared to other ones. The colors’ shades exhibit the performance of that algorithm by which the polynomiograph is drawn. Two main characteristics can be revealed through these graphical objects which are the convergence speed and the dynamics of the considered iteration schemes by which these graphs have been generated. The first one can be depicted by analyzing the shades of colors of the image. The richness of the color in the graphical objects shows robust convergence with less iterations. The second property can be investigated by visualizing the variation of the colors of the drawn polynomiographs. The small variation’s regions indicate the low dynamic zones and the dynamics are high for the zones of large variation of colors. The black color in the presented graphical objects showing the divergence zone of the algorithm, i.e., the zone where the solution is not possible to obtain for given accuracy and number of iterations. The identical color zones represent the same number of iterations utilized by different iteration schemes for finding the solution up to given accuracy, and their graphical view to the contour lines on the map is similar.

(a)

(b)

(c)

(d)

6. Concluding Remarks

In the present study, a new efficient and derivative-free algorithm for computing roots of nonlinear equations has been developed by employing the forward- and finite-difference schemes on Golbabai–Javidi’s. The convergence analysis of the suggested algorithm has been discussed and established that the suggested algorithm possesses the quartic-order convergence. To demonstrate the robust performance and validity of the presented algorithm, we assumed some arbitrary and engineering problems, converted them in the form of nonlinear functions, and then solved. The numerical results, contained in Tables 1–5, showed that the newly designed algorithm is superior to the other comparable algorithms with respect to different numerical terms such as convergence speed, accuracy, and computational order of convergence. The robust working of the new algorithm can also be judged by observing the accuracy of successive approximations which is much better against the other comparable ones. To study the complex dynamic nature of the suggested algorithm, polynomiographs have been drawn for some complex polynomials by utilizing the computer program Mathematica 12.0. The obtained graphical objects are novel and aesthetically pleasing, revealing the better convergence speed and other graphical characteristics of the designed algorithm over the other comparable ones. Using the same idea of this study, one can obtain a new family of derivative-free algorithms for computing roots of nonlinear equations.

Data Availability

All data required for this paper are included within the article.

Conflicts of Interest

The authors do not have any conflicts of interest.

Authors’ Contributions

All authors contribute equally in this paper.

References

D. E. Kincaid and E. W. Cheney, Numerical Analysis, Brooks/Cole Publishing Company, Pacific Grove, CA, USA, 1990.
S. Abbasbandy, “Improving Newton-Raphson method for nonlinear equations by modified Adomian decomposition method,” Applied Mathematics and Computation, vol. 145, no. 2-3, pp. 887–893, 2003.
View at: Publisher Site | Google Scholar
A. R. Alharbi, M. I. Faisal, F. A. Shah, M. Waseem, R. Ullah, and S. Sherbaz, “Higher order numerical approaches for nonlinear equations by decomposition technique,” IEEE Access, vol. 7, pp. 44329–44337, 2019.
View at: Publisher Site | Google Scholar
R. Behl and E. Martínez, “A new high-order and efficient family of iterative techniques for nonlinear models,” Complexity, vol. 2020, Article ID 1706841, 11 pages, 2020.
View at: Publisher Site | Google Scholar
D. Cebic, M. Paunovic, and N. M. Ralevic, “A variant of sharma-arora's optimal eighth-order family of methods for finding A simple root of nonlinear equation,” in Proceedings of the IEEE 16th International Symposium on Intelligent Systems and Informatics (SISY), Subotica, Serbia, September 2018.
View at: Publisher Site | Google Scholar
A. Naseem, M. A. Rehman, and T. Abdeljawad, “Higher-order root-finding algorithms and their basins of attraction,” Jurnal Matematika, vol. 2020, Article ID 5070363, 11 pages, 2020.
View at: Publisher Site | Google Scholar
M. A. Rehman, A. Naseem, and T. Abdeljawad, “Some novel sixth-order iteration schemes for computing zeros of nonlinear scalar equations and their applications in engineering,” Journal of Function Spaces, vol. 2021, Article ID 5566379, 11 pages, 2021.
View at: Publisher Site | Google Scholar
A. Naseem, M. A. Rehman, T. Abdeljawad, and Y.-M. Chu, “Novel iteration schemes for computing zeros of non-linear equations with engineering applications and their dynamics,” IEEE Access, vol. 9, pp. 92246–92262, 2021.
View at: Publisher Site | Google Scholar
A. Naseem, M. A. Rehman, and T. Abdeljawad, “Numerical algorithms for finding zeros of nonlinear equations and their dynamical aspects,” Jurnal Matematika, vol. 2020, Article ID 2816843, 11 pages, 2020.
View at: Publisher Site | Google Scholar
M. S. Rhee, Y. I. Kim, and B. Neta, “An optimal eighth-order class of three-step weighted Newton's methods and their dynamics behind the purely imaginary extraneous fixed points,” International Journal of Computer Mathematics, vol. 95, no. 11, pp. 2174–2211, 2018.
View at: Publisher Site | Google Scholar
F. Soleimani, F. Soleymani, and S. Shateyi, “Some iterative methods free from derivatives and their basins of attraction for nonlinear equations,” Discrete Dynamics in Nature and Society, vol. 2013, Article ID 301718, 10 pages, 2013.
View at: Publisher Site | Google Scholar
J. F. Traub, Iterative Methods for the Solution of Equations, Chelsea Publishing company, New York, NY, USA, 1982.
M. A. Noor, K. I. Noor, and K. Aftab, “Some new iterative methods for solving nonlinear equations,” World Applied Sciences Journal, vol. 20, no. 6, 2012.
View at: Google Scholar
T. Zhanlav, O. Chuluunbaatar, and G. Ankhbayar, “On Newton-type methods with fourth and fifth-order convergence,” Discrete and Continuous Models and Applied Computational Science, vol. 2, no. 2, pp. 30–35, 2010.
View at: Google Scholar
A. Golbabai and M. Javidi, “A third-order Newton type method for nonlinear equations based on modified homotopy perturbation method,” Applied Mathematics and Computation, vol. 191, no. 1, pp. 199–205, 2007.
View at: Publisher Site | Google Scholar
S. M. Kang, A. Naseem, W. Nazeer, M. Munir, and C. Y. Jung, “Polynomiography of some iterative methods,” International Journal of Mathematical Analysis, vol. 11, no. 3, pp. 133–149, 2017.
View at: Publisher Site | Google Scholar
R. L. Fournier, Basic Transport Phenomena in Biomedical Engineering, Taylor & Francis, New York, NY, USA, 2007.
V. D. Waals and J. Diderik, Over de Continuiteit van den Gas- en Vloeistoftoestand (on the continuity of the gas and liquid state, University of Illinois, Leiden, The Netherlands, 1873, Ph.D. thesis.
R. Manning, “On the flow of water in open channels and pipes,” Transactions of the Institution of Civil Engineers of Ireland, vol. 20, pp. 161–207, 1891.
View at: Google Scholar
M. Planck, The Theory of Heat Radiation, P. Blakiston’s Son & Co., New York, NY, USA, 2nd edition, 1914.
B. Kalantari, 2005, Method of Creating Graphical Works Based on Polynomials.
B. Kalantari, “Polynomiography: from the fundamental theorem of Algebra to art,” Leonardo, vol. 38, no. 3, pp. 233–238, 2005.
View at: Publisher Site | Google Scholar
R. L. Burden and J. D. Faires, Numerical Analysis, Brooks/Cole Publishing Company, Pacific Grove, CA, USA, Sixth edition, 1997.
I. K. Argyros, “A note on the Halley method in Banach spaces,” Applied Mathematics and Computation, vol. 58, pp. 215–224, 1993.
View at: Google Scholar
A. S. Householder, The Numerical Treatment of a Single Nonlinear Equation, McGraw-Hill, New York, NY, USA, 1970.
K. Gdawiec, “Fractal patterns from the dynamics of combined polynomial root finding methods,” Nonlinear Dynamics, vol. 90, no. 4, pp. 2457–2479, 2017.
View at: Publisher Site | Google Scholar
K. Gdawiec, W. Kotarski, and A. Lisowska, “Visual analysis of the Newton's method with fractional order derivatives,” Symmetry, vol. 11, no. 9, p. 1143, 2019.
View at: Publisher Site | Google Scholar
I. Gosciniak and K. Gdawiec, “Visual analysis of dynamics behaviour of an iterative method depending on selected parameters and modifications,” Entropy, vol. 22, p. 734, 2020.
View at: Google Scholar
B. Kalantari, “An invitation to polynomiography via exponential series,” 2017, https://arxiv.org/abs/1707.09417.
View at: Google Scholar
B. Kalantari and E. H. Lee, “Newton-Ellipsoid polynomiography,” Journal of Mathematics and the Arts, vol. 13, no. 4, pp. 336–352, 2019.
View at: Publisher Site | Google Scholar
W. Kotarski, K. Gdawiec, and A. Lisowska, “Polynomiography via ishikawa and mann iterations,” Advances in Visual Computing, vol. 7431, pp. 305–313, 2012.
View at: Publisher Site | Google Scholar
Y. C. Kwun, M. Tanveer, W. Nazeer, K. Gdawiec, and S. M. Kang, “Mandelbrot and julia sets via jungck-CR iteration with $s$ -convexity,” IEEE Access, vol. 7, pp. 12167–12176, 2019.
View at: Publisher Site | Google Scholar
A. Naseem, M. A. Rehman, and T. Abdeljawad, “Computational methods for non-linear equations with some real-world applications and their graphical analysis,” Intelligent Automation & Soft Computing, vol. 30, no. 3, pp. 805–819, 2021.
View at: Publisher Site | Google Scholar
A. Naseem, M. A. Rehman, and T. Abdeljawad, “Numerical methods with engineering applications and their visual analysis via polynomiography,” IEEE Access, vol. 9, pp. 99287–99298, 2021.
View at: Publisher Site | Google Scholar
A. Naseem, M. A. Rehman, T. Abdeljawad, and Y.-M. Chu, “Some engineering applications of newly constructed algorithms for one-dimensional non-linear equations and their fractal behavior,” Journal of King Saud University Science, vol. 33, no. 5, p. 101457, 2021.
View at: Publisher Site | Google Scholar
A. Naseem, M. A. Rehman, and T. Abdeljawad, “Some new iterative algorithms for solving one-dimensional non-linear equations and their graphical representation,” IEEE Access, vol. 9, pp. 8615–8624, 2021.
View at: Publisher Site | Google Scholar
M. Scott, B. Neta, and C. Chun, “Basin attractors for various methods,” Applied Mathematics and Computation, vol. 218, no. 6, pp. 2584–2599, 2011.
View at: Publisher Site | Google Scholar
J. R. Sharma and H. Arora, “A new family of optimal eighth order methods with dynamics for nonlinear equations,” Applied Mathematics and Computation, vol. 273, pp. 924–933, 2016.
View at: Publisher Site | Google Scholar

Copyright

Copyright © 2021 Amir Naseem et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

PDF Download Citation

Download other formats

Order printed copies

Views

1280

Downloads

894

Citations