See discussions, stats, and author profiles for this publication at: https://www.researchgate.

net/publication/318101146

Fixed point type iterative method for solving nonlinear equations and
polynomiography

Article  in  Far East Journal of Mathematical Sciences · July 2017

DOI: 10.17654/MS102020251

CITATIONS READS
8 1,402

5 authors, including:

Waqas Nazeer Muhmmad Tanveer

Government College University, Lahore University of Lahore
197 PUBLICATIONS   818 CITATIONS    48 PUBLICATIONS   290 CITATIONS   

SEE PROFILE SEE PROFILE

Young Chel Kwun

Dong-A University
218 PUBLICATIONS   1,453 CITATIONS   

SEE PROFILE

Some of the authors of this publication are also working on these related projects:

3th International Conference on Combinatorics, Cryptography and Computation View project

Some fixed point results in the generation of fractals View project

All content following this page was uploaded by Waqas Nazeer on 02 July 2017.

The user has requested enhancement of the downloaded file.

 Far East Journal of Mathematical Sciences (FJMS)
© 2017 Pushpa Publishing House, Allahabad, India
http://www.pphmj.com
http://dx.doi.org/10.17654/MS102020251
Volume 102, Number 2, 2017, Pages 251-269 ISSN: 0972-0871

FIXED POINT TYPE ITERATIVE METHOD FOR

SOLVING NONLINEAR EQUATIONS AND
POLYNOMIOGRAPHY

Young Chel Kwun1, Muhammad Fahad2, Waqas Nazeer3,

Muhmmad Tanveer4 and Shin Min Kang5,∗
1
Department of Mathematics
Dong-A University
Busan 49315, Korea
e-mail: yckwun@dau.ac.kr
2
Department of Mathematics
Bahauddin Zakariya University
Multan, Pakistan
e-mail: fahad.therahbar@gmail.com
3
Division of Science and Technology
University of Education
Lahore, Pakistan
e-mail: nazeer.waqas@ue.edu.pk
4
Department of Mathematics and Statistics
University of Lahore
Lahore, Pakistan
e-mail: tanveer.7955180@yahoo.com
Received: December 24, 2016; Accepted: May 6, 2017
2010 Mathematics Subject Classification: 65H05, 65D32.
Keywords and phrases: nonlinear equation, polynomiography, fixed point method, Newton’s
method, new iterative method.
This work was supported by the Dong-A University research fund.
∗
Corresponding author
252 Y. C. Kwun, M. Fahad, W. Nazeer, M. Tanveer and S. M. Kang
5
Department of Mathematics and RINS
Gyeongsang National University
Jinju 660-701, Korea
e-mail: smkang@gnu.ac.kr

Abstract

In this paper, we present a new third-order fixed point iterative method

for solving nonlinear functional equations. The new third-order fixed
point iterative method converges faster than the methods discussed in
Table 1. The comparison tables demonstrate the faster convergence of
the new third-order fixed point method. We also present some
examples of polynomiographs for different complex polynomials
equation. We use new third-order fixed point iterative method
(NFIM), for solving nonlinear complex equations, to create images
that are quite new, different from images by Newton’s method and
interesting from the aesthetic point of view.

1. Introduction

The problem, to recall, is solving equations in one variable. We are given

a function f and would like to find at least one solution of the equation
f ( x ) = 0. Note that, we do not put any restrictions on the function f; we
need to be able to evaluate the function; otherwise, we cannot even check
that a given x = α is true, that is f (α) = 0. In reality, the more ability to be
able to evaluate the function does not suffice. We need to assume some kind
of “good behavior”. The more we assume, the more potential we have, on the
one hand, to develop fast iteration scheme for finding the root. At the same
time, the more we assume, the fewer the functions are going to satisfy our
assumptions! This is a fundamental paradigm in numerical analysis.
We know that one of the fundamental algorithm for solving nonlinear
equations is so-called fixed point iteration method. In order to use fixed point
iteration method, we need the following information:
1. We need to know that there is a solution of the equation.
 Fixed Point Type Iterative Method for Solving Nonlinear Equations 253

2. We need to know approximately where the solution is (i.e. an

approximation to the solution).
In the fixed-point iteration method for solving nonlinear equation
f ( x ) = 0, the equation is usually rewritten as

