/ / Article

Research Article | Open Access

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

R. Thukral, "Further Development of Jarratt Method for Solving Nonlinear Equations", Advances in Numerical Analysis, vol. 2012, Article ID 493707, 9 pages, 2012. https://doi.org/10.1155/2012/493707

# Further Development of Jarratt Method for Solving Nonlinear Equations

Accepted17 Jul 2012
Published27 Aug 2012

#### Abstract

We present two new families of Jarratt-type methods for solving nonlinear equations. It is proved that the order of convergence of each family member is improved from four to six by the addition of one function evaluation. Per iteration, these new methods require two evaluations of the function and two evaluations of the first-order derivatives. In fact, the efficiency index of these methods is 1.565. Numerical comparisons are made with other existing methods to show the performance of the presented methods.

#### 1. Introduction

Multipoint iterative methods for solving nonlinear equations are of great practical importance since they overcome theoretical limits of one-point methods concerning the convergence order and computational efficiency. The new iterative methods are applied to find a simple root of the nonlinear equation where is a scalar function on an open interval , and it is sufficiently smooth in a neighbourhood of . In this paper, we present new variants of the Jarratt method, based on the composition of Jarratt and Newton-type methods instead of a two-step Newton method. The new variants are formed by adding an evaluation of the function at another point in the procedure iterated by the Jarratt method. Consequently, the order of convergence of the new Jarratt-type method is improved from four to six. Per iteration, the new methods require two evaluations of the function and two of its first derivatives. Recently, many variants of the Jarratt method with sixth-order convergence have been developed , which improve the order of convergence of the Jarratt method by an additional evaluation of the function. Hence, the prime motive of this study is to develop a new class of efficient Jarratt-type methods for solving nonlinear equations. In addition, these new sixth-order Jarratt-type methods have an efficiency index equivalent to the recently established methods presented in . Consequently, we have found that the new Jarratt-type methods are efficient and robust.

The paper is organized as follows. In Section 2, two new families of the Jarratt-type method of sixth-order are developed. Convergence analysis is provided to establish their sixth order of convergence. In Section 3, we briefly state the established methods in order to compare the effectiveness of the new Jarratt-type methods. Finally, in Section 4, several numerical examples are given to demonstrate the performance of the new Jarratt-type methods presented in this contribution.

#### 2. Development of the Methods and Convergence Analysis

In this section we define two new sixth-order Jarratt-type methods. The new scheme was actually developed by using the classical Jarratt method and then squaring the weight function in the third step. We begin with the classical Jarratt method and then show the improvement in the third step.

Let then a new improved Jarratt-type method is given as

We observe that the new Jarratt-type method (2.2) is simply formed to attain the sixth order of convergence. Using this concept we developed three different families of sixth-order methods.

In order to establish the order of convergence of these new Jarratt-type methods we state the three essential definitions.

Definition 2.1. Let be a real 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.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 [4, 5] and defined as where is the order of the method.

Definition 2.3. Suppose that , and are three successive iterations closer to the root of (1.1). Then the computational order of convergence  may be approximated by where .

##### 2.1. The Three-Point Jarratt-Type Methods

We consider the following iteration scheme:

The first two steps of (2.6) are the same as those of the classical fourth-order Jarratt method , and the third step is constructed to achieve the sixth order of convergence. In order to achieve the sixth order of convergence, we introduce a weight function in the third step of (2.6). To obtain the solution of (1.1) by the new sixth-order Jarratt-type methods, we must set a particular initial approximation , ideally close to the simple root and provided that the denominators in (2.6) are not equal to zero. In numerical mathematics it is essential to know the behaviour of an approximate method. Therefore, we prove the order of convergence of the new sixth-order methods.

Theorem 2.4. Assume that the function for an open interval has a simple root . If is sufficiently smooth in the neighbourhood of the root , then the method defined by (2.6) is of order six.

Proof. Let be a simple root of , that is, and , and the error is expressed as Using Taylor expansion, we have Taking and simplifying, expression (2.8) becomes where and Furthermore, we have Dividing (2.9) by (2.11), we get and, hence, we have
The expansion of about is given as From (2.11) and (2.14) we attain Dividing (2.15) by (2.16) gives us From (2.12) and (2.17), we have Thus from (2.6) and (2.18), we have For the third step, we expand about , and we have
The expansion of the weight function used in the third step (2.6) is given as Substituting appropriate expressions in the third step of (2.6), we obtain
The expression (2.22) establishes the asymptotic error constant for the sixth order of convergence for the new Jarratt-type method defined by (2.6).

