Hindawi Publishing Corporation

Journal of Applied Mathematics

Volume 2014, Article ID 468694, 8 pages
http://dx.doi.org/10.1155/2014/468694

Research Article
Convergence Theorem for a Family of New Modified
Halleys Method in Banach Space

Rongfei Lin,1 Yueqing Zhao,1 Qingbiao Wu,2 and Jueliang Hu3

1
Department of Mathematics, Taizhou University, Linhai, Zhejiang 317000, China
2
Department of Mathematics, Zhejiang University, Hangzhou, Zhejiang 310027, China
3
Department of Mathematics, Zhejiang Sci-Tech University, Hangzhou, Zhejiang 310018, China

Correspondence should be addressed to Qingbiao Wu; qbwu@zju.edu.cn

Received 18 February 2014; Revised 8 May 2014; Accepted 22 May 2014; Published 17 June 2014

Academic Editor: Alicia Cordero

Copyright 2014 Rongfei Lin 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.

We establish convergence theorems of Newton-Kantorovich type for a family of new modified Halleys method in Banach space
to solve nonlinear operator equations. We present the corresponding error estimate. To show the application of our theorems, two
numerical examples are given.

1. Introduction Under the reasonable hypothesis, Newtons method is

second-order convergence.
Solving the nonlinear operator equation is an important issue Since Kantorovich presented the famous convergence
in the engineering and technology field. Finding solutions result (see [2]), many Newton-Kantorovich type convergence
of the nonlinear operator equation in Banach spaces also theorems were gotten (see [311]). To improve the conver-
is a very general subject which is widely used in both gence order, many modified methods have been presented
theoretical and applied areas of mathematics for many years. (see [1215]). The famous Halleys method is third-order
Many problems may be formulated in terms of finding zeros. convergence which was widely discussed (see [1623]). The
These roots cannot be expressed in closed form generally. famous Halleys method is defined as follows:
Thus, in order to solve nonlinear equations, we have to use
approximate methods (see [1]). In this study, we consider 1 1 1
establishing the Newton-Kantorovich convergence theorems +1 = [ + ( ) ( ( )) ]
2 2 (3)
for a family of new modified Halleys method with third-order
Banach space by using majorizing function which is used to 1
( ) ( ) , = 0, 1, . . . ,
solve the nonlinear operator equation. Consider
where
() = 0, (1)
() = ()1 () ()1 () , . (4)
where is defined as an open convex of a Banach space
with values in a Banach space . In the year of 2001, Gutierrez and Hernandez [24]
There are kinds of methods to find a solution of (1). proposed the Super-Halley method, which is an acceleration
Iterative methods are often used to solve this problem (see of Newtons method with third order. Consider
[1]). If we use the famous Newtons method, we can do as
follows: 1 1
+1 = [ + ( ) ( ( )) ] ( )1 ( ) .
2
+1 = ( )1 ( ) , ( 0) (0 ) . (2) (5)
2 Journal of Applied Mathematics

Using the majorant principle, the authors also established a a class of modifications of Halleys method free from second
semilocal convergence theorem for the Super-Halley method derivative [31] is obtained; that is,
under weaker conditions, which is defined as follows:
2 ( ) ( )
1 +1 = ,
(0 ) ( () ()) .

(6) (13)
( + 1) ( ) ( ) ( )
2

Extending the family of scalar iterative processes con- where , = 0, and = ( )/ ( ). This
sidered by Hernandez and Salanova in [25], Gutierrez and modified Halleys method is cubically convergent for any
Hernandez [26] presented a one-parameter family of iterative nonzero real number .
processes Now, we consider a new finite difference approximation
1 1 of ():
,+1 = , [ + (, ) ( (, )) ]
2 (7) ( ) ( ) ( + ( )) ( ) ,
1
(, ) , . (14)

This family includes, as particular cases, Chebyshevs method where