x = g ( x ), (1.1)
where

(i) there exists [a, b] such that g ( x ) ∈ [a, b] for all x ∈ [a, b],

(ii) there exists a real number L < 1 such that g ′( x ) ≤ L < 1 for all
x ∈ (a , b ) .

Considering the following iteration scheme

xn +1 = g ( xn ), n = 0, 1, 2, ..., (1.2)

and starting with a suitable initial guess x0 , we build up a sequence of

approximations, say {xn }, for the solution of nonlinear equation, say α. The
scheme will converge to α, provided that
(i) the initial guess x0 is chosen in the interval [a, b].

(ii) g ′( x ) < 1 for all x.

(iii) g has continuous derivative on (a, b).

(iv) a ≤ g ( x ) ≤ b for all x ∈ [a , b].

It is well known that the fixed point method has first order convergence.
The order of convergence for the sequence of approximations derived from
an iteration method is defined in the literature, as

Definition 1.1. Let {xn } converge to α. If there exist an integer constant

p, and real positive constant C such that

xn + 1 − α
lim = C,
n→∞ ( xn − α ) p
then p is called the order and C the constant of convergence.
254 Y. C. Kwun, M. Fahad, W. Nazeer, M. Tanveer and S. M. Kang

To determine the order of convergence of the sequence {xn }, let us

consider the Taylor expansion of g ( xn ) ,

g ′( x ) g ′′( x )
g ( xn ) = g ( x ) + ( xn − x ) + ( xn − x )2 + "
1! 2!

g (k )
+ ( xn − x ) k + " . (1.3)
k!

Using (1.1) and (1.2) in (1.3), we have

g ′( x ) g ′′( x ) g (k )
xn +1 − x = ( xn − x ) + ( x n − x )2 + " + ( x n − x )k + "
1! 2! k!

and we can state the following result [17].

Theorem 1.2. Suppose g ∈ C p [a , b]. If g (k ) ( x ) = 0, for k = 1, 2, ...,

p − 1 and g ( p ) ( x ) ≠ 0, then the sequence {xn } is of order p (see [1]).

For the equation (1.2), following the approach of [17], there exist λ i ;
i = 1, 2, ..., k such that

λ x + λ2 x2 + " + λk xk + g(x)
x= 1 = g λ ( x ), (1.4)
1 + λ1 + λ 2 x + " + λ k x k −1

where λ i ; i = 1, 2, ..., k are to be determined from the following system of

linear equations:

k
∑
i =t
(i − 1) (i − 2) " (i − t + 1) xi − k λ i = − g (t ) , t = 1, 2, ..., k . (1.5)

Now let us discuss some special cases of the iteration method (1.4) and (1.5):

(a) For k = 1, we have

λ x + g(x)
x = gλ ( x) = 1 , (1.6)
1 + λ1
 Fixed Point Type Iterative Method for Solving Nonlinear Equations 255

where λ1 = − g ′( x ) , and (1.6) yields

− g ′( x ) x + g ( x )
x= . (1.7)
1 − g ′( x )

(b) For k = 3, one can obtain

λ x + λ 2 x 2 + λ3 x3 + g ( x )
x = gλ ( x) = 1 , (1.8)
1 + λ1 + λ 2 x + λ 3 x 2

where

x 2 g ′′′( x ) g ′′′( x )
λ1 = − g ′( x ) + xg ′′( x ) − , λ 2 = − g ′′( x ) + xg ′′′( x ), λ 3 = ,
2 2

and (1.8) gives (1.7) again.

In this way for any k, it can be easily seen that x = g λ ( x ) =

− g ′( x ) x + g ( x )
. Thus the iteration method (1.4) and (1.5) reduced to (1.7).
1 − g ′( x )
This formulation allows us to suggest the following iteration method for
solving nonlinear equation (1.1)

− xn g ′( xn ) + g ( xn )
xn = , g ′( xn ) ≠ 1. (1.9)
1 − g ′( xn )

