# Efficacy of Optimal Methods for Nonlinear Equations with Chemical Engineering Applications

Authors: Obadah Said Solaiman; Ishak Hashim
Journal: Mathematical Problems in Engineering
 (2019)

---

## Abstract

In this study, we propose a modified predictor-corrector Newton-Halley (MPCNH) method for solving nonlinear equations. The proposed sixteenth-order MPCNH is free of second derivatives and has a high efficiency index. The convergence analysis of the modified method is discussed. Different problems were tested to demonstrate the applicability of the proposed method. Some are real life problems such as a chemical equilibrium problem (conversion in a chemical reactor), azeotropic point of a binary solution, and volume from van der Waals equation. Several comparisons with other optimal and nonoptimal iterative techniques of equal order are presented to show the efficiency of the modified method and to clarify the question, are the optimal methods always good for solving nonlinear equations?


---

## Body

## 1. Introduction

Searching out a solution ofg(z)=0, when g(z) is nonlinear, is highly significant in mathematics; because many equations of that type are common in applied sciences and real life problems. Newton’s iterative technique for solving such equations is defined as(1)zn+1=z-gzng′zn,which has second-order of convergence [1]. Many researchers have improved the method of Newton to attain better results and to increase the convergence order; for instance, see [2–4] and the references therein. One of the most famous improvements of Newton’s scheme is the technique of order three given in [5]:(2)zn+1=zn-2gzng′zn2g′zn2-gzng′′zn,and another well-known improvement of Newton’s technique is the third-order iterative method proposed by Householder [6]:(3)zn+1=zn-gzng′zn-gzn2g′′zn2g′zn3.Recently, many researchers applied the technique of updating the solution to improve the convergence order of the iterative schemes. In this technique, firstly suggested by Traub [1], the composition of two iterative schemes of orders m and n can yield a new scheme of order mn. Traub showed that the two-step Newton technique has an order of convergence equal to four. In the same manner and by making a combination of three methods, i.e., Newton, Halley, and Householder, Bahgat and Hafiz [7] presented a three-step iterative method which is of eighteenth-order of convergence; they call their method the predictor-corrector Newton-Halley (PCNH) method. Many examples on iterative methods created using the same technique can be found in [8–11] and the references therein.Besides, one of the most common ways to compare the power of iterative methods is the efficiency index which can be determined byq1/r, where q is the convergence order of the iterative scheme and r represents the number of functional evaluations at each iteration. For example, the PCNH mentioned above has an efficiency index equal to (18)1/8≈1.435. There are some problems that can occur when the technique of updating solution is applied. The main problem is that the number of functional evaluations in each iteration will increase, and consequently the efficiency index will decrease. The second problem which is usually faced is due to the appearance of the second derivative in the numerical scheme. Kung and Traub [8] conjectured that the iterative scheme with the number of functional evaluations equal to r is optimal if its order of convergence equals 2r-1. Many authors have proposed optimal iterative methods of different orders. The default way for constructing optimal method is the composition technique together with the usage of some interpolations and approximations to minimize the number of functional evaluations. Several optimal fourth-order iterative methods were constructed; see, for example, [9–11]. The optimal eighth-order of convergence was reached by many authors as presented in [12–14]. Also, many sixteenth-order iterative methods were proposed; for instance, see [15–17].As we mentioned above, usually, to obtain optimal methods to reduce the functional evaluations at each iteration, researchers use different approximations and interpolations. This process can bring a disadvantage; that is, even if the number of functional evaluations is reduced to the minimum, the number of algebraic operations will be increased. We shall find the answers to the following questions:(i)
Are optimal iterative techniques always the best for solving nonlinear equations?(ii)
Is it important to minimize the number of function evaluations at each iteration to make the area of convergence of the iterative scheme larger?(iii)
Do nonoptimal methods always take longer computational time?(iv)
Do optimal methods with equal orders have the same behavior in their dynamics?We shall in this study answer the above questions by constructing a very simple nonoptimal method of order sixteen using some modifications of PCNH. The work is arranged as follows: The derivation of the modified method is carried out in Section2. The convergence analysis of the proposed method is discussed in Section 3. Different comparisons with other optimal schemes of equal order are given in Section 4. Comparison using the basins of attraction (dynamics) of the proposed technique and other techniques of equal order is shown in Section 5. Eventually, in Section 6, the conclusion is illustrated.


