Research Article | Open Access

Volume 2012 |Article ID 979245 | https://doi.org/10.1155/2012/979245

Diyashvir Kreetee Rajiv Babajee, Rajinder Thukral, "On a 4-Point Sixteenth-Order King Family of Iterative Methods for Solving Nonlinear Equations", International Journal of Mathematics and Mathematical Sciences, vol. 2012, Article ID 979245, 13 pages, 2012. https://doi.org/10.1155/2012/979245

# On a 4-Point Sixteenth-Order King Family of Iterative Methods for Solving Nonlinear Equations

Accepted14 May 2012
Published16 Aug 2012

#### Abstract

A one-parameter 4-point sixteenth-order King-type family of iterative methods which satisfy the famous Kung-Traub conjecture is proposed. The convergence of the family is proved, and numerical experiments are carried out to find the best member of the family. In most experiments, the best member was found to be a sixteenth-order Ostrowski-type method.

#### 1. Introduction

Solutions of nonlinear equations by iterative methods have been of great interest to numerical analysts. One of the popular methods is the classic Newton method (Newton Raphson method). It has quadratic convergence close to the root, that is the number of good digits is roughly doubled at each iteration. Higher order methods which require the second or higher order derivatives can be costly and thus time consuming. Also, the Newton method can suffer from numerical instabilities. It is consequently important to study higher order variants of Newton's method, which require only function and first derivative calculation and are more robust as compared to Newton's method. Such methods are known as multipoint Newton-Like methods in the Traub sense . Multipoint methods without memory are methods that use new information at a number of points. It is an efficient way of generating higher order methods free from second and higher order derivatives. For a survey of these methods, please refer to . In this work, we develop a one-parameter 4-point sixteenth-order King-type family of iterative methods, which satisfy the famous Kung-Traub conjecture. We prove the local convergence of the methods and its asymptotic error constant. We test our methods by varying the parameter of the family in a suitable interval and obtain the best value of the parameter for the methods with the highest computational order of convergence. We also compare our methods with other optimal sixteenth order methods. Furthermore, we test the family with two more nonlinear functions and find the best member based on the highest number of successful converging points and lowest mean iteration number.

#### 2. Preliminaries

Let define an iterative function (IF).

Definition 2.1 (see ). If the sequence tends to a limit in such a way that for , then the order of convergence of the sequence is said to be , and is known as the asymptotic error constant. If , , or , the convergence is said to be linear, quadratic, or cubic, respectively.
Letting , then the relation is called the error equation. The value of is called the order of convergence of the method.

Definition 2.2 (see ). The efficiency index is given by where is the total number of new function evaluations (the values of and its derivatives) per iteration.

Kung-Traub Conjecture (see )
Let be an IF without memory with evaluations. Then where is the maximum order.
We use the approximate computational-order of convergence,  given by

#### 3. Developments of the Methods

The second-order Newton-Raphson method is given by

It is an optimal 1-point IF with efficiency index of 1.414.

A one-parameter King family of fourth-order IF  is given by

The members of the family are 2-point I.F.s with efficiency index of 1.587. The case corresponds to the famous Ostrowski method .

Several optimal eight-order methods are developed in . Recently, Thukral and Petković  developed a family of optimal eighth-order King-type IF given by where and is a weight function satisfying

If we choose satisfying (3.5), we get a family of optimal eighth-order IF given by where

The members of the family are 3-point eighth-order I.F.s with efficiency index of 1.682.

Geum and Kim  developed a biparametric family of optimally convergent sixteenth-order 4-point I.F. with their fourth-step weighting function as a sum of a rational and a generic two-variable function: where are weighting functions, is an analytic function in a region containing the region , are to be chosen freely, and

We consider the case and for numerical experiments and term the I.F. as 16th GK1.

Geum and Kim  proposed another family of optimal sixteenth-order 4-point I.F.s with a linear fraction plus a trivariate polynomial as the fourth-step weighting function. Their family is given by where is an analytic function in a region containing the region and are to be chosen freely.

We consider the case and for numerical experiments and term the I.F. as 16th GK2.

We observe that the 16th FGK1 and 16th FGK2 family of IFs require two parameters and an analytic function. Therefore, we develop a simplified one-parameter optimal 4-point sixteenth-order King-type family of IFs based on 4th FK and 8th FK families. We propose the following family: where

#### 4. Convergence Analysis of the 16th FK Family of IFs

In this section, we prove the local and sixteenth-order of the 16th FK family of I.F.s using classical Taylor expansion.

Theorem 4.1. Let a sufficiently smooth function have a simple root in the open interval . Then the class of methods without memory (3.15) is of local sixteenth-order convergence.

Proof. Let
Using the Taylor series and the symbolic software such as Maple we have so that
Now, the Taylor expansion of about gives
Using (4.2), (4.6), and (4.5), we have so that
Similarly, we have so that and finally we get
By a similar argument, we have so that and finally we get
In the next section, we carry out numerical experiments to find the best member of the family and compare it to the Geum and Kim sixteenth-order IFs

#### 5. Numerical Experiments