which is new second order iterative method having convergence of order two
[16, 18].
During the last century, the numerical techniques for solving nonlinear
equations have been successfully applied (see, e.g., [2-16, 19, 20] and the
references therein). Lukic et al. [15] discussed the Newton’s method with
accelerated convergence modified by an aggregation operator.
In this paper, a new third-order fixed point iterative method for solving
nonlinear functional equations having (NFIM) convergence of order three
has been presented. The proposed new third-order fixed point iterative
method will be applied to solve some illustrative examples, in order to assess
its validity and accuracy.
256 Y. C. Kwun, M. Fahad, W. Nazeer, M. Tanveer and S. M. Kang

2. Iterative Method

Let f : X ⊂ R → R be a real valued function and consider that the

nonlinear equation f ( x ) = 0 (or x = g ( x )) , where g ( x ) : X ⊂ R → R.
Then, if we use harmonic mean instead of g ′( x ) in (1.9), we develop a new
third-order fixed point iterative method as follows:

2( g ( xn ) − xn )
xn +1 = xn + , g ′( xn ) + g ′(vn ) ≠ 2, (2.1)
2 − g ′( xn ) − g ′(vn )

− xn g ′( xn ) + g ( xn )
vn = , g ′( xn ) ≠ −1.
1 − g ′( xn )

This is so called new third-order fixed point iterative method. In the

construction of new third-order fixed point iterative method, we just replace
g ′( xn ) + g ′(vn )
g ′( xn ) by arithmetic mean in new second order iterative
2
method [16].

3. Convergence Analysis

Now we discuss the convergence of (2.1) by Taylor’s expansion and also

by computing the derivatives.

Theorem 3.1. Let f : D ⊂ R → R for an open interval D, and consider

that the nonlinear equation f ( x ) = 0 (or x = g ( x )) has a simple root
α ∈ D, where g : D ⊂ R → R be sufficiently smooth in the neighborhood
of the root α. Then the order of convergence of new third-order fixed point
iterative method (2.1) is at least 3.

Proof. The new third-order fixed point iterative method is given by

2( g ( xn ) − xn )
xn +1 = xn + , g ′( xn ) + g ′(vn ) ≠ 2,
2 − g ′( xn ) − g ′(vn )

− xn g ′( xn ) + g ( xn )
vn = , g ′( xn ) ≠ −1.
1 − g ′( xn )
 Fixed Point Type Iterative Method for Solving Nonlinear Equations 257

Let α be a simple zero of f , en = xn − α, where en is the error term

involved at the nth step of new third-order fixed point iterative method (2.1)
and

g (α) = α. (3.1)

By Taylor’s expansion, we have

e2 e3
g ( xn ) = g (α ) + en g ′(α ) + n g ′′(α ) + n g ′′′(α ) + " , (3.2)
2! 3!

e2
g ′( xn ) = g ′(α ) + en g ′′(α ) + n g ′′′(α ) + " (3.3)
2!

and

⎛ ⎛ e2 e3 ⎞⎞
vn = ⎜ − (α + en ) ⎜ g (α ) + en g ′(α ) + n g ′′(α ) + n g ′′′(α ) + "⎟ ⎟
⎜ ⎜ 2! 3! ⎟⎟
⎝ ⎝ ⎠⎠

−1
⎛ en2 ⎞
× ⎜⎜1 − g ′(α) − en g ′′(α) − g ′′′(α) − "⎟⎟
⎝ 2! ⎠

e 2 g ′′(α )
=α− n . (3.4)
2! 1 − g ′(α )

Now using (3.1)-(3.4) in (2.1), we have

1 3 g ′′′(α) g ′(α) − g ′′′(α ) + 3g ′′2 (α)

α + en +1 = α + e + O (en4 )
12 n (1 − g ′(α)) 2

en +1 = Men3 − " ,

where

1 g ′′′(α) g ′(α) − g ′′′(α) + 3g ′′2 (α )

M = .
12 (1 − g ′(α))2

This completes the proof. ~

258 Y. C. Kwun, M. Fahad, W. Nazeer, M. Tanveer and S. M. Kang

Theorem 3.2. Let f : X ⊂ R → R for an open interval X and consider

that the nonlinear equation f ( x ) = 0 (or x = g ( x )) has a simple root α ∈ X ,
where g ( x ) : X ⊂ R → R be sufficiently smooth in the neighborhood of α.
Then the convergence order of new third-order fixed point iterative method
given in (2.1) is at least three.