## 2. Modified Predictor-Corrector Newton-Halley (MPCNH) Method

Letg(z)=0 be an equation such that g(z) is a nonlinear function defined on some open interval A and sufficiently differentiable. Let α∈A be a simple root of g(z), and consider z0 as an initial guess which is sufficiently close to α. Using the technique of updating the solution, that is, using Newton’s scheme (1) as a predictor, and both Halley’s scheme (2) and Householder’s scheme (3) as a corrector, Bahgat and Hafiz [7] proposed the following three-step iterative method:(4)wn=zn-gzng′zn,yn=wn-2gwng′wn2g′wn2-gwng′′wn,zn+1=yn-gyng′yn-gyn2g′′yn2g′yn3.Scheme (4) is called the predictor-corrector Newton-Halley (PCNH) method. Bahgat and Hafiz [7] proved that this iterative technique is of eighteenth-order of convergence. Per iteration, PCNH needs the evaluation of three functions, three first derivatives, and two second derivatives. Therefore, the efficiency index of this scheme is equal to (18)1/8≈1.435. This index is better than 21/2≈1.414 for Newton’s method, but worse than that of the classical Halley and Householder methods, which is 31/3≈1.442.In order to make the efficiency index of PCNH better, we approximate the second derivatives (g′′(wn) and g′′(yn)) using Hermite’s interpolating polynomial of order three. To do that, let R1(t)=c1+c2(t-wn)+c3(t-wn)2+c4(t-wn)3, where c1,c2,c3, and c4 can be found from the following conditions: (5)gzn=R1zn,gwn=R1wn,g′zn=R1′zn,g′wn=R1′wn,g′′wn=R1′′wn.By solving the system of linear equations resulting from the above conditions, and after substituting the obtained coefficients, one can write R1(zn,wn) as(6)R1zn,wn=2zn-wn3gzn-gwnzn-wn-2g′wn-g′zn≈g′′wn.In the same manner, we can obtain an approximation for g′′(yn):(7)R2wn,yn=2wn-yn3gwn-gynwn-yn-2g′yn-g′wn≈g′′yn.After substituting (6) and (7) into (4), we have the new modified scheme (MPCNH)(8)wn=zn-gzng′zn,yn=wn-2gwng′wn2g′wn2-gwnR1zn,wn,zn+1=yn-gyng′yn-gyn2R2wn,yn2g′yn3.This method has sixteenth-order of convergence which will be shown in the next section. At each iteration, MPCNH needs the evaluation of three functions and three first derivatives. Therefore, the proposed scheme has efficiency index (16)1/6≈1.587, which is better than PCNH and both Halley’s and Householder’s methods. Another advantage of this modified method is that it is second derivative free scheme. Note that this modified method is not optimal since it does not satisfy Kung-Traub conjecture.


## 3. Convergence Analysis

Now, we consider the convergence analysis of MPCNH.Theorem 1.
Letα∈A be a simple zero of the function g:A⊆R→R, where g(x) is sufficiently differentiable in an open interval A. Let z0 be an initial guess close enough to the zero α; then MPCNH technique is at least of sixteenth-order of convergence.Proof.
Letα be a zero of g(z), and let en=zn-α be the error at the nth iteration. Using the Taylor series about z=α, we get(9)gzn=g′αen+c2en2+c3en3+c4en4+⋯,where ck=1/k!g(k)(α)/g′(α), k=2,3,…. From (9) one obtains(10)g′zn=g′α1+2c2en+3c3en2+4c4en3+⋯.From (9) and (10) we have(11)gxng′xn=en-c2en2-2c3-2c22en3-3c4-7c2c3+4c23en4+⋯.Using (11) we can write wn in (8) as(12)wn=α+c2en2+2c3-2c22en3+3c4-7c2c3+4c23en4+⋯.Expanding g(wn) and g′(wn) about α and using (12), we get(13)gwn=gα+g′αwn-α+g′′αwn-α22+g′′′αwn-α36+⋯=g′αc2en2+2c3-2c22en3+5c23-7c2c3+3c4en4+⋯,(14)g′wn=g′α+g′′αwn-α+g′′′αwn-α22+g4αwn-α36+⋯=g′α1+2c2en2+4c2c3-c23en3+8c24-11c22c3+6c2c4en4+⋯.Also we have(15)R1zn,wn=2zn-wn3gzn-gwnzn-wn-2g′wn-g′zn=g′α2c2+23c2c3-c4en2-43c22c3-3c32-c2c4+c5en3+⋯.Substituting (13)–(15) into yn in (8), we obtain(16)yn=α+c22c23-c2c3+c4en6+Oen7.Expanding g(yn) and g′(yn) about α and using (16), we have(17)gyn=g′αc25-c23c3+c22c4en6+-6c26+12c24c3-6c23c4+4c2c3c4-6c22c32+2c22c5en7+⋯.(18)g′yn=g′α1+2c26-2c24c3+2c23c4en6+⋯(19)gyng′yn=c25-c23c3+c22c4en6+-6c26+12c24c3-6c23c4+4c2c3c4-6c22c32+2c22c5en7+⋯.Also we have(20)R2wn,yn=2wn-yn3gwn-gynwn-yn-2g′yn-g′wn=2c2-2c22c4en4+⋯.Substituting (16)–(20) in zn+1 in (8), we get(21)zn+1=α+c26c4c23-c2c3+c42en16+Oen17,which implies that(22)en+1=c26c4c23-c2c3+c42en16+Oen17.Hence, MPCNH technique is of at least sixteenth-order of convergence.