( = 0), Halleys method ( = 1/2), and convex acceleration 1
= ( ) ( ) , > 0, (15)
of Newtons method ( = 1). Under Kantorovich-type
assumptions, the authors obtained results on existence and and from Halleys method (3), we obtain a family of new
uniqueness of solution of (1). modified Halleys method with parameters and :
The calculation of the second derivative of the function 1
is needed in the above iterative methods. For avoiding the = ( ) ( ) ,
calculation ( ) and keeping higher order of convergence
1 1
at the same time, some authors have studied the convergence ( , ) = ( ) [ ( + ( )) ( )] ,
of the iteration (3) by using difference quotient of the first
derivative to replace the second derivative. [0, 1] , (0, 1] ,
Based on Halleys method in which the second derivative
is replaced with a finite difference between first derivatives, 1
that is, +1 = ( , ) [ ( , )] ( ) .
2
(16)
( ) ( )
( ) , (8)
This includes the modified Chebyshev iteration (see [8,
9]) for = 1/2, = 0 and the Jarratt iteration (see [32, 33])
a class of iterative methods with free second derivative is for = 2/3, = 1. In this paper, we discuss the convergence
obtained [27]. Consider of modified Halleys methods for solving nonlinear operator
2 ( ) equations in Banach spaces and establish convergence theo-
+1 = , (9) rems of Newton-Kantorovichs type. The corresponding error
(2 1) ( ) + ( )
estimate is also given. Finally, two examples are provided to
where (0, 1] and = ( )/ ( ). show the application of our theorem.
For = 1, a third-order method is obtained [28]:
2 ( ) 2. Convergence Theorem
+1 = . (10)
( ) + ( ( ) / ( ))

In the section, we establish a Newton-Kantorovich type
convergence theorem and present the error estimate. Denote
For = 1/2, another third-order method is obtained [29,
30]: () = ((1/2)2 ) (/) + (/), where , , are positive
real numbers. Write = , = ((1 1 2 )/), and
( ) = ((1 + 1 2)/), where , are the roots of the
+1 = . (11)
( ( ) / (2 ( ))) equation () = 0. Let
1
These methods do not require the second derivative although = ( ) ( ) , 0 = 0,
they can converge cubically. Thus, the approach to remove the
second derivative is important and interesting for deriving 1 1
( , ) = ( ) [ ( + ( )) ( )] ,
more new high-order iterative methods free from second
derivative from third-order iterative methods with second
derivative. [0, 1] , (0, 1] ,
By directly replacing ( ) with a new approximation
1
+1 = ( , ) [1 ( , )] ( ) .
1 ( ) ( ) ( ) + ( 1) ( ) 2
( ) = 2
, (17)
2 ( ) 2 ( )
(12) Firstly, we get some lemmas.
Journal of Applied Mathematics 3

Lemma 1. Assume { } and { } are the sequences generated 1 1

( + ( ))
by (17). If 1/2, then the sequences { } and { } are 2 0
monotonically increasing and converge to . Moreover, one has
( ) ( , ) ( )

0 < < +1 < +1 < < , 1
[ ( + ( ))
3 3 2
2 0
+1 = ( ) [( ) + 4( ) ( )
( + ( ))]
2
+ 5 ( ) ( ) ( ) ( , ) ( )
3 1
+ (2 2) ( ) ] + ( + ( ))
2 0
5 1 ( ) ( , ) ( , ) ( ) .
([( ) + ( )] ) ,
(20)
3 3 2
+1 = ( ) [( ) + 4( ) ( )
Proof. Consider
2
+ 5 ( ) ( )
3 (+1 )
+ (2 2) ( ) ]
= (+1 ) ( ) ( ) (+1 )
5 1
([( ) + ( )] ) .
(18) + ( ) + ( ) (+1 )
1
2
Proof. By (17) we can get = ( + (+1 )) (1 ) (+1 )
0

() = ( ) ( ) , + ( ) + ( ) (+1 ) ,
2
( ) ( , )
() = [( ) + ( )] ,
2 1
= [ ( + ( )) ( )]
1 ( ) ( )
= ( ) ( ) = ,
( ) + ( ) 1
= ( + ( )) ( ) ,
1 2 ( ) ( ) 0
( , ) = ( ) ( ) = 2
,
[( ) + ( )] ( ) + ( ) (+1 )
1
+1 = ( , ) [1 ( , )] ( ) . = ( ) ( ) ( ) ( )
2
1
(19) ( ) ( , ) [ ( , )] ( )
2
By a simple calculation and mathematical induction, it is easy 1
2
to prove Lemma 1. = ( + ( )) (1 ) ( )
0
Lemma 2. Let () be a nonlinear operator defined on a 1
convex domain of a Banach space with values in a Banach [ ( ) ( )] ( , ) [ ( , )]
2
space . Assume that has second-order continuous Frechet
derivatives on . If { }, { } are the sequences generated by ( )
(16), then
1
( ) ( , ) [ ( , )] ( )
(+1 ) 2
1 1
= ( + (+1 )) (1 ) (+1 )
2 = ( + ( )) (1 ) ( )2
0 0