Proof. To analyze the convergence of new third-order fixed point

iterative method (2.1), let

2( g ( x ) − x )
H ( x) = x + , g ′( x ) + g ′(v ) ≠ 2,
2 − g ′( x ) − g ′(v )

− xg ′( x ) + g ( x )
v= , g ′( x ) ≠ −1,
1 − g ′( x )

and α be a simple zero of f and f (α ) = 0 (or g (α ) = α ). Then we can easily

deduce by using the software Maple that

H (α) = α,

H ′(α ) = 0,

H ′′(α) = 0,

3( g ′′(α ))2 − g ′′′(α) + g ′′′(α) g ′(α)

H ′′′(α) = .
2(1 − g ′(α))2

Now, since H ′′′(α) ≠ 0, according to theorem, new third-order fixed point

iterative method (2.1) has third order convergence. ~

4. Numerical Examples

In this section, we included some nonlinear functions to illustrate the

efficiency of our developed new third-order fixed point iterative method
(NFIM). We compare the NFIM with Fixed point method (FPM), and new
second order iterative method [16] (NIM) as shown in Table 1.
 Fixed Point Type Iterative Method for Solving Nonlinear Equations 259

Table 1. The numerical comparisons of new third-order fixed point iterative

method with fixed point method and new second order iterative method [16].
The columns represent the number of iterations N and the magnitude f (x)
of f ( x ) at the final estimate xn
Comparison of FPM, NIM and NFIM
Method N f ( xn +1 ) x n +1

f ( x ) = x + ln( x − 2 ), g ( x ) = 2 + e − x
x0 = 2.2
NIM 4 5.895526e – 46
FPM 20 7.263444e – 20 2.120028238987641229484687975272
NFIM 3 1.381044e – 54
10
f ( x ) = x 3 + 4 x 2 − 10, g ( x ) =
4+x
x0 = 1.5
FPM 22 4.376963e – 20
NIM 4 1.357704e – 40 1.365230013414096845760806828982
NFIM 3 5.632519e – 60

f ( x ) = x 2 − e x − 3x + 2, g ( x ) = ln( x 2 − 3x + 2 )
x0 = 0.8
FPM Diverged
NIM 6 7.068808e – 48 0.257530285439860760455367304937
NFIM 5 8.507740e – 65
1
f ( x ) = x 3 + x 2 − 3x − 2, g ( x ) = (2 + 3x − x 2 ) 3
x0 = 1
FPM 14 3.533701e – 21
NIM 5 4.056640e – 33 1.618033988749894848204586834366
NFIM 4 1.125979e – 87
1 1
f ( x ) = x 3 + 4 x 2 + 8 x + 8, g ( x ) = −⎛⎜1 + x 2 + x 3 ⎞⎟
⎝ 2 8 ⎠
x0 = −1.9
FPM 62 9.569772e – 20
NIM 5 1.630799e – 41 −2.000000000000000000000000000000
NFIM 3 1.689204e – 32
260 Y. C. Kwun, M. Fahad, W. Nazeer, M. Tanveer and S. M. Kang

5. Polynomiographs

Polynomials are one of the most significant objects in many fields of

mathematics. Polynomial root-finding has played a key role in the history of
mathematics. It is one of the oldest and most deeply studied mathematical
problems. The last interesting contribution to the polynomials root finding
history was made by Kalantari [22], who introduced the polynomiography.
As a method which generates nice looking graphics, it was patented by
Kalantari in USA in 2005 [23, 24]. Polynomiography is defined to be “the art
and science of visualization in approximation of the zeros of complex
polynomials, via fractal and non fractal images created using the
mathematical convergence properties of iteration functions” [22]. An
individual image is called a “polynomiograph”. Polynomiography combines
both art and science aspects.
Polynomiography gives a new way to solve the ancient problem by using
new algorithms and computer technology. Polynomiography is based on the
use of one or an infinite number of iteration methods formulated for the
purpose of approximation of the root of polynomials e.g. Newton’s method,
Halley’s method etc. The word “fractal”, which partially appeared in the
definition of polynomiography, was coined by the famous mathematician
Benoit Mandelbrot [21]. Both fractal images and polynomiographs can be
obtained via different iterative schemes. Fractals are self-similar has typical
structure and independent of scale. On the other hand, polynomiographs are
quite different. The “polynomiographer” can be controlled the shape and
designed in a more predictable way by using different iteration methods to
the infinite variety of complex polynomials. Generally, fractals and
polynomiographs belong to different classes of graphical objects.
Polynomiography has diverse applications in math, science, education, art
and design. According to Fundamental Theorem of Algebra, any complex
polynomial with complex coefficients {an , an −1, ..., a1 , a0 }:

