Journal of Applied Mathematics

Volume 2014, Article ID 817656, 17 pages

http://dx.doi.org/10.1155/2014/817656

## Some Class of Third- and Fourth-Order Iterative Methods for Solving Nonlinear Equations

Department of Mathematics, Maulana Azad National Institute of Technology, Bhopal 462051, India

Received 30 July 2013; Revised 11 January 2014; Accepted 25 February 2014; Published 11 May 2014

Academic Editor: Malgorzata Peszynska

Copyright © 2014 J. P. Jaiswal. 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.

#### Abstract

The object of the present work is to give the new class of third- and fourth-order iterative methods for solving nonlinear equations. Our proposed third-order method includes methods of Weerakoon and Fernando (2000), Homeier (2005), and Chun and Kim (2010) as particular cases. The multivariate extension of some of these methods has been also deliberated. Finally, some numerical examples are given to illustrate the performances of our proposed methods by comparing them with some well existing third- and fourth-order methods. The efficiency of our proposed fourth-order method over some fourth-order methods is also confirmed by basins of attraction.

#### 1. Introduction

Solving nonlinear equations is one of the most important problems in numerical analysis. To solve nonlinear equations, some iterative methods (such as Secant method and Newton method) are usually used. Throughout this paper, we consider iterative methods to find a simple root of a nonlinear equation . It is well known that the order of convergence of the Newton method is two. To improve the efficiency of the Newton method, many modified third-order methods have been presented in the literature by using different techniques. Weerakoon and Fernando in [1] obtained a third-order method by approximating the integral in Newton’s theorem by trapezoidal rule, Homeier in [2] by using inverse function theorem, Chun and Kim in [3] by using circle of curvature concept, and so forth. Kung and Traub [4] presented a hypothesis on the optimality of the iterative methods by giving as the optimal order. This means that the Newton method involved two function evaluations per iteration and is optimal with 1.414 as the efficiency index. By taking into account the optimality concept, many authors are trying to build iterative methods of optimal (higher) order of convergence.

The convergence order of the above discussed methods is three with three (one function and two derivatives) evaluations per full iteration. Clearly, its efficiency index is not high (optimal). In recent days, authors are improving these types of nonoptimal order methods to optimal order by using different techniques, such as in [5] by using linear combination of two third-order methods and in [6] by using polynomial approximations. Recently, Soleymani et al. [7] have used two different weight functions in the methods of [1, 2] to make them optimal.

This paper is organized as follows: in Section 2, we describe a new class of third-order iterative methods by using the concept of weight function which includes the methods of [1–3]. After that, order of this class of methods has been accelerated from three to four by introducing one more weight function and without adding more function evaluations. Section 3 is devoted to the extension of some proposed methods to the multivariate case. Finally, we give some numerical examples and the new methods are compared with some existing third- and fourth-order methods. Efficiency of our proposed fourth-order method is shown by basins of attraction.

#### 2. Methods and Convergence Analysis

Before constructing the methods, here we state the following definitions.

*Definition 1. *Let be a real valued function with a simple root and let be a sequence of real numbers that converge towards . The order of convergence is given by
where is the asymptotic error constant and .

*Definition 2. *Let be the number of function evaluations of the new method. The efficiency of the new method is measured by the concept of efficiency index [8, 9] and defined as
where is the order of convergence of the new method.

##### 2.1. Third-Order Methods

In this section, we construct a new class of two-step third-order iterative methods. Let us consider the following iterative formula: where . The following theorem indicates under what conditions on the weight function in (3) the order of convergence is three.

Theorem 3. *Let the function have sufficient number of continuous derivatives in a neighborhood of which is a simple root of ; then method (3) has third-order convergence, when the weight function satisfies the following conditions:
*

*Proof. *Let be the error in the th iterate and , . We provide Taylor’s series expansion of each term involved in (3). By Taylor series expansion around the simple root in the th iteration, we have

Furthermore, it can be easily found that

By considering this relation, we obtain

At this time, we should expand around the root by taking into consideration (7). Accordingly, we have

Furthermore, we have

By virtue of (9) and (4), we attain
Finally, using (10) in the second step of (3), we have the following error equation:
which has the third order of convergence. This proves the theorem.

*Particular Cases*

*Case 1. *If we take in (3), then we get the formula
which is the same as established by Weerakoon and Fernando in [1].

*Case 2. *If we take in (3), then we get the formula
which is the same as established by Homeier in [2].

*Case 3. *If we take in (3), then we get the formula
which is the same as established by Chun and Kim in [3].

*Case 4. *If we take in (3), then we get the formula
and its error expression is given by

*Remark 4. *By taking suitable weight function in (3) which satisfies the conditions of (4), one can get number of third-order methods.