1 1 1
+ [ ( + ( )) (1 ) ( + ( )) ( )2
0
2 0
1 2 1
( + ( ))] ( ) + ( + ( )) ( )
2 2 0
4 Journal of Applied Mathematics

( , ) ( ) are satisfied and = 1/2, then the sequence { }0

1 generated by (16) is well defined and converges to a unique
1 solution of (1) in (0 , ).
( + ( )) ( )
2 0
( , ) ( ) Theorem 4. Assume satisfies conditions in Theorem 3.
Denoting = ( / ) = (1 1 2)/(1 + 1 2), one
1 has the following:
+ ( + ( )) ( ) ( , )
2 0
( , ) ( ) . (i) when = < 62 8 = 0.4852 ,
(21)
(1 2 ) 3 1
Hence, 3
[2] ,
(1 (1/2)) [2]
(+1 ) (24)
1
2
= ( + (+1 )) (1 ) (+1 )
0 (ii) when 3/8, 4 (95 20) = 0.4984 ,
1



+ [ ( + ( )) (1 )
0
3 1
1 2 (1 2 ) 5
( + ( ))] ( ) 3
[ ] .
2 (1 (2/5)) [(5/2) ] 2
1 1 (25)
( + ( ))
2 0

( ) ( , ) ( ) 3. Proof of Theorem

1 Proof of Theorem 3. To prove Theorem 3, we first prove that

[ ( + ( )) following items are true for all 0:
2 0
( + ( ))] (I ) (0 , );
(II ) ( )1 ( )1 ;
( ) ( , ) ( )
(III ) ;
1
+ ( + ( )) (IV ) (0 , );
2 0
( ) ( , ) ( , ) ( ) . (V ) +1 +1 .
(22) It is easy to check for the case = 0 by the initial conditions.
This completes the proof. By using mathematical induction, assume that the above
statements are true for some fixed 0. Then we have
Theorem 3. Let and be Banach space and let be
an open convex domain. Assume : has second- (I+1 ):
order continuous Frechet derivatives. For an initial value 0
and fixed parameters [0, 1), (0, 1], if (0 )1 exists +1 0 +1 + 0
and the conditions (26)
+1 + = +1 ,

(0 )1 , 0 0 = (0 ) (0 ) ,
1

(II+1 ):
() () ,

() ,

, , (+1 ) (0 ) +1 0

{ (2 + 3) (1 ) } 1 1 2
+1 < =
max { 1 + , 3 1 + ,
6 (1 ) 2 22 }
{ } 1 1
= .
(0 , ) , (0 )1

(23) (27)
Journal of Applied Mathematics 5

4
By Banach Lemma, we get that (+1 )1 exists and 2 (1 ) 3
+1 + [1 + ] 2
2 22 2[ ( )]

(+1 )1 (2 + 3) (1 ) 2
3
+ [1 + ]

(0 )1 6 (1 ) 2 2 ( )

1 4
1 (0 ) (+1 ) (0 ) 2 3 ( ) (1 ) 2 3
(+1 ) + 2

( )
2 2 [ ( )]
2 ( )
(28)

1 +1 0
= (+1 ) .
1 1 (30)

(1/) +1 0 (1/) +1 Hence, we deduce that
1
= (+1 ) ;
1
+1 +1 (+1 ) (+1 )
(31)
1
(+1 ) (+1 ) = +1 +1 .
(III+1 ):
Moreover, we have (IV+1 ):
1 +1 0 +1 +1 + +1 0