p( z ) = an z n + an −1z n −1 + " + a1z + a0 (5.1)

or by its zeros (roots) {r1, r2 , ..., rn −1, rn }:

 Fixed Point Type Iterative Method for Solving Nonlinear Equations 261

p( z ) = ( z − r1 ) ( z − r2 ) " ( z − rn ) (5.2)
of degree n has n roots (zeros) which may or may not be distinct. The degree
of polynomial describes the number of basins of attraction and placing roots
on the complex plane manually localization of basins can be controlled.
Usually, polynomiographs are colored based on the number of iterations
needed to obtain the approximation of some polynomial root with a given
accuracy and a chosen iteration method. The description of
polynomiography, its theoretical background and artistic applications are
described in [22-24].

6. Iteration

During the last century, the different numerical techniques for solving
nonlinear equation f ( x ) = 0 (or x = g ( x )) have been successfully applied.
Now we define:
− xn g ′( xn ) + g ( xn )
vn = , g ′( xn ) ≠ −1, n = 0, 1, 2, ...,
1 − g ′( xn )

2( g ( xn ) − xn )
xn +1 = xn + , g ′( xn ) + g ′(vn ) ≠ 2.
2 − g ′( xn ) − g ′(vn )

This is so-called new third-order fixed point iterative method (NFIM) for
solving nonlinear equations. Let p( z ) be the complex polynomial. Then

− z n g ′( z n ) + g ( z n )
vn = , g ′( xn ) ≠ −1, n = 0, 1, 2, ...,
1 − g ′( z n )

2( g ( z n ) − z n )
z n +1 = z n + , g ′( z n ) + g ′(vn ) ≠ 2, (6.1)
2 − g ′( z n ) − g ′(vn )

where z0 ∈ C is a starting point, is so-called new third-order fixed point

iterative method (NFIM) for solving nonlinear complex equations. The
sequence {zn }∞ ∗
n =0 is called the orbit of the point z0 converges to a root z of

p then, we say that z0 is attracted to z ∗. A set of all such starting points for
which {zn }∞ ∗ ∗
n =0 converges to root z is called the basin of attraction of z .
262 Y. C. Kwun, M. Fahad, W. Nazeer, M. Tanveer and S. M. Kang

7. Convergence Test

In the numerical algorithms that are based on iterative processes we need

a stopping criterion for the process, that is, a test that tells us that the process
has converged or it is very near to the solution. This type of test is called a
convergence test. Usually, in the iterative process that use a feedback, like
the root finding methods, the standard convergence test has the following
form:

z n +1 − z n < ε, (7.1)

where zn +1 and zn are two successive points in the iteration process and
ε > 0 is a given accuracy. In this paper we also use the stop criterion (7.1).

8. Applications

The applications of new third-order fixed point iterative method (NFIM)

for solving nonlinear complex equations perturbs the shape of polynomial
basins and makes the polynomiographs look more “fractal.” The aim of using
new third-order fixed point iterative method (NFIM) for solving nonlinear
complex equations to create images that are quite new, different from images
by Newton’s method and interesting from the aesthetic point of view.
In this section, we present some examples of polynomiographs for
different complex polynomials equation p( z ) = 0 and some special
polynomials. The different colors of a images depend upon number of
iterations to reach a root with given accuracy ε = 0.000001. One can obtain
infinitely many nice looking polynomiographs by changing parameter k;
where k = 50 is the upper bound of the number of iterations.

8.1. Polynomiograph for z 2 − 1 = 0

Complex polynomial equation z 2 − 1 = 0, having two roots: 1, −1. The

polynomiograph is presented in the following figure with two distinct basins
of attraction to the two roots of the polynomial z 2 − 1 = 0.
 Fixed Point Type Iterative Method for Solving Nonlinear Equations 263