##### 2.2. Method 2

The second of the new three-step Jarratt-type method is given as is the initial approximation and provided that the denominators of (2.23) are not equal to zero.

Theorem 2.5. Assume that the function for an open interval has a simple root . If is sufficiently smooth in the neighbourhood of the root , then the method defined by (2.23) is of order six.

Proof. Using appropriate expressions in the proof of the Theorem 2.4 and substituting them into (2.23), we obtain the asymptotic error constant
The expression (2.24) establishes the asymptotic error constant for the sixth order of convergence for the new Jarratt-type method defined by (2.23).

##### 2.3. Method 3

The third of the new three-step Jarratt-type method is expressed as is the initial approximation and provided that the denominators of (2.25) are not equal to zero.

Theorem 2.6. Assume that the function for an open interval has a simple root . If is sufficiently smooth in the neighbourhood of the root , then the method defined by (2.25) is of order six.

Proof. Using appropriate expressions in the proof of the Theorem 2.4 and substituting them into (2.25), we obtain the asymptotic error constant
The expression (2.26) establishes the asymptotic error constant for the sixth order of convergence for the new Jarratt-type method defined by (2.25).

#### 3. The Established Jarratt-Type Sixth-Order Methods

For the purpose of comparison, we consider three sixth-order methods presented recently in . Since these methods are well established, we will state the essential expressions used in order to calculate the approximate solution of the given nonlinear equations and thus compare the effectiveness of the new sixth order Jarratt-type methods.

##### 3.1. Wang et al. Method

In , Wang et al. developed another three-step sixth order of convergence method, and the particular expressions of the method are given as

##### 3.2. Wang et al. Method

In , Wang et al. developed a three-step sixth order of convergence method, as before we state the essential expressions used in the method as follows:

##### 3.3. Soleymani Method

In , Soleymani developed a three-step sixth order of convergence method. Since this method is well known we state the essential expressions used in the method as follows:

#### 4. Application of the New Sixth-Order Jarratt-Type Iterative Methods