## 4. Test Problems and Comparisons

In this section we test the presented technique by applying it on some real life problems resulting from chemical engineering (Examples1–4) and other seven arbitrary nonlinear functions (Example 5). Also, we show using different comparisons that optimal methods are not always good for nonlinear equations. For this, we compare the proposed MPCNH method with other five iterative methods of order sixteen; one of them is nonoptimal and the remaining four are optimal. The methods used in the comparison with their abbreviations are the nonoptimal LMMW method of [18], optimal SSSL1 method of [15], optimal GK method of [16], optimal SAK method of [17], and optimal SK method of [19].We select two convergence conditions for computer programs. The first stopping criterion iszn-zn-1<10-30, while the second stopping criterion is zn-zn-1+g(zn)<10-200. All calculations have been performed under the same conditions on Intel Core i3-2330M CPU @2.20 GHz with 4GB RAM, with Microsoft Windows 10, 64 bit, X64-based processor. The software used is Mathematica 9 with 10000 significant digits. Now, consider the following examples.Example 1 (a chemical equilibrium problem).
Consider the equation from [20] describing the fraction of the nitrogen-hydrogen feed that gets converted to ammonia (this fraction is called fractional conversion). Also, consider that we have pressure of 250 atm and temperature of 500∘C; the original problem consists of solving the equation(23)g1z=84-z2z26-3z22-z-0.186 which can be reduced in polynomial form as(24)g1z=z4-7.79075z3+14.7445z2+2.511z-1.674and the four roots of this function are z1=0.27776,z2=-0.384094,z3=3.94854+0.316124i and z4=3.94854-0.316124i. By definition, the factional conversion must be between 0 and 1. Therefore, only the first real root z1=0.27776 is acceptable and physically meaningful. We started by z0=0.5 as an initial guess.Example 2 (azeotropic point of a binary solution).
Consider the problem obtained by [21] to determine the azeotropic point of a binary solution:(25)g2z=ABB1-z2-Az2zA-B+B2+0.14845where A and B are coefficients in the van Laar equation which describes phase equilibria of liquid solutions. Consider for this problem that A=0.38969 and B=0.55954. The root of this equation is z=0.6914737357. We considered initial approximation z0=1.Example 3 (conversion in a chemical reactor).
In this example from [22], the following nonlinear equation is to be solved:(26)g3z=z1-z-5ln⁡0.41-z0.4-0.5z+4.45977where x in this equation is the fractional conversion of species, for example, A, in a chemical reactor. Therefore, z should be bounded between 0 and 1. The solution of this equation is z=0.7573962463. As an initial solution, we selected z0=0.6.Example 4 (volume from van der Waals equation).
Van der Waals’ equation is given by(27)p+n2aV2V-nb=nRTwhere p,V,T,n are the pressure, volume, temperature in Kelvin, and number of moles of the gas. R is the gas constant equal to 0.0820578. Finally, a and b are called van der Waals constants and they depend on the gas type. It is clear that the above equation is nonlinear in V. It can be reduced to the following function of V(28)gV=pV3-nRT+bpV2+n2aV-n3ab.For instance, if one has to find the volume of 1.4 moles of benzene vapor under pressure of 40 atm and temperature of 500°C, given that van der Waals constants for benzene are a=18 and b=0.1154, then the problem arising is to find roots of this polynomial.(29)g4z=40z3-95.26535116z2+35.28z-5.6998368The above equation has three roots which are one real z=1.97078 and two complex roots z=0.205425±0.173507i. As V is a volume, only the positive real roots are physically meaningful, that is, the first root. We considered the initial approximation z0=2 for this problem.Example 5.
To study the proposed method on transcendental equations, consider the following seven test examples:(30)g5z=z2-ez-3z+2,g6z=z3-10,g7z=z-13-1,g8z=sin2z-z2+1,g9z=cos⁡z-z,g10z=z-sin2z+3cos⁡z+5,g11z=zln⁡1+zsin⁡z+ezcos⁡z+z2-1sin⁡πz.Tables1–5 illustrate the comparisons between the iterative methods for Examples 1–5, respectively, where n indicates the number of iterations such that the first stopping criterion is achieved, zn is the approximate root, zn-zn-1 is the absolute difference between two successive approximations of the root such that zn-zn-1<10-30, g(zn) is the value of the approximate root, the approximated computational order of convergence (ACOC) given in [23], which can be estimated as(31)ACOC≈ln⁡zn+1-zn/zn-zn-1ln⁡zn-zn-1/zn-1-zn-2, and, finally, CPU time is the time in seconds required to satisfy the stopping criterion using the built in function “TimeUsed” in “Mathematica 9” software. From Tables 1–5, we can see clearly that the approximate solutions obtained by MPCNH are more accurate than the estimations obtained by the other five methods. It is also clear that MPCNH needs fewer or equal number of iterations to meet the stopping criterion when compared to the other techniques. In addition, MPCNH needs less CPU time than the other methods to achieve the convergence criterion even if they need the same number of iterations. Also note that MPCNH has ACOC equal to 18 for both g6(z) and g7(z) while the other methods have ACOC equal to 16.Table 1
Comparisons between different methods on test functiong1(z).
Method n z n z n - z n - 1 g ( z n ) ACOC CPU Time g 1 ( z ) ,   z 0 = 0.5  LMMW 3 0.27775954284172066 4.59E-200 6.75E-3190 16 1.187 SSSL1 3 0.27775954284172066 5.80E-142 2.85E-2259 16 1.797 GK 3 0.27775954284172066 3.67E-147 4.62E-2340 16 1.735 SAK 3 0.27775954284172066 3.77E-180 3.47E-2869 16 3.329 SK 3 0.27775954284172066 4.63E-169 1.06E-2690 16 1.188 MPCNH 3 0.27775954284172066 7.03E-211 9.10E-3363 16 0.875Table 2
Comparisons between different methods on test functiong2(z).
Method n z n z n - z n - 1 g ( z n ) ACOC CPU Time g 2 ( z ) ,   z 0 = 1  LMMW 3 0.69147373574714142 5.36E-197 7.18E-3145 16 1.140 SSSL1 3 0.69147373574714142 4.27E-199 5.03E-3174 16 1.798 GK 3 0.69147373574714142 1.61E-154 1.16E-2462 16 1.876 SAK 3 0.69147373574714142 3.63E-279 1.44E-4464 16 4.625 SK 3 0.69147373574714142 7.20E-193 2.13E-3078 16 1.267 MPCNH 3 0.69147373574714142 6.45E-199 1.38E-3175 16 1.125Table 3
Comparisons between different methods on test functiong3(z).
Method n z n z n - z n - 1 g ( z n ) ACOC CPU Time g 3 ( z ) ,   z 0 = 0.6  LMMW 5 0.75739624625375388 8.18E-335 1.64E-5325 16 18.952 SSSL1 - diverge – – – – GK - diverge – – – – SAK 4 0.75739624625375388 5.41E-163 8.78E-2582 16 25.407 SK 5 1.0989839399194860 8.63E-153 9.71E-2416 16 7.843 MPCNH 5 0.75739624625375388 1.60E-207 2.68E-3289 16 9.000Table 4
Comparisons between different methods on test functiong4(z).
Method n z n z n - z n - 1 g ( z n ) ACOC CPU Time g 4 ( z ) ,   z 0 = 2  LMMW 3 1.9707842194070294 1.85E-438 1.39E-7004 16 0.859 SSSL1 3 1.9707842194070294 8.16E-351 2.91E-5596 16 1.4668 GK 3 1.9707842194070294 2.37E-393 2.95E-6280 16 1.218 SAK 3 1.9707842194070294 1.75E-401 4.82E-6411 16 2.766 SK 3 1.9707842194070294 4.20E-363 1.15E-5794 16 1.063 MPCNH 3 1.9707842194070294 1.02E-487 8.90E-8764 16 0.769Table 5
Comparisons between different methods on test functionsg5(z)–g11(z).
Method n z n z n - z n - 1 g ( z n ) ACOC CPU Time g 5 ( z ) ,   z 0 = 2  LMMW 3 0.2575302854398608 5.24E-70 5.28E-1120 16 3.156 SSSL1 3 0.2575302854398608 5.67E-71 7.99E-1133 16 8.609 GK 3 0.2575302854398608 5.61E-48 6.34E-766 16 8.484 SAK 3 0.2575302854398608 3.95E-91 2.11E-1457 16 7.594 SK 3 0.2575302854398608 1.74E-111 5.83E-1783 16 3.641 MPCNH 3 0.2575302854398608 2.10E-139 1.83E-2230 16 2.703  g 6 ( z ) ,   z 0 = 2  LMMW 3 2.1544346900318837 2.13E-322 1.05E-5153 16 1.016 SSSL1 3 2.1544346900318837 1.41E-191 6.07E-3055 16 0.938 GK 3 2.1544346900318837 7.99E-280 5.42E-4471 16 0.922 SAK 3 2.1544346900318837 1.01E-319 2.19E-4365 16 1.655 SK 3 2.1544346900318837 1.81E-268 2.24E-4287 16 0.891 MPCNH 3 2.1544346900318837 3.06E-370 8.26E-6657 18 0.641  g 7 ( z ) ,   z 0 = 2.5  LMMW 3 2 1.30E-224 8.13E-3585 16 0.672 SSSL1 3 2 2.88E-69 1.20E-1093 16 1 GK 3 2 8.27E-110 2.01E-1746 16 0.875 SAK 3 2 1.16E-134 5.64E-2145 16 1.688 SK 3 2 2.60E-101 1.53E-1608 16 0.797 MPCNH 3 2 3.64E-146 1.86E-2618 18 0.688  g 8 ( z ) ,   z 0 = 1  LMMW 3 1.4044916482153412 3.21E-113 4.83E-1806 16 5.703 SSSL1 - diverge – – – – GK 3 1.4044916482153412 2.99E-46 5.10E-732 16 12.094 SAK 3 1.4044916482153412 2.33E-137 1.79E-2189 16 13.937 SK 3 1.4044916482153412 3.59E-73 9.47E-1160 16 6.328 MPCNH 3 1.4044916482153412 7.34E-121 4.18E-1925 16 5.484  g 9 ( z ) ,   z 0 = 1.7  LMMW 3 0.73908513321516064 7.94E-198 2.95E-3163 16 4.594 SSSL1 3 0.73908513321516064 5.56E-143 3.89E-2283 16 11.75 GK 3 0.73908513321516064 3.94E-130 8.44E-2077 16 11.484 SAK 3 0.73908513321516064 3.55E-201 3.83E-3216 16 12.453 SK 3 0.73908513321516064 4.12E-191 7.95E-3054 16 5.172 MPCNH 3 0.73908513321516064 1.55E-248 2.00E-3975 16 3.937  g 10 ( z ) ,   z 0 = - 2  LMMW 4 - 1.2076478271309189 3.18E-160 5.60E-2549 16 17.36 SSSL1 4 - 1.2076478271309189 5.75E-132 1.89E-2092 16 49.406 GK – diverge – – – – SAK 3 - 1.2076478271309189 1.47E-61 2.38E-974 16 44.483 SK 4 - 1.2076478271309189 8.74E-317 1.37E-5053 16 19.984 MPCNH 4 - 1.2076478271309189 2.09E-322 4.92E-5144 16 15.781  g 11 ( z ) ,   z 0 = 0.5  LMMW 3 0 2.57E-138 8.37E-2203 16 13.39 SSSL1 3 0 1.30E-80 7.92E-1275 16 29.906 GK 3 0 2.60E-34 9.15E-537 16 34.328 SAK 3 0 2.63E-144 5.93E-2299 16 40.563 SK 3 0 1.74E-159 1.98E-2541 16 13.469 MPCNH 3 0 3.62E-152 4.85E-2424 16 13.327For the second convergence condition, we tested the seven functions given in Example5. It is shown in Table 6 that number of iterations needed to satisfy the stopping criterion zn-zn-1+g(zn)<10-200 is less than or equal to, for MPCNH, the other methods with noticeable difference in CPU time needed to satisfy this condition.Table 6
The number of iterations and CPU time (in parentheses) for the criteriong(zn)+zn-zn-1<10-200.
g 5 ( z ) g 6 ( z ) g 7 ( z ) g 8 ( z ) g 9 ( z ) g 10 ( z ) g 11 ( z ) z 0 = 2 z 0 = 2.5 z 0 = 2 z 0 = 1.7 z 0 = 1 z 0 = 3.5 z 0 = - 2 LMMW 4 ( 4.156 ) 3 ( 0.719 ) 3 ( 0.829 ) 4 ( 7.516 ) 4 ( 11.312 ) 5 ( 41.312 ) 4 ( 13.812 ) SSSL1 4 ( 12.328 ) 4 ( 1.203 ) 4 ( 1.032 ) Diverge 4 ( 15.859 ) 5 ( 57.469 ) 4 ( 31.485 ) GK 4 ( 11.405 ) 3 ( 1.000 ) 4 ( 1.063 ) 4 ( 16.516 ) 4 ( 15.516 ) Diverge 4 ( 37.047 ) SAK 4 ( 15.876 ) 3 ( 1.547 ) 4 ( 1.844 ) 4 ( 16.531 ) 3 ( 12.985 ) 4 ( 52.766 ) 4 ( 40.906 ) SK 4 ( 7.656 ) 3 ( 0.875 ) 4 ( 1.031 ) 4 ( 8.454 ) 4 ( 33.485 ) 4 ( 38.625 ) 4 ( 56.751 ) MPCNH 4 ( 3.579 ) 3 ( 0.827 ) 4 ( 0.797 ) 4 ( 7.203 ) 3 ( 4.156 ) 4 ( 16.344 ) 4 ( 13.547 )Although the four optimal methods compared are of the same order as MPCNH, their results are overall not as accurate as MPCNH, and furthermore they need more CPU time to achieve the stopping criteria under the same conditions. The optimal methods need in some cases more iterations to satisfy the convergence conditions as compared to MPCNH.