The test functions and their exact root are displayed in Table 1. The approximation is calculated by using the same total number of function evaluations (TNFE) for all I.F.s considered. In the calculations, 15 TNFE are used by each I.F. For the 16th FK family, we choose a suitable range of values of , which are based on the initial approximation of the root. indicates the values of excluded in the range because of invalid estimate. The best value of is chosen based on the smallest value of and the highest computational-order of convergence (COC). The range and best value of are given in Table 2 for each function with its starting point. For most functions, the best value of , which corresponds to optimal 4-point sixteenth-order Ostrowski-type I.F. Furthermore, the approximation and the computational order of convergence (COC) for the best member of the 16th FK family and the and IFs are displayed in Table 3. The results show that the best member of the 16th FK family gives the smallest value of for when compared to Geum and Kim sixteenth order IF.

 𝑓 1 ( 𝑥 ) = e x p ( 𝑥 ) s i n ( 𝑥 ) + l n ( 1 + 𝑥 2 ) 𝑥 ∗ = 0 𝑓 2 ( 𝑥 ) = 𝑥 1 5 + 𝑥 4 + 4 𝑥 2 − 1 5 𝑥 ∗ = 1 . 1 4 8 5 3 8 … 𝑓 3 ( 𝑥 ) = ( 𝑥 − 2 ) ( 𝑥 1 0 + 𝑥 + 1 ) e x p ( − 𝑥 − 1 ) 𝑥 ∗ = 2 𝑓 4 ( 𝑥 ) = ( 𝑥 + 1 ) e x p ( s i n ( 𝑥 ) ) − 𝑥 2 e x p ( c o s ( 𝑥 ) ) − 1 𝑥 ∗ = 0 𝑓 5 ( 𝑥 ) = s i n 2 ( 𝑥 ) − 𝑥 2 + 1 𝑥 ∗ = 1 . 4 0 4 4 9 1 6 5 … 𝑓 6 ( 𝑥 ) = e x p ( − 𝑥 ) − c o s ( 𝑥 ) 𝑥 ∗ = 0 𝑓 7 ( 𝑥 ) = l n ( 𝑥 2 + 𝑥 + 2 ) − 𝑥 + 1 𝑥 ∗ = 4 . 1 5 2 5 9 0 7 4 …
 Function Range Best value of 𝛽 𝑓 1 , 𝑥 0 = 1 [ − 5 , 5 ] a , 𝑎 = − 3 , − 2 0 𝑓 2 , 𝑥 0 = 1 . 3 [ − 5 , 5 ] b , 𝑏 = − 3 , − 2 , − 1 0 𝑓 3 , 𝑥 0 = 2 . 5 [ − 5 , 5 ] c , 𝑐 = − 1 0 𝑓 4 , 𝑥 0 = 0 . 2 5 [ − 5 , 5 ] 1 𝑓 5 , 𝑥 0 = 2 . 5 [ − 2 , 5 ] 0 𝑓 6 , 𝑥 0 = 1 / 6 [ − 5 , 4 ] 0 𝑓 7 , 𝑥 0 = 3 . 5 [ − 5 , 5 ] − 1
 function 16th FK 16th G K 1 16th G K 2 | 𝑥 3 − 𝑥 ∗ | COC | 𝑥 3 − 𝑥 ∗ | COC | 𝑥 3 − 𝑥 ∗ | COC 𝑓 _ 1 , 𝑥 _ 0 = 1 0.137e-362 15.989 0.353e-581 15.981 0.103e-522 15.998 𝑓 _ 2 , 𝑥 _ 0 = 1 . 3 0.898e-670 16.000 0.994e-782 16.000 0.723e-811 15.987 𝑓 _ 3 , 𝑥 _ 0 = 2 . 5 0.479e-200 15.928 fail fail 0.819e-316 15.978 𝑓 _ 4 , 𝑥 _ 0 = 0 . 2 5 0.492e-3155 16.000 0.241e-2455 16.000 0.516e-2071 16.000 𝑓 _ 5 , 𝑥 _ 0 = 2 . 5 0.142e-810 16.000 0.164e-1147 15.993 0.452e-1020 16.000 𝑓 _ 6 , 𝑥 _ 0 = 1 / 6 0.224e-1702 16.000 0.172e-1004 15.992 0.782e-892 16.000 𝑓 _ 7 , 𝑥 _ 0 = 3 . 5 0.927e-4464 16.000 0.241e-4144 16.000 0.136e-3763 16.000