The present sixth-order methods given by (2.6), (2.23), and (2.25) are employed to solve nonlinear equations and compare with the Soleymani, Wang et al. type 1, and type 2 methods (3.3), (3.2), and (3.1), respectively. To demonstrate the performance of the new sixth-order methods, we use ten particular nonlinear equations. We will determine the consistency and stability of results by examining the convergence of the new Jarratt-type iterative methods. The findings are generalised by illustrating the effectiveness of the sixth-order methods for determining the simple root of a nonlinear equation. Consequently, we will give estimates of the approximate solution produced by the sixth-order methods and list the errors obtained by each of the methods. The numerical computations listed in the tables were performed on an algebraic system called Maple. In fact, the errors displayed are of absolute value, and insignificant approximations by the various methods have been omitted in Tables 1, 2, and 3.

 Functions Roots 𝑓 1 ( 𝑥 ) = e x p ( 𝑥 ) s i n ( 𝑥 ) + l n ( 1 + 𝑥 2 ) 𝛼 = 0 𝑓 2 ( 𝑥 ) = ( 𝑥 2 − 1 ) − 1 − 1 √ 𝛼 = 2 𝑓 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 . 6 6 6 2 7 3 1 2 6 … 𝑓 7 ( 𝑥 ) = l n ( 𝑥 2 + 𝑥 + 2 ) − 𝑥 + 1 𝛼 = 4 . 1 5 2 5 9 0 7 4 … 𝑓 8 ( 𝑥 ) = 𝑥 1 0 − 2 𝑥 3 − 𝑥 + 1 𝛼 = 0 . 5 9 1 4 4 8 0 9 3 … 𝑓 9 ( 𝑥 ) = c o s ( 𝑥 ) 2 − 5 − 1 𝑥 𝛼 = 1 . 0 8 5 9 8 2 6 8 … 𝑓 1 0 ( 𝑥 ) = s i n ( 𝑥 ) − 2 − 1 𝑥 𝛼 = 0
 Functions (2.6) (2.23) (2.25) (3.1) (3.2) (3.3) 𝑓 1 ( 𝑥 ) , 𝑥 0 = 0 . 2 5 0 . 4 4 0 𝑒 − 1 6 6 0 . 4 0 9 𝑒 − 1 8 5 0 . 1 2 3 𝑒 − 1 6 1 0 . 2 8 4 𝑒 − 1 4 9 0 . 1 0 2 𝑒 − 1 4 4 0 . 1 2 6 𝑒 − 2 1 7 𝑓 2 ( 𝑥 ) , 𝑥 0 = 1 . 1 0 . 1 8 1 𝑒 − 7 8 0 . 7 7 5 𝑒 − 3 7 0 . 1 4 6 𝑒 − 5 3 0 . 1 9 5 𝑒 − 4 1 0 . 2 3 8 𝑒 − 3 9 0 . 1 7 4 𝑒 − 3 8 𝑓 3 ( 𝑥 ) , 𝑥 0 = 2 . 1 0 . 1 3 8 𝑒 − 1 1 8 0 . 1 2 6 𝑒 − 1 1 3 0 . 1 2 0 𝑒 − 1 1 2 0 . 4 6 1 𝑒 − 1 0 0 0 . 5 3 3 𝑒 − 9 6 0 . 2 3 6 𝑒 − 1 1 8 𝑓 4 ( 𝑥 ) , 𝑥 0 = − 0 . 5 0 . 5 0 8 𝑒 − 1 9 9 0 . 1 0 4 𝑒 − 1 7 9 0 . 3 9 1 𝑒 − 2 0 2 0 . 1 5 5 𝑒 − 1 8 3 0 . 7 4 5 𝑒 − 1 7 1 0 . 4 7 1 𝑒 − 1 8 7 𝑓 5 ( 𝑥 ) , 𝑥 0 = 0 . 2 5 0 . 7 0 8 𝑒 − 1 2 2 0 . 4 4 0 𝑒 − 8 0 0 . 7 4 8 𝑒 − 1 2 0 0 . 1 9 9 𝑒 − 6 3 0 . 1 8 5 𝑒 − 5 0 0 . 5 3 0 𝑒 − 1 2 8 𝑓 6 ( 𝑥 ) , 𝑥 0 = 1 . 2 0 . 2 6 6 𝑒 − 1 8 3 0 . 4 3 1 𝑒 − 1 9 2 0 . 4 1 6 𝑒 − 1 7 8 0 . 3 2 7 𝑒 − 1 6 4 0 . 3 0 1 𝑒 − 1 5 9 0 . 1 3 1 𝑒 − 2 1 1 𝑓 7 ( 𝑥 ) , 𝑥 0 = 2 0 . 2 7 8 𝑒 − 1 9 3 0 . 1 5 0 𝑒 − 2 5 5 0 . 2 8 5 𝑒 − 1 9 0 0 . 8 5 1 𝑒 − 1 7 6 0 . 1 5 2 𝑒 − 1 6 9 0 . 5 2 8 𝑒 − 2 0 3 𝑓 8 ( 𝑥 ) , 𝑥 0 = 0 . 2 5 0 . 4 4 4 𝑒 − 1 8 7 0 . 3 4 3 𝑒 − 1 9 4 0 . 5 5 1 𝑒 − 1 8 6 0 . 1 3 3 𝑒 − 1 8 1 0 . 1 5 3 𝑒 − 1 7 9 0 . 1 0 5 𝑒 − 1 9 2 𝑓 9 ( 𝑥 ) , 𝑥 0 = 1 . 7 0 . 9 4 1 𝑒 − 1 2 5 0 . 1 1 5 𝑒 − 1 6 4 0 . 1 4 5 𝑒 − 1 2 2 0 . 8 0 5 𝑒 − 1 0 7 0 . 5 8 7 𝑒 − 1 0 0 0 . 5 7 3 𝑒 − 1 2 8 𝑓 1 0 ( 𝑥 ) , 𝑥 0 = 4 . 4 0 . 1 2 2 𝑒 − 1 5 7 0 . 1 1 0 𝑒 − 1 3 5 0 . 2 3 1 𝑒 − 1 4 7 0 . 1 0 1 𝑒 − 1 2 9 0 . 1 3 2 𝑒 − 1 2 4 0 . 5 5 9 𝑒 − 1 4 1
 Functions (2.6) (2.23) (2.25) (3.1) (3.2) (3.3) 𝑓 1 ( 𝑥 ) , 𝑥 0 = 0 . 2 5 6.000 6.000 6.000 6.000 6.000 6.000 𝑓 2 ( 𝑥 ) , 𝑥 0 = 1 . 1 6.010 5.622 6.010 6.001 5.997 5.665 𝑓 3 ( 𝑥 ) , 𝑥 0 = 2 . 1 6.000 6.000 6.000 6.000 6.000 5.012 𝑓 4 ( 𝑥 ) , 𝑥 0 = − 0 . 5 6.000 5.982 6.000 5.983 5.980 5.984 𝑓 5 ( 𝑥 ) , 𝑥 0 = 0 . 2 5 5.962 6.002 5.960 5.996 5.988 5.965 𝑓 6 ( 𝑥 ) , 𝑥 0 = 1 . 2 6.000 6.000 6.000 6.000 6.000 6.000 𝑓 7 ( 𝑥 ) , 𝑥 0 = 2 6.000 5.991 6.000 6.000 6.000 6.000 𝑓 8 ( 𝑥 ) , 𝑥 0 = 0 . 2 5 6.000 5.985 6.000 6.000 6.000 6.000 𝑓 9 ( 𝑥 ) , 𝑥 0 = 1 . 7 6.000 5.979 6.000 5.999 5.998 6.000 𝑓 1 0 ( 𝑥 ) , 𝑥 0 = 4 . 4 6.000 6.000 6.000 6.000 6.000 6.000