*2.2. Fourth-Order Methods*

*The convergence order of the previous class of methods is three with three (one function and two derivatives) evaluations per full iteration. Clearly its efficiency index is not high (optimal) so we use one more weight function in the second step of (3) and introduce a constant in its first step. Thus, we consider
where and are real-valued weight functions with and is a real constant. The following theorem indicates under what conditions on the weight functions and constant in (17) the order of convergence will arrive at the optimal level four.*

*Theorem 5. Let the function have sufficient number of continuous derivatives in a neighborhood of which is a simple root of ; then method (17) has fourth-order convergence, when and the weight functions and satisfy the following conditions:
*

*Proof. *Using (5) and in the first step of (17), we have
Now we should expand around the root by taking into consideration (19). Thus, we have
Furthermore, we have
By virtue of (21) and (18), we can obtain
Finally, using (22) in the second step of (17), we have the following error expression:
which shows the fourth-order convergence. It confirms the result.

*It is clear that our class of fourth-order iterative methods (17) requires three function evaluations per iteration, that is, one function and two first derivative evaluations. Thus our new class is optimal. Clearly its efficiency index is (high). Now by choosing appropriate weight functions in (17) which satisfy the conditions of (18), one can give a number of optimal two-step fourth-order iterative methods. *

*Particular Cases*

*Method 1. *If we take , , and in (17), then we get the following method:
and its error equation is given by

*Method 2. *If we take , , and in (17), then we get the following method:
and its error equation is given by

*Method 3. *If we take , , and in (17), then we get the following method:
which is the same as given in [10].

*Method 4. *If we take , , and in (17), then we get the following method:
and its error equation is given by

*Remark 6. *By choosing the appropriate weight functions in (17) which satisfy the conditions of (18), one can get number of fourth-order methods.

*3. Extension to Multivariate Case*

*3. Extension to Multivariate Case*

*In this section, we extend some methods of the previous sections (similarly other methods can also be extended) to the multivariate case. Method (15) for systems of nonlinear equations can be written as
where , (); similarly ; is identity matrix; ; and is the Jacobian matrix of at .*

*Let be any point of the neighborhood of exact root of the nonlinear system . If Jacobian matrix is nonsingular, then Taylor’s series expansion for multivariate case is
where , , and
where is an identity matrix. From the above equation, we can find
where , , , and so on. Here we denote the error at th iterate by ; that is, . Now the order of convergence of method (31) is confirmed by the following theorem.*

*Theorem 7. Let be sufficiently Frechet differentiable in a convex set containing a root of . Let us suppose that is continuous and nonsingular in and is close to . Then the sequence obtained by the iterative expression (31) converges to with order three.*

*Proof. *From (32), (33), and (34), we have
where , . Now from (37) and (35), we can obtain
By virtue of (38), the first step of method (31) becomes
Now the Taylor expansion for Jacobian matrix is given by
Therefore
The above equation implies
where
Now from (40) and (42), we have
By using (44) and (38), it can be found that
Finally, using (45) in the second step of (31), we see that the error expression can be expressed as
which shows the theorem.

*Similarly, method (29) for systems of nonlinear equations is given by
The order of the convergence of this method is confirmed by the following theorem.*

*Theorem 8. Let be sufficiently Frechet differentiable in a convex set containing a root of . Let us suppose that is continuous and nonsingular in and is close to . Then the sequence obtained by the iterative expression (47) converges to with order four.*

*Proof. *Multiplying (37) by (35), we get
Substituting value of (48) in the first step of (47), we find
By using (49), the Taylor expansion of Jacobian matrix can be written as
From (37) and (50), it is obtained that
The above equation implies that
Now from (51) and (52), we have
Again by virtue of (50) and (36), it can be written as
which gives
where
Now from (55) and (50), we have
Premultiplying (57) by (48), it can be easily obtained that
Now by virtue of (53) and (58), it can be written as
Finally using (59), in the second step of method (47) we get
Thus the proof is completed.

*4. Numerical Testing*

*4. Numerical Testing*

*4.1. Single Variable*

*4.1. Single Variable*

*We consider four test nonlinear functions given in Table 1 to illustrate the accuracy of the new proposed methods. The root of each nonlinear test function is also listed. All the computations reported here have been done using MATMEMATICA 8. Scientific computations in many branches of science and technology demand very high precision degree of numerical precision. We consider the number of decimal places as follows: 200 digits floating point (SetAccuraccy = 200) with SetAccuraccy command. The test nonlinear functions are listed in Table 1. Here we compare performances of our new third-order method (15) with the Newton method (NM), Weerakoon and Fernando method (WR3) (12), Homeier method (HM3) (13), and Chun and Kim method (CH3) (14) and our fourth-order methods (M4 I) (24) and (M4 II) (29) with the fourth-order methods (17) (SL4) of [7] and (6) (KH4) of [11]. The results of comparison for the test functions for third- and fourth-order methods are given in Tables 2 and 3, respectively.*