## 5. Dynamical Comparison

In this section we present the dynamics of the iterative schemes to compare the area of convergence of each iterative method. We want to see whether or not optimal methods always perform better than nonoptimal methods.Firstly, let uss start with some preliminaries which are related to the subject of basins of attraction (dynamics of iterative methods). The pointz0 is called a fixed point for g if g(z0)=z0. Let C^ be the Riemann sphere; then for z∈C^, we define the orbit of z as orb(z)={z,g(z),g[2](z),…,g[n](z),…}, where g[n] is the nth iteration of g. The point z0 is called a periodic point of period n if n is the smallest number with g[n](z0)=z0. If z0 is periodic of period n, then it is a fixed point for g[n]. A point z0 is said to be super-attracting if g′(z0)=0, attracting if g′(z0)<1, repelling if g′(z0)>1, and neutral if g′(z0)=1.We call the closure of the set of its repelling periodic points ‘Julia set’J(g) of a nonlinear function g(z). Fatou set F(g) is defined to be the complement of Julia set. If Q is an attracting orbit which is periodic with period n, then the basin of attraction is defined to be the open set I∈C^ of all points z∈C^ such that the consecutive iterates g[n](z),g[2n](z),… converge to some point of Q. In symbols, we can define the basin of attraction for any root α of g to be B(α)={z0∣limn→∞g[n](z0)=α}. The attraction basins of a periodic orbit may be of infinite components. It can be said that Fatou set containing attraction basins of any fixed point tends to an attractor, and Julia set contains the boundaries of these basins of attraction.We compare the dynamics of the proposed root finding method MPCNH to the dynamics of the same iterative methods used in the previous section, in addition to the CPU time in seconds needed to view these dynamics. We choose four test examples to visualize the basins of attraction. All examples are polynomials with roots of multiplicity one. The test polynomials areP1(z)=z3-1, with roots z=1,-0.5±0.866025i,P2(z)=z4-1, with roots z=±1,±i,P3(z)=z4-z, with roots z=0,1,-0.5±0.866025i, and P4(z)=z5-1, with roots z=1,0.3090±0.95105i,-0.8090±0.58778i. The dynamics of the four polynomials are shown in Figures 1–4, respectively.Figure 1
Dynamics forP1=z3-1 for the iterative methods. Top row: MPCNH, LMMW, and SSSL1, respectively. Bottom row: GK, SAK, and SK, respectively.Figure 2
Dynamics forP2=z4-1 for the iterative methods. Top row: MPCNH, LMMW, and SSSL1, respectively. Bottom row: GK, SAK, and SK, respectively.Figure 3
Dynamics forP3=z3-z for the iterative methods. Top row: MPCNH, LMMW, and SSSL1, respectively. Bottom row: GK, SAK, and SK, respectively.Figure 4
Dynamics forP4=z5-1 for the iterative methods. Top row: MPCNH, LMMW, and SSSL1, respectively. Bottom row: GK, SAK, and SK, respectively.In all test examples, a 4 by 4 region is positioned at the origin including all the roots of the tested functions. A400×400 uniform grid in the square is taken to select initial points for the iterative schemes via attraction basins. Each grid point is colored based on number of iterations needed for convergence and the root it converges to. The black area denotes points where the method is divergent. The exact roots were denoted as black points on the graph. The appearance of darker region shows that the scheme needs less number of iterations.Figures1 and 2 show that MPCNH, LMMW, SAK, and SK iterative methods give good basins of attraction, where the areas of convergence for these methods are larger than the areas of convergence of the optimal SSSL1 and GK methods. Those two methods show large black areas which represent points of divergent.In Figure3 we show that SAK and SK methods represent better dynamics than MPCNH, showing little chaos, while LMMW, SSSL1, and GK show larger divergent areas. Finally, the dynamics illustrated in Figure 4 shows that all the considered methods contain divergent points, with MPCNH and SAK having the fewest such points.Table7 presents the CPU time needed to obtain the attraction basins of the zeros of the examples considered. Even though MPCNH gives better basins of attraction than LMMW, it needs more time to be obtained in all cases. In general, the area of convergence of a root finding method depends on many factors, and it is not necessary that optimal methods have better dynamics than the nonoptimal ones. Also, even if a method shows better dynamics, that does not mean it needs less CPU time to be obtained.Table 7
CPU time in seconds.
Method P 1 ( z ) P 2 ( z ) P 3 ( z ) P 4 ( z ) LMMW 28.59 136.92 28.94 52.80 SSSL1 3681.88 2705.80 2610.55 2043.78 GK 1581.28 1271.91 814.86 1830.44 SAK 30.20 71.02 49.33 452.20 SK 33.00 337.78 38.09 46.41 MPCNH 119.88 187.03 37.80 141.16


## 6. Conclusion

We have developed in this study a new modified predictor-corrector technique for solving nonlinear equations. We have approximated the second derivatives using divided differences, obtaining the new technique of sixteenth-order of convergence. The efficiency index of the new method is 1.587 which is better than the original method. The convergence of the new algorithm has been discussed and the convergence order has been carried out. Four real life problems from chemical engineering, in addition to arbitrary seven different nonlinear equations, were tested. Numerical and dynamical comparisons have been done for several iterative methods of the same order, four of which are optimal. Overall, the implemented method exhibits faster and more accurate convergence to the exact solution than the other methods and the dynamics of the proposed methods showed larger area of convergence than some of the optimal methods used in the comparison. We have demonstrated that optimal methods are not always better than nonoptimal methods. There are many factors that affect the efficiency and the dynamics of the iterative methods other than number of functional evaluations per iteration, like number of algebraic operations at each iteration and number of steps needed by the iterative method. As a very good idea for future work, we think there is a need for an alternative efficiency index, which can be used to compare the efficiency of the iterative methods instead of the current efficiency index which does not reflect the real efficiency as we saw in this study.



---

*Source: 1728965-2019-07-14.xml*