The new three-step Jarratt-type methods require four function evaluations and have the order of convergence six. To determine the efficiency index of these new Jarratt-type methods, we will use Definition 2.2. Hence, the efficiency index of the sixth-order Jarratt-type methods given is , which is identical to other established three-point Jarratt-type methods. The test functions and their exact root are displayed in Table 1. The difference between the root and the approximation for test functions with initial approximation , based on , are displayed in Table 2. In fact, is calculated by using the same total number of function evaluations (TNFEs) for all methods. In the calculations, 12 TNFE are used by each method. Furthermore, the computational order of convergence (COC) is displayed in Table 3.

#### 5. Remarks and Conclusions

In this study, we have constructed new sixth-order Jarratt-type methods for solving nonlinear equations. Convergence analysis proves that these new Jarratt-type methods preserve their order of convergence. We have examined the effectiveness of the new Jarratt-type methods by showing the accuracy of the simple root of a nonlinear equation. The main purpose of demonstrating the new sixth-order Jarratt-type methods for many different types of nonlinear equations was purely to illustrate the accuracy of the approximate solution, the stability of the convergence, the consistency of the results, and to determine the efficiency of the new iterative methods. We conjecture that many other variants of Jarratt-type methods may be constructed in a similar form to that presented in this paper. Finally, we conclude that the new three-point methods may be considered a very good alternative to the classical methods.

1. F. Soleymani, “Revisit of Jarratt method for solving nonlinear equations,” Numerical Algorithms, vol. 57, no. 3, pp. 377–388, 2011.
2. X. Wang, J. Kou, and Y. Li, “A variant of Jarratt method with sixth-order convergence,” Applied Mathematics and Computation, vol. 204, no. 1, pp. 14–19, 2008.
3. X. Wang, J. Kou, and Y. Li, “Modified Jarratt method with sixth-order convergence,” Applied Mathematics Letters, vol. 22, no. 12, pp. 1798–1802, 2009.
4. W. Gautschi, Numerical Analysis: An Introduction, Birkhäuser, Boston, Mass, USA, 1997. View at: Zentralblatt MATH
5. J. F. Traub, Iterative Methods For Solution of Equations, Chelsea Publishing Company, New York, NY, USA, 1977.
6. 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.
7. P. Jarratt, “Some efficient fourth order multipoint methods for solving equations,” BIT, vol. 9, pp. 119–124, 1969. View at: Google Scholar | Zentralblatt MATH

#### More related articles

We are committed to sharing findings related to COVID-19 as quickly as possible. We will be providing unlimited waivers of publication charges for accepted research articles as well as case reports and case series related to COVID-19. Review articles are excluded from this waiver policy. Sign up here as a reviewer to help fast-track new submissions.