We next test the 16th FK family by varying the starting points. Let us consider the functions and . We focus on the behaviour of the IFs with the starting points, which are equally spaced with in the intervals for and for to check the robustness of the IFs. A starting point was considered as divergent if it does not satisfy the condition in at most 100 iterations. We denote the quantity as the mean number of iterations from a successful starting point until convergence with . Let denote the number of successful points of 100 starting points. We test for 101 of the family with in the interval . Figure 1 shows the variation of the converging points and mean iteration number with respect to for the function . We can observe the family is globally convergent for the values of and . It is the member that has the smallest mean iteration number and is the most efficient member for . In Figure 2, we observe that the family is globally convergent for the function for all given values of . It is the member which has the lowest mean iteration number. Figure 3 shows the number of iterations needed to achieve convergence is 2 for any starting point in the interval [2,8.3] enclosing the root. This illustrates the high speed of convergence of the method. That is, higher order I.F. can converge in few iterations even if the starting point is not very close to the root. We consider two more test functions, one of which is of simple cubic type [16, 17] for which the logarithm restricts the function to be positive and its convex properties of the function are favorable for global convergence [16, 17]. We test for 100 starting points in the interval . The root correct to 14 digits. A starting point was considered as divergent if it does not satisfy the convergence condition in at most 100 iterations together with at any iterates. A similar analysis is performed for another test function, the Oscillatory Cubic [16, 17]: in which the single root has been moved marginally to but many local extrema have been introduced on a small scale . This means that when the iterates of the I.F.s fall in the region where , they become zero or negative, causing them to diverge.

Figure 4 shows the variation of the converging points and mean iteration number with respect to for the Cubic function. It can be observed that the 16th FK family is globally convergent for , and . This is the member , which is the most efficient I.F. since it is globally convergent with the smallest mean iteration number of . We note that the family has many diverging points for negative values of .

Figure 5 shows the variation of the converging points and mean iteration number with respect to for the Oscillatory Cubic function. It can be observed that due to the perturbations the 16th FK family has difficulty with this function because its members have less than of starting points successfully converging. The mean of the IFs has also risen. The most efficient member of the family with the highest number of converging points (38) is the member with mean .

#### 6. Conclusion

We develop a 4-point sixteenth order King family of iterative methods. We prove the local convergence of the methods. We test the family via some numerical experiments to find the best member, which corresponds to a sixteenth-order Ostrowski method for most cases.

#### Acknowledgments

The authors are grateful to the unknown referees for their valuable comments to improve the paper. D. K. R. Babajee is an IEEE member.

1. J. F. Traub, Iterative Methods for the Solution of Equations, Prentice-Hall, New Jersey, NJ, USA, 1964.
2. D. K. R. Babajee, Analysis of Higher Order Variants of Newton's Method and Their Applications to Differential and Integral Equations and in Ocean Acidification [Ph.D. thesis], University of Mauritius, 2010.
3. J. M. McNamee, Numerical Methods for Roots of Polynomial: Part 1, Elsevier, Amsterdam, The Netherlands, 2007.
4. M. S. Petković and L. D. Petković, “Families of optimal multipoint methods for solving nonlinear equations: a survey,” Applicable Analysis and Discrete Mathematics, vol. 4, no. 1, pp. 1–22, 2010. View at: Publisher Site | Google Scholar
5. R. Wait, The Numerical Solution of Algebraic Equations, John Wiley & Sons, New York, NY, USA, 1979.
6. A. M. Ostrowski, Solutions of Equations and System of Equations, Academic Press, New York, NY, USA, 1960.
7. H. T. Kung and J. F. Traub, “Optimal order of one-point and multipoint iteration,” Journal of the Association for Computing Machinery, vol. 21, no. 4, pp. 643–651, 1974.
8. 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.
9. R. F. King, “A family of fourth order methods for nonlinear equations,” SIAM Journal on Numerical Analysis, vol. 10, pp. 876–879, 1973.
10. W. Bi, H. Ren, and Q. Wu, “Three-step iterative methods with eighth-order convergence for solving nonlinear equations,” Journal of Computational and Applied Mathematics, vol. 225, no. 1, pp. 105–112, 2009.
11. W. Bi, Q. Wu, and H. Ren, “A new family of eighth-order iterative methods for solving nonlinear equations,” Applied Mathematics and Computation, vol. 214, no. 1, pp. 236–245, 2009.
12. B. Neta, “On a family of multipoint methods for nonlinear equations,” International Journal of Computer Mathematics, vol. 9, no. 4, pp. 353–361, 1981. View at: Publisher Site | Google Scholar
13. R. Thukral and M. S. Petković, “A family of three-point methods of optimal order for solving nonlinear equations,” Journal of Computational and Applied Mathematics, vol. 233, no. 9, pp. 2278–2284, 2010.
14. Y. H. Geum and Y. I. Kim, “A biparametric family of optimally convergent sixteenth-order multipoint methods with their fourth-step weighting function as a sum of a rational and a generic two-variable function,” Journal of Computational and Applied Mathematics, vol. 235, no. 10, pp. 3178–3188, 2011.
15. Y. H. Geum and Y. I. Kim, “A family of optimal sixteenth-order multipoint methods with a linear fraction plus a trivariate polynomial as the fourth-step weighting function,” Computers and Mathematics with Applications, vol. 61, no. 11, pp. 3278–3287, 2011.
16. D. K. R. Babajee and M. Z. Dauhoo, “An analysis of the properties of the variants of newton's method with third order convergence,” Applied Mathematics and Computation, vol. 183, no. 1, pp. 659–684, 2006.
17. M. Drexler, Newton's Method as a Global Solver for Non-Linear Problems [Ph.D. thesis], University of Oxford, Oxford, UK, 1997.

#### More related articles

Article of the Year Award: Outstanding research contributions of 2020, as selected by our Chief Editors. Read the winning articles.