Figure 1. Polynomiography for z 2 − 1 = 0.

8.2. Polynomiograph for z 3 − 1 = 0

1
Complex polynomial equation z 3 − 1 = 0, having three roots: 1, − −
2
3 1 3
I, − + I . The polynomiograph is presented in the following figure
2 2 2
with three distinct basins of attraction to the three roots of the polynomial
z 3 − 1 = 0.

Figure 2. Polynomiography for z 3 − 1 = 0.

264 Y. C. Kwun, M. Fahad, W. Nazeer, M. Tanveer and S. M. Kang

8.3. Polynomiograph for z 4 − 1 = 0

Complex polynomial equation z 4 − 1 = 0, having four roots: −1, − I , I, 1.

The polynomiograph is presented in the following figure with four distinct
basins of attraction to the four roots of the polynomial z 4 − 1 = 0.

Figure 3. Polynomiography for z 4 − 1 = 0.

8.4. Polynomiograph for z 4 − z 3 + z 2 − z + 1 = 0

Complex polynomial equation z 4 − z 3 + z 2 − z + 1 = 0, having four

roots: –0.309017 – 0.951057I, –0.309017 + 0.951057I, 0.809017 –
0.587785I, 0.809017 + 0.587785I. The polynomiograph is presented in the
following figure with four distinct basins of attraction to the four roots of the
polynomial z 4 − z 3 + z 2 − z + 1 = 0 = 0.
 Fixed Point Type Iterative Method for Solving Nonlinear Equations 265

Figure 4. Polynomiography for z 4 − z 3 + z 2 − z + 1 = 0.

8.5. Polynomiograph for z ( z 2 + 1) ( z 2 + 4) = 0

Complex polynomial equation z ( z 2 + 1) ( z 2 + 4) = 0, having five roots:

0, 0 − 1I , 0 + 1I , 0 − 2 I , 0 + 2 I . The polynomiograph is presented in the
following figure with five distinct basins of attraction to the five roots of the
polynomial z ( z 2 + 1) ( z 2 + 4) = 0.

Figure 5. Polynomiography for z ( z 2 + 1) ( z 2 + 4 ) = 0.

266 Y. C. Kwun, M. Fahad, W. Nazeer, M. Tanveer and S. M. Kang

8.6. Polynomiograph for z 5 − 1 = 0

−1
Complex polynomial equation z 5 − 1 = 0, having five roots: 1, +
4
5 I 2 5 + 5 −1 5 I 2 5 − 5 −1 5 I 2 5− 5
+ , − + , − − ,
4 4 4 4 4 4 4 4
−1 5 I 2 5+ 5
+ − . The polynomiograph is presented in the
4 4 4
following figure with five distinct basins of attraction to the five roots of the
polynomial z 5 − 1 = 0.

Figure 6. Polynomiography for z 5 − 1 = 0.

8.7. Polynomiograph for z 20 − 1 = 0

Complex polynomial equation z 20 − 1 = 0. The polynomiograph is

presented in the following figure with twenty distinct basins of attraction to
the twenty roots of the polynomial z 20 − 1 = 0.
 Fixed Point Type Iterative Method for Solving Nonlinear Equations 267

Figure 7. Polynomiography for z 20 − 1 = 0.

9. Conclusions

A new third-order fixed point iterative method for solving nonlinear

functions has been established. We can conclude from Table 1 that
1. The modified NFIM has convergence of order three.
2. By using some examples the performance of NFIM is also discussed.
The NFIM is performing very well in comparison to fixed point
method and new iterative method [16] as discussed in Table 1.
3. We also presented some examples of polynomiographs for different
complex polynomials equation p( z ) = 0 and some special
polynomials. We used new third-order fixed point iterative method
(NFIM) for solving nonlinear complex equations to create images that
are quite new, different from images presented in [20] and interesting
from the aesthetic point of view.

References