*In Table 4, numerical tests are given for third-order and fourth-order methods. The test functions have been performed with stopping criterion ; in addition, the maximum number of iterations is less than 100. The computational results presented in Table 4 show that the presented method M4 II converges more rapidly than almost all these methods. This new method requires less number of functional evaluations. This means that the new method has better efficiency in computing process as compared to the other methods. For some initial guess, our method gives some bad results as compared to the Newton method but in this case other methods either failed (F)/diverge (D) or gave poor performances as compared to our method M4 II. Also one advantage of our method is that some of the third-order and fourth-order methods failed/diverge for some initial guess but our method does not. So we can conclude that our method M4 II is efficient.*

*4.2. Multivariate Case*

*4.2. Multivariate Case*

*Here we consider six nonlinear system problems. The residual norms for first, second, and third iteration are mentioned in Tables 5 and 6, respectively. We compare our third-order method (31) (M3 I) with the third-order methods Algorithm 2.2 (NR1) and Algorithm 2.3 (NR2) of [12], Newton-type method (10) (NT) of [13], Newton-Simpson’s method (5) (NS) and Open-Newton’s method (6) (ON) of [14], and Algorithm (2) (HZ) of [15] and our fourth-order method (47) (M4 II) with fourth-order method (3.5) (BBK) of [16], method (22) (JR) of [17], and method (7) (MT) of [18]. Here the results of comparison for the test functions for third- and fourth-order methods are given in Tables 5 and 6, respectively.*

*Consider the following systems of nonlinear equations.*

*Example 1. *We have
with initial guess and one of its solutions is . The Jacobian matrix of the above system of equations is given by

*Example 2. *We have
with initial guess and one of its solutions is . The Jacobian matrix of the above system of equations is given by

*Example 3. *We have
with initial guess and one of its solutions is . The Jacobian matrix of the above system of equations is given by

*Example 4. *We have
with initial guess and one of its solutions is . The Jacobian matrix of the above system of equations is given by

*Example 5. *We have
with initial guess and one of its solutions is . The Jacobian matrix of the above system of equations is given by

*Example 6. *We have
with initial guess and one of its solutions is . The Jacobian matrix of above equations is given by

*5. Basin of Attraction*

*5. Basin of Attraction*

*The basin of attraction for complex Newton’s method was first initiated by Cayley [19]. The basin of attraction is a way to view how an algorithm behaves as a function for the various starting points. It is another way to compare the iterative methods. We consider a rectangle and assign a colour to each point according to the root at which the corresponding iterative method starting from converges; for more details one may see [20, 21]. In this section, the following test functions have been considered for comparison: (i) (ii) (iii) (iv) (v) , and their roots are , , , and , respectively.*

*We compare our fourth-order method (30) (M4 II) with Jarratt’s method (JM4) of [22], (17) (SL4) of [7], and (6) (KH4) of [11]. The results of the comparisons are given in Figures 1, 2, 3, 4, and 5. In our first figure, we have performed all the methods to obtain the zeros of the quadratic polynomial . From Figure 1, it is clear that JM4 is best followed by our proposed method M4 II; methods KH4 and SL4 do not perform well. In Figure 2, we have taken a cubic polynomial . In this case again JM4 is best with simplest boundary of basin but our proposed method M4 II also shows the simpler boundaries as compared to methods SL4 and KH4. In Figure 3 we have considered a polynomial . It can be seen that, as before, JM4 and M4 II are better than SL4 and KH4. In Figures 4 and 5, we have taken polynomials and , respectively. In both figures, methods JM4 and M4 II dominate the other two methods, that is, SL4 and KH4. One can note that taking tighter conditions in programming code may develop picture with better quality than these.*

*From Figures 1–5, it is clear that our proposed fourth-order method and Jarratt’s method perform well as compared to the other two fourth-order methods.*

*6. Conclusion*

*6. Conclusion*

*In this paper, we have proposed a class of third- and fourth-order iterative methods for finding simple roots of nonlinear equations. Our third-order method includes methods of Weerakoon and Fernando [1], Homeier [2], and Chun and Kim [3] as particular cases. We have also extended some of our proposed methods from single to multivariate case. A number of numerical examples are given to illustrate the performances of our methods by comparing them with some well existing third- and fourth-order iterative methods. The efficiency of our fourth-order method over some existing fourth-order methods is also supported by basin of attractions.*

*Conflict of Interests*

*Conflict of Interests*

*The author declares that there is no conflict of interests regarding the publication of this paper.*