[ ( + ( )) (1 ) (32)
0 (+1 +1 ) + +1 = +1 ,


1 (V+1 ):
( + ( ))]
2
+2 +1
1
1
[ ( + ( )) ( )] (1 ) = (+1 , +1 ) [ (+1 , +1 )] (+1 +1 )
0 2
1
1 1 +1 +1 +1
+ [ [( + ( )) ( )] [1 + +1 ]
2 0 2 (+1 ) (+1 )

(2 + 3) (29) +1 +1
,
12
1 (+1 +1 ) (+1 +1 )
(+1 , +1 )
2 (+1 )
[1
(+1 )
] (+1 +1 )

1 1
= (+1 ) (+1 + (+1 +1 ))
1 = +2 +1 .
0 (33)

By Lemma 1, if 1/2, then the sequence { , }0 generated
(+1 +1 )
by (16) is well defined, remains in (0 , ) for all 0, and
converges to a solution of (1).

+1 . To show uniqueness, let us assume that there exists a
(+1 ) +1 second solution of (1) in (0 , ). Then
1

By Lemma 2 and 0 < ( ) 1/, (0 )1 ( + ( ))

0
1
1

(+1 ) (0 ) [ + ( )] (0 )
0
2 (2 + 3) 1
+1 +
+ ( ) 0 (34)
2 12
0
2
3 (1 ) 3 1
+
[(1 ) 0 + 0 ]
2 ( )
0
3
4 (1 ) 4
+
2
+ < ( + ) 1.
2[ ( )] 4 ( ) 2
6 Journal of Applied Mathematics

By Banach Lemma, we can obtain that the inverse of the Table 1: Error computing results of (42).
1
linear operator 0 [ + ( )] exists and Newton method Method (16) with = 2/3, = 1/2
1 1 5.215 101 2.2371 103
( ) ( ) = [ + ( )] ( ) . 2 6.610 102 1.3667 109
0
(35) 3 14.017 104 3.1229 1028

We conclude that = . The proof of Theorem 3 is

completed. When 3/8,
+1
Proof of Theorem 4. By Lemma 1, we have
3 3 2
+1 = ( ) [( ) + 4( ) ( )
3 3 2 2 3
= ( ) [( ) + 4( ) ( ) + 5 ( ) ( ) + (2 2) ( ) ]
2 5 1
+ 5 ( ) ( ) + (2 2) ([( ) + ( )] )
3
( ) ] 3 2
< ( ) [5( ) ( )
5 1
(36)
([( ) + ( )] ) 2 5 3
+ 5 ( ) ( ) + ( ) ( ) ]
3 2 4
< ( ) [5( ) ( )
5 1
2 3
([( ) + ( )] )

+5 ( ) ( ) + 2( ) ]
5 3 2
5 1
= ( ) [4( ) ( )

([( ) + (
)] ) . 4
2 3
Similarly, + 4 ( ) ( ) + ( ) ]

+1 ([( ) + ( )] ) .
5 1

3 3 2 (40)
= ( ) [( ) + 4( ) ( )
2 3 Hence, we get
+ 5 ( ) ( ) + (2 2) ( ) ]
3 3+1 1
+1 5 5 +1

([( ) + ( )] )
5 1

< [ ] <( ) 3 ,
+1 4 2
3 3 2
> ( ) [( ) + 4( ) ( )
(1 2 ) 5
3 1


3
[ ] .
2 1 (2/5) [(5/2) ] 2
+ 5 ( ) ( ) ]
(41)
5 1
([( ) + ( )] ) . The proof of Theorem 4 is completed.
(37)
Hence, 4. Applications
3 32
+1
3 1
Example 1. Consider the case as follows:
< 2[ ] < 2 2 [ ] 1
+1 1 1
() = 1 + () () , (42)
3+1
4 0 +
0 +1
3 1 3+1
< < 2 23 23 [ ] = 2 . where the space is = [0, 1] with norm
0
(38) = max | ()| . (43)
01

Because = + = + ((1 2 ))/, This equation arises in the theory of the radiative transfer,
we obtain neutron transport, and kinetic theory of gasses. Let us define
the operator on by
(1 2 ) 3 1
3
[2] . (39) 1 1

(1 (1/2)) [2] () = () () () + 1. (44)
4 0 +
Journal of Applied Mathematics 7

Table 2: Error computing results (| |).

Step Newtons method Halleys method (3) Method (16) with = 2/3, = 1 Method (16) with = 1/2, = 0
=1 2.56574 102 2.13749 103 1.58011 103 5.74362 103
=2 4.8337 104 3.04697 109 1.19327 1011 1.98875 107
=3 1.75164 107 8.84002 1027 3.90354 1044 8.35734 1021
=4 2.30119 1014 2.15878 1079 4.47038 10174 6.20201 1061

Then, for 0 = 1, we can obtain where = (1 , 2 , . . . , 8 ) , = (1, 1, . . . , 1) , =

1 ( )8,=1 , and = (12 , 22 , . . . , 82 ) . We also get
1 ln 2
= 2 max = = 0.3465,
4 01 0 + 2 1
() = diag {1 , 2 , . . . , 8 } . (51)
2
= 0, = = 0.3465, = (0 )1 = 1.5304,
After 3 iterative steps, we can obtain the numerical
= (0 ) (0 ) = 0.2652,
1
solution of (42) by method (16) with = 2/3, = 1/2, and
the solution = (1.2751, 1.4418, 1.5595, 1.6486, 1.7189,
= = 0.1406 < 0.4852, = 0.2870, 1.7761, 1.8236, 1.8638) , and we present the error computing
result of (42) in Table 1.
= 3.485, = 0.08240.
(45) Example 2. Now we employ iterative methods (16) to solve
the equation and compare these methods with Newtons
That means the hypotheses of the theorem are satisfied
method, Halleys method, and modified Halleys methods
and for = 1/2 > 3/8 the error bound becomes
(16). We define as follows:


() = , > 2, (0, +) . (52)

2 3 1
(1 ) 5
[ ] Denote = , by (16) +1 = V( ), where V() =
3 2
(1 (2/5)) [(5/2) ] (46) [1 (1/2)() + (/2)2 ()](())/( ()), () = ( (
()/ ()) ())/( ()). We have V ( ) = V ( ) =
0.2634
V ( ) = 0 if
= 3
(0.07370)3 1 .
1 0.8944 (0.07370)
2
= , = 1. (53)
For = 1, 2, 3, we get 3
So, we get the convergence of the sequence { } generated
1 1 2.2371 10 ,
3
by modified Halleys method (16) with four orders when =

2 2 1.3667 10 ,
9 2/3, = 1.
(47)
Now, we compare some of these methods for the calculus
3 3 3.1229 1028 . of = 4 16 = 2. We analyze the errors for these

methods with Newtons method, Halleys method, and the
In practical computation, we use a discretization process. family of new modified Halleys methods (16). In these cases,
By Gauss-Legendre quadrature formula with 8 nodes: we have taken = 4, 0 = 2.2 (see Table 2).
1 8
() ( ) , (48) Conflict of Interests
0 =1
The authors declare that there is no conflict of interests
we approximate the integral equation (42), where the nodes regarding the publication of this paper.
and the weights are known. Denote ( ) by , =
1, 2, . . . 8, so we can transform (42) into the following system
of nonlinear equations: Acknowledgments
1 8 This work is supported by the National Basic Research
= 1 + , (49) 973 Program of China (no. 2011JB105001), National Natural
4 =1
Science Foundation of China (Grant no. 11371320), Zhejiang
Natural Science Foundation (Grant no. LZ14A010002), Foun-
where = ( /( + )). Then, we rewrite the above system
dation of Science and Technology Department (Grant no.
in the matrix form. Consider
2013C31084) of Zhejiang Province, and Scientific Research
1 Fund of Zhejiang Provincial Education Department (nos.
() = , (50)
4 Y201431077 and Y201329420).
8 Journal of Applied Mathematics
References
[1] J. M. Ortega and W. C. Rheinboldt, Iterative Solution of Nonlin-
ear Equations in Several Variables, Academic Press, New York,
NY, USA, 1970.
[2] L. V. Kantorovic, On Newtons method, Akademiya Nauk
SSSR. Trudy Matematicheskogo Instituta Imeni V. A. Steklova,
vol. 28, pp. 104144, 1949 (Russian).
[3] I. K. Argyros and S. Hilout, Extending the Newton-
Kantorovich hypothesis for solving equations, Journal of
Computational and Applied Mathematics, vol. 234, no. 10, pp.
29933006, 2010.
[4] I. K. Argyros, On the Newton-Kantorovich hypothesis for
solving equations, Journal of Computational and Applied Math-
ematics, vol. 169, no. 2, pp. 315332, 2004.
[5] I. K. Argyros, On the comparison of a weak variant of
the Newton-Kantorovich and Miranda theorems, Journal of
Computational and Applied Mathematics, vol. 166, no. 2, pp.
585589, 2004.
[6] J. M. Gutierrez and M. A. Hernandez, New recurrence relations
for Chebyshev method, Applied Mathematics Letters, vol. 10, no.
2, pp. 6365, 1997.
[7] J. A. Ezquerro, D. Gonzalez, and M. A. Hernandez, A mod-
ification of the classic conditions of Newton-Kantorovich for
Newtons method, Mathematical and Computer Modelling, vol.
57, no. 3-4, pp. 584594, 2013.
[8] S. Amat, I. K. Argyros, S. Busquier, R. Castro, S. Hilout, and
S. Plaza, Newton-type methods on Riemannian manifolds
under Kantorovich-type conditions, Applied Mathematics and
Computation, vol. 227, pp. 762787, 2014.
[9] M. A. Hernandez and M. A. Salanova, Modification of the
Kantorovich assumptions for semilocal convergence of the
Chebyshev method, Journal of Computational and Applied
Mathematics, vol. 126, no. 1-2, pp. 131143, 2000.
[10] Q. B. Wu and Y. Q. Zhao, Third-order convergence theorem
by using majorizing function for a modified Newton method in
Banach space, Applied Mathematics and Computation, vol. 175,
no. 2, pp. 15151524, 2006.
[11] R. Lin, Y. Zhao, Z. Smarda, Y. Khan, and Q. Wu, Newton-
Kantorovich and Smale uniform type convergence theorem for
a deformed Newton method in Banach spaces, Abstract and
Applied Analysis, vol. 2013, Article ID 923898, 8 pages, 2013.
[12] I. K. Argyros and S. K. Khattri, Weaker Kantorovich type
criteria for inexact Newton methods, Journal of Computational
and Applied Mathematics, vol. 261, pp. 103117, 2014.
[13] S. Weerakoon and T. G. I. Fernando, A variant of Newtons
method with accelerated third-order convergence, Applied
Mathematics Letters, vol. 13, no. 8, pp. 8793, 2000.
[14] H. Ren and I. K. Argyros, On the semi-local convergence of
Halleys method under a center-Lipschitz condition on the sec-
ond Frechet derivative, Applied Mathematics and Computation,
vol. 218, no. 23, pp. 1148811495, 2012.
[15] J. S. Kou, Y. T. Li, and X. H. Wang, On modified Newton
methods with cubic convergence, Applied Mathematics and
Computation, vol. 176, no. 1, pp. 123127, 2006.
[16] D. Chen, I. K. Argyros, and Q. S. Qian, A note on the
Halley method in Banach spaces, Applied Mathematics and
Computation, vol. 58, no. 2-3, pp. 215224, 1993.
[17] I. K. Argyros, The super-Halley method using divided differ-
ences, Applied Mathematics Letters, vol. 10, no. 4, pp. 9195,
1997.
[18] J. M. Gutierrez and M. A. Hernandez, Recurrence relations
for the super-Halley method, Computers & Mathematics with
Applications, vol. 36, no. 7, pp. 18, 1998.
[19] S. Amat, S. Busquier, and J. M. Gutierrez, Third-order iterative
methods with applications to Hammerstein equations: a unified
approach, Journal of Computational and Applied Mathematics,
vol. 235, no. 9, pp. 29362943, 2011.
[20] J. A. Ezquerro and M. A. Hernandez, A modification of the
super-Halley method under mild differentiability conditions,
Journal of Computational and Applied Mathematics, vol. 114, no.
2, pp. 405409, 2000.
[21] J. A. Ezquerro and M. A. Hernandez, On the -order of
the Halley method, Journal of Mathematical Analysis and
Applications, vol. 303, no. 2, pp. 591601, 2005.
[22] B. Neta and M. Scott, On a family of Halley-like methods to
find simple roots of nonlinear equations, Applied Mathematics
and Computation, vol. 219, no. 15, pp. 79407944, 2013.
[23] R. F. Lin, Y. Q. Zhao, Z. Smarda, Q. B. Wu, and Y. Khan,
Newton-Kantorovich convergence theorem of a new modified
Halleys method family in a Banach space, Advances in Differ-
ence Equations, vol. 2013, article 325, 2013.
[24] J. M. Gutierrez and M. A. Hernandez, An acceleration of
Newtons method: super-Halley method, Applied Mathematics
and Computation, vol. 117, no. 2-3, pp. 223239, 2001.
[25] M. A. Hernandez and M. A. Salanova, A family of Chebyshev-
Halley type methods, International Journal of Computer Math-
ematics, vol. 47, pp. 5963, 1993.
[26] J. M. Gutierrez and M. A. Hernandez, A family of Chebyshev-
Halley type methods in Banach spaces, Bulletin of the Aus-
tralian Mathematical Society, vol. 55, no. 1, pp. 113130, 1997.
[27] J. A. Ezquerro and M. A. Hernandez, A uniparametric Halley-
type iteration with free second derivative, International Journal
of Pure and Applied Mathematics, vol. 6, no. 1, pp. 103114, 2003.
[28] S. Weerakoon and T. G. I. Fernando, A variant of Newtons
method with accelerated third-order convergence, Applied
Mathematics Letters, vol. 13, no. 8, pp. 8793, 2000.
[29] M. Frontini and E. Sormani, Some variant of Newtons method
with third-order convergence, Applied Mathematics and Com-
putation, vol. 140, no. 2-3, pp. 419426, 2003.
[30] H. H. H. Homeier, A modified Newton method for rootfinding
with cubic convergence, Journal of Computational and Applied
Mathematics, vol. 157, no. 1, pp. 227230, 2003.
[31] J. Kou, Y. Li, and X. Wang, Modified Halleys method free from
second derivative, Applied Mathematics and Computation, vol.
183, no. 1, pp. 704708, 2006.
[32] I. K. Argyros, D. Chen, and Q. Qian, An inverse-free Jarratt
type approximation in a Banach space, Approximation Theory
and Its Applications, vol. 12, no. 1, pp. 1930, 1996.
[33] J. A. Ezquerro and M. A. Hernandez, Relaxing convergence
conditions for an inverse-free Jarratt-type approximation, Jour-
nal of Computational and Applied Mathematics, vol. 83, no. 1, pp.
131135, 1997.
Advances in Advances in Journal of Journal of
Operations Research
Hindawi Publishing Corporation
Decision Sciences
Hindawi Publishing Corporation
Applied Mathematics
Hindawi Publishing Corporation
Algebra
Hindawi Publishing Corporation
Probability and Statistics
Hindawi Publishing Corporation
http://www.hindawi.com Volume 2014 http://www.hindawi.com Volume 2014 http://www.hindawi.com Volume 2014 http://www.hindawi.com Volume 2014 http://www.hindawi.com Volume 2014

The Scientific International Journal of

World Journal
Hindawi Publishing Corporation
Differential Equations
Hindawi Publishing Corporation
http://www.hindawi.com Volume 2014 http://www.hindawi.com Volume 2014

Submit your manuscripts at

http://www.hindawi.com

International Journal of Advances in

Combinatorics
Hindawi Publishing Corporation
Mathematical Physics
Hindawi Publishing Corporation
http://www.hindawi.com Volume 2014 http://www.hindawi.com Volume 2014

Journal of Journal of Mathematical Problems Abstract and Discrete Dynamics in

Complex Analysis
Hindawi Publishing Corporation
Mathematics
Hindawi Publishing Corporation
in Engineering
Hindawi Publishing Corporation
Applied Analysis
Hindawi Publishing Corporation
Nature and Society
Hindawi Publishing Corporation
http://www.hindawi.com Volume 2014 http://www.hindawi.com Volume 2014 http://www.hindawi.com Volume 2014 http://www.hindawi.com Volume 2014 http://www.hindawi.com Volume 2014

International
Journal of Journal of
Mathematics and
Mathematical
Discrete Mathematics
Sciences

Journal of International Journal of Journal of

Hindawi Publishing Corporation Hindawi Publishing Corporation Volume 2014

http://www.hindawi.com
Function Spaces
Hindawi Publishing Corporation
Volume 2014 http://www.hindawi.com http://www.hindawi.com
Stochastic Analysis
Hindawi Publishing Corporation
Optimization
Hindawi Publishing Corporation
Volume 2014 http://www.hindawi.com Volume 2014 http://www.hindawi.com Volume 2014