[1] E. Isaacson and H. B. Keller, Analysis of Numerical Methods, John Wiley &
Sons, New York, NY, U.S.A., 1966.
268 Y. C. Kwun, M. Fahad, W. Nazeer, M. Tanveer and S. M. Kang
[2] R. L. Burden and J. D. Faires, Numerical Analysis, 6th ed., Brooks/Cole
Publishing Company, Calif., 1997.
[3] J. Stoer and R. Bulirsch, Introduction to Numerical Analysis, 3rd ed., Springer-
Verlag, New York, 2002.
[4] A. Quarteroni, R. Sacco and F. Saleri, Numerical Mathematics, Springer Verlag,
New York, 2000.
[5] I. K. Argyros, A note on the Halley method in Banach spaces, Appl. Math.
Comput. 58 (1993), 215-224.
[6] J. M. Gutiérrez and M. A. Hernández, An acceleration of Newton’s method:
super-Halley method, Appl. Math. Comput. 117(2-3) (2001), 223-239.
[7] J. M. Gutiérrez and M. A. Hernandez, A family of Chebyshev-Halley type
methods in Banach spaces, Bull. Austral. Math. Soc. 55 (1997), 113-130.
[8] E. Babolian and J. Biazar, On the order of convergence of Adomian method, Appl.
Math. Comput. 130(2-3) (2002), 383-387.
[9] S. Abbasbandy, Improving Newton-Raphson method for nonlinear equations by
modified Adomian decomposition method, Appl. Math. Comput. 145(2-3) (2003),
887-893.
[10] E. Babolian and J. Biazar, Solution of nonlinear equations by modified Adomian
decomposition method, Appl. Math. Comput. 132(1) (2002), 167-172.
[11] T. J. McDougall and S. J. Wotherspoon, A simple modification of Newton’s
method to achieve convergence of order (1 + 2 ) , Appl. Math. Lett. 29 (2014),
20-25.
[12] S. Weerakoon and T. G. I. Fernando, A variant of Newton’s method with
accelerated third-order convergence, Appl. Math. Lett. 13 (2000), 87-93.
[13] H. Homeier, A modified Newton method for rootfinding with cubic convergence,
J. Comput. Appl. Math. 157(1) (2003), 227-230.
[14] M. Frontini and E. Sormani, Some variant of Newton’s method with third-order
convergence, Appl. Math. Comput. 140 (2003), 419-426.
[15] T. Lukić and N. M. Ralević, Newton’s method with accelerated convergence
modified by an aggregation operator, Proceedings of 3rd Serbian-Hungarian Joint
Symposium on Intelligent SCG, 2005, pp. 121-128.
[16] S. M. Kang, A. Rafiq and Y. C. Kwun, A new second-order iteration method for
solving nonlinear equations, Abstr. Appl. Anal. 2013, Art. ID 487062, 4 pp.
 Fixed Point Type Iterative Method for Solving Nonlinear Equations 269
[17] J. Biazar and A. Amirteimoori, An improvement to the fixed point iterative
method, Appl. Math. Comput. 182 (2006), 567-571.
[18] J. Biazar, S. M. Kang and A. Rafiq, Reconsideration on “An improvement to the
fixed point iterative method”, Nonlinear Anal. Forum 19 (2014), 247-251.
[19] A. Ali, Q. Mehmood, M. Tanveer, A. Aslam and W. Nazeer, Modified new third-
order iterative method for non-linear equations, Sci. Int. (Lahore) 27(3) (2015),
1741-1744.
[20] W. Nazeer, M. Tanveer, S. M. Kang and A. Naseem, A new Househölder’s
method free from second derivatives for solving nonlinear equations and
polynomiography, J. Nonlinear Sci. Appl. 9 (2016), 998-1007.
[21] B. Kalantari, Polynomial Root-finding and Polynomiography, World Scientific,
Singapore, 2009.
[22] B. Kalantari, Method of creating graphical works based on polynomials, U.S.
Patent 6, 894, 705, 2005.
[23] B. Kalantari, Polynomiography: from the fundamental theorem of algebra to art,
Leonardo 38(3) (2005), 233-238.
[24] W. Kotarski, K. Gdawiec and A. Lisowska, Polynomiography via Ishikawa and
Mann iterations, Advances in Visual Computing, Part I, G. Bebis, R. Boyle and B.
Parvin, eds., Vol. 7431, Lecture Notes in Computer Science, pp. 305-313,
Springer, Berlin, Germany, 2012.

View publication stats