*Acknowledgments*

*Acknowledgments*

*The author is thankful to the referees and editor for their useful technical comments and valuable suggestions which led to a significant improvement of the paper. The author is also grateful to Dr. F. Soleymani, Iran, and Dr. Sujoy Das, India, for useful discussions.*

*References*

*References*

- S. Weerakoon and T. G. I. Fernando, “A variant of Newton's method with accelerated third-order convergence,”
*Applied Mathematics Letters*, vol. 13, no. 8, pp. 87–93, 2000. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - H. H. H. Homeier, “On Newton-type methods with cubic convergence,”
*Journal of Computational and Applied Mathematics*, vol. 176, no. 2, pp. 425–432, 2005. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - C. Chun and Y.-I. Kim, “Several new third-order iterative methods for solving nonlinear equations,”
*Acta Applicandae Mathematicae*, vol. 109, no. 3, pp. 1053–1063, 2010. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - H. T. Kung and J. F. Traub, “Optimal order of one-point and multipoint iteration,”
*Journal of the Association for Computing Machinery*, vol. 21, pp. 643–651, 1974. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - R. Behl, V. Kanwar, and K. K. Sharma, “Another simple way of deriving several iterative functions to solve nonlinear equations,”
*Journal of Applied Mathematics*, vol. 2012, Article ID 294086, 22 pages, 2012. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - G. Fernández-Torres and J. Vásquez-Aquino, “Three new optimal fourth-order iterative methods to solve nonlinear equations,”
*Advances in Numerical Analysis*, vol. 2013, Article ID 957496, 8 pages, 2013. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - F. Soleymani, S. K. Khattri, and S. Karimi Vanani, “Two new classes of optimal Jarratt-type fourth-order methods,”
*Applied Mathematics Letters*, vol. 25, no. 5, pp. 847–853, 2012. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - W. Gautschi,
*Numerical Analysis: An Introduction*, Birkhäuser, Barton, Mass, USA, 1997. View at MathSciNet - J. F. Traub,
*Iterative Methods for the Solution of Equations*, Prentice-Hall, Englewood Cliffs, NJ, USA, 1964. View at MathSciNet - J. P. Jaiswal, “A class of iterative methods for solving nonlinear equation with fourth-order convergence,” http://arxiv.org/abs/1307.7334.
- S. K. Khattri and S. Abbasbandy, “Optimal fourth order family of iterative methods,”
*Matematichki Vesnik*, vol. 63, no. 1, pp. 67–72, 2011. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - M. A. Noor and M. Waseem, “Some iterative methods for solving a system of nonlinear equations,”
*Computers & Mathematics with Applications*, vol. 57, no. 1, pp. 101–106, 2009. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - M. T. Darvishi and A. Barati, “A third-order Newton-type method to solve systems of nonlinear equations,”
*Applied Mathematics and Computation*, vol. 187, no. 2, pp. 630–635, 2007. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - A. Cordero and J. R. Torregrosa, “Variants of Newton's method using fifth-order quadrature formulas,”
*Applied Mathematics and Computation*, vol. 190, no. 1, pp. 686–698, 2007. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - M. Q. Khirallah and M. A. Hafiz, “Novel three order methods for solving a System of nonlinear equations,”
*Bulletin of Society for Mathematical Services and Standards*, vol. 1, no. 2, pp. 1–14, 2012. View at Google Scholar - D. K. R. Babajee, A. Cordero, F. Soleymani, and J. R. Torregrosa, “On a noval fourth-order algorithm for solving systems of nonlinear equations,”
*Journal of Applied Mathematics*, vol. 2012, Article ID 165452, 12 pages, 2012. View at Publisher · View at Google Scholar - J. R. Sharma, R. K. Guha, and R. Sharma, “An efficient fourth order weighted-Newton method for systems of nonlinear equations,”
*Numerical Algorithms*, vol. 62, no. 2, pp. 307–323, 2013. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - M. T. Darvishi and A. Barati, “A fourth-order method from quadrature formulae to solve systems of nonlinear equations,”
*Applied Mathematics and Computation*, vol. 188, no. 1, pp. 257–261, 2007. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - A. Cayley, “The-Newton-Fourier imaginary problem,”
*American Journal of Mathematics*, vol. 2, Article 97, 1879. View at 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 · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - B. Neta, M. Scott, and C. Chun, “Basins of attraction for several methods to find simple roots of nonlinear equations,”
*Applied Mathematics and Computation*, vol. 218, no. 21, pp. 10548–10556, 2012. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - P. Jarratt, “Some efficient fourth order multipoint methods for solving equations,”
*BIT Numerical Mathematics*, vol. 9, pp. 119–124, 1969. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet

*
*