Manish Kumar Mishra* et al.
/ (IJAEST) INTERNATIONAL JOURNAL OF ADVANCED ENGINEERING SCIENCES AND TECHNOLOGIES
Fixed Point Results In Tricorn & Multicorns of
Ishikawa Iteration and s-Convexity
(FTMISC)
*
Manish Kumar Mishra , Deo Brat Ojha
mkm2781@rediffmail.com, deobratojha@rediffmail.com
Department of Mathematics
R.K.G.Institute of Technology
Ghaziabad,U.P.,INDIA
Abstract— In this paper, we established fixed point results in
Tricorn and Multicorns of Ishikawa iteration and s- convexity.
Keywords- Complex dynamics, Ishikawa Iteration, Relative
Superior Tricorn and Relative Fuzzy metric space, Superior
Multicorns, s-convex function.
I. INTRODUCTION
ES
Human beings always intend to understand the events easily with the
help of geometrical aspects. It is due to high expectation for mutual
fulfillment in our day to day computational life, specially in the
developments of robotics control and optimization techniques. It is a
well known fact that s-convexity and Ishikawa iteration plays vital
role in the development of geometrical picturesque of fractal sets[9].
Further, we know very well about the applications of fractal sets in
cryptography and other useful areas in our modern era. In this paper,
we dealt with generalization of s-convexity, approximate convexity,
A
and results of Bernstein and Doetsch [5]. The concept of s-convexity
and rational s-convexity was introduced by Breckner [6]. In 1978
Breckner[6] and H. Hudzik and L. Maligranda [7] it was proved that
s-convex functions are nonnegative, when 0 < s <1, moreover the set
of s-convex functions increases as s decreases.
In 1994, H. Hudzik and L. Maligranda[7] discussed a few results
connecting with s-convex functions in second sense and some new
IJ
results about Hadamard’s inequality for s-convex functions are
discussed in (M. Alomari and M. Darus [1-2], U. S. Kirmaci [4]), In
1999, S. S. Dragomir[3] et al. proved a variant of Hermite-
Hadamard’s inequality fors¡convex functions in second sense.
Takahashi [8] first introduced a notion of convex metric space,
which is more general space, and each linear normed space is a
special example of the space. Very recently Chauhan and rana[9]
discussed the dynamics Ishikawa iteration procedure. Recently Ojha
[10] discussed an application of fixed point theorem for s-convex
function.
The word “Fractal” from Latin word “fractus” meaning “broken” was
introduced in 1975 by mathematician Benoit B. Mandelbrot to
describe irregular and intricate natural phenomenon as lunar
landscapes, mountains, trees branching and coastlines etc. The object
ISSN: 2230-7818 @ 2011 http://www.ijaest.iserp.org. All rights Reserved.
Vol No. 2, Issue No. 2, 157 - 160
Devdutt Sharma
Research Scholar Mewar University
Department of Computer Science & Engineering
Mandelbrot set, given by Mandelbrot in 1979 and its relative object
T
Julia set due to their beauty and complexity of their nature have
become elite area of research nowadays.
Recently Shizuo [18], has presented the various properties of
Multicorns and Tricorn along with beautiful figures. Shizuo has
quoted the Multicorns as the generalized Tricorn or the Tricorn of
higher order. The dynamics of antipolynomial z  z d  c of
complex polynomial z d  c , where d  2 , leads to interesting
tricorn and multicorns antifractals with respect to function iteration
(see [12] and [17, 18]). Tricorn are being used for commercial
purpose, e.g. Tricorn mugs and Tricorn T shirts. Multicorns are
symmetrical objects. Their symmetry has been studied by Lau and
Schleicher [15].
The study of connectedness locus for antiholomorphic polynomials
z 2  c defined as Tricorn, coined by Milnor, plays intermediate role
between quadratic and cubic polynomials. Crowe etal.[11] considered
it as in formal analogy with Mandelbrot set and named it as Mandel-
bar set and also brought its features bifurcations along axes rather
than at points. Milnor [16] found it as a real slice of cubic connected
locus. Winters [26] showed it as boundary along the smooth arc.
Superior Tricorn and Superior Multicorns using the Mann iterates
rather than function iterates is studied and explored by A. Ishikawa
iterates and also study their corresponding Relative Superior Julia
sets. .In this work, we want to investigate in Tricorn and Multicorns
of using Ishikawa iteration for s-convexity as an application.
II. PRELIMINARIES
2.1 Tricorn and Multicorns:
Following the Milnor’s study, Shizuo [18] has defined the Tricorn, as
n
the connectedness locus for antiholomorphic polynomials, z  c ,
where n  2 .
Definition2.1: The Multicorns c A , for the quadratic
Ac  z   z n  c is defined as the collection of all c  C for
Page 157
Manish Kumar Mishra* et al. / (IJAEST) INTERNATIONAL JOURNAL OF ADVANCED ENGINEERING SCIENCES AND TECHNOLOGIES
Vol No. 2, Issue No. 2, 157 - 160

which the orbit of the point 0 is bounded, that is, Definition: Relative Superior Mandelbort set RSM for the

Ac  c  C :  Ac  0  : n  0,1, 2...........is bounded .  function of the form Qc  z   z n  c , where
An equivalent formulation is n  1, 2,3, 4......... is defined as the collection of c  C for

Ac  c  C :  Ac  0  not tends to  as n    which the orbit of 0 is bounded that is

The Tricorn are special Multicorns when n = 2.   

RSM  c  C : Qck  0  : k  0,1, 2...........  Is bounded .
As quoted by Shizuo [18], the Tricorn plays an intermediate
role between quadratic and cubic polynomials. As quoted by Definition [8]. Let  X , d  be a metric space, and I  [0,1]
Devaney [12], iterations of the function Ac  z   z 2  c , using
. A mapping  : X  I  X is said to be convex structure
2
the Escape Time Algorithm, results in many strange and
surprising structures. Devaney [12] has named it Tricorn and on X, if for any x, y,   X and u  X , the following
observed that f  z   , the conjugate function of f  z  , is inequality holds:
antipolynomial. Further, its second iterates is a polynomial of
d x, y, , u    s d x, u   1    d  y, u 
s
degree 4. Taking the initial choice z0 , one can iterate Ac1  z  ,
If  X , d  is a metric space with a convex structure  , then
resulting z1 equals z0 2  c , which can be written as
 X , d  is called a convex metric space. Moreover, a
z   z  , which
2 2 2
/ z0  c , since z0  z0 is equivalent to nonempty subset E of X

T
0 0 is said to be convex if

gives z1 equals z 0
4
/ z02 
2
 c . Using this value one can x, y,  X for all x, y, E 2  I .

   X , d  be a
4 2
state the conjugate of z1 as z1  z0 / z02  c , resulting Definition [28]. Let metric space, and

z02  c . Now the second iterate can be stated as Ac2  z  I  [0,1] and an ,bn , cn  real sequences in

which is equal to z12  c , on simplifying, one can get

z0
2
 c 
2
ES
 c , further, z04  2 z02c  c2  c , which is a
[0,1] with an  bn  cn  1 . A mapping  : X 3  I 3  X
is said to be convex structure on X, if for any
( x, y, z, an , bn , cn )  X 3  I 3 and u  X , the following
polynomial of degree 4 in z. Further, Devaney [12], has observed that
inequality holds:
the function z12  c is conjugate of z12  d , where d  e  ,
2 i/3

which shows that the Tricorn is symmetric under rotations through d   x, y, z, an , bn , cn  , u   (an ) s d  x, u   (bn ) s d  y, u 
angle 2 / 3 . The critical point for Ac is 0, since c  Ac  0  has
(cn ) s d  z, u 
only one preimage whereas any other w  C , has two preimages.
A
Ishikawa s-Iteration III. MAIN RESULTS

Let X be a subset of real or

Here we present the study of Relative superior Julia sets of
complex numbers and f : X  X , For x0  X , we construct
Relative Superior Tricron by using the Escape Time
the sequences  xn  and  yn  in X, in the following manner: Algorithm with respect to Ishikawa Iterates.
s s
yn   pn  f  xn   1  pn  xn Now we define escape criterions for these sets.
IJ

s s
xn   pn 1  f  yn 1   1  pn 1  xn 1
Escape Criterion:
where 0  pn  1 , 0  pn  1 and pn & pn are both
convergent to non zero number. We obtain a general escape Criterions for polynomials of the
form Gc  z   z  c .
n
Definition: The sequences xn and yn constructed above is
called Ishikawa sequences of iteration or relative superior Theorem 3.1: The general function Gc  z   z n  c
sequences of iterates. We denote it by RSO  x0 , pn , pn , t  . , n  1, 2,3, 4...... where 0  p  1,0  p '  1 and c is a complex
Notice that RSO  x0 , pn , pn , t  with pn is RSO  x0 , pn , t  i.e
s
plane. Define z1  1  p  z  p s Gc  z 
.
Mann’s orbit and if we place pn  pn  1 then
.
RSO  x0 , pn , pn , t  reduces to O  x0 , t  .
s
zn  1  p  zn 1  p s Gc  zn 1 
We remark that Ishikawa orbit RSO  x0 , pn , pn , t  with
Thus the general escape Criterion is
pn  1/ 2 is Relative superior orbit. Now we define Julia set
for function with respect to Ishikawa iterates. We call them as 
max c ,  2 / p 
1/ n 1
,  2 / p '
1/ n 1
.
Relative Superior Julia sets.

ISSN: 2230-7818 @ 2011 http://www.ijaest.iserp.org. All rights Reserved. Page 158

Manish Kumar Mishra* et al. / (IJAEST) INTERNATIONAL JOURNAL OF ADVANCED ENGINEERING SCIENCES AND TECHNOLOGIES
Vol No. 2, Issue No. 2, 157 - 160

Proof: We shall prove this theorem by induction: Therefore, the Ishikawa orbit of z under the iteration of z n 1  c
For n = 1, we get Gc  z   z  c . So, the escape criterion
tends to infinity. Hence z  max c ,  2 / p  1/ n 1/ n
,  2 / p '  is the
is c ,which is obvious, i.e z  max c , 0, 0 .   escape criterion. This proves the theorem.
For n = 2, we get Gc  z   z  c . So, the escape criterion is2
Corollary 3.1: Suppose that
z  max  c ,  2 / p  ,  2 / p '  (See Theorem 3.1) 1/ n 1 1/ n 1
c  2 / p and c   2 / p ' exits. Then, the relative
For n = 3, we get Gc  z   z 3  c . So, the escape criterion is superior orbit RSO  Gc ,0, p, p ' escapes to infinity.

z  max c ,  2 / p 
1/ 2
,  2 / p '
1/ 2
. Corollary 3.2: Assume that

Assume that the theorem is true for , n  1, 2,3, 4...... So, 

zk  max c ,  2 / p 
1/ k 1
,  2 / p '
1/ k 1
, for some k  0 .

Let’s Gc  z   z n1  c and z  c   2 / p 

1/ n 1
as well as Then zk 1   zk and zn   as n  . This Corollary
gives an algorithm for computing the Relative superior Julia
z  c   2 / p '
1/ n 1
exists. sets for the functions of the form Gc  z   z  c ,
s s , n  1, 2,3, 4......
Then, Gn  z   1  p ' z   p ' Gc  z  ,where

Gc  z   z n1  c and for s  1 IV. CONCLUSSION

 z  zp ' p ' z n 1  c 
 z  zp ' p ' z n 1  p ' c
 z  p ' z  p ' 1   p ' z
n
T
Application of here established results can be viewed as
 generalization of plotting process, to the RSM set for the
function Ac using Ishikawa iterates. In our results, If we take
s = 1, it pr ovides pervious existed results in the relative
 z  c literature.

 z  p' z  p'  1  p' z

n
ES REFERENCES

 z  p ' z  p ' 1  p ' 

n
[1]. Alomari M. and M. Darus , On Co-ordinated s¡convex functions,
Inter. Math. Forum, 3(40) (2008) 1977-1989.
 z  p ' z 1  n
[2]. Alomari M. and M. Darus , Hadamard-type inequalities for
s¡convex functions, Inter. Math. Forum, 3(40) ,2008, 1965-1970.
Now,
s s
z1  1  p  z   p ' Gn  z  for s  1
[3]. Dragomir S. S. and S. Fitzpatrick, The Hadamard‟s inequality for
s¡convex functions in the second sense,Demonstratio Math. 32 (4)
(1999) 687-696.
 1  p  z  p z p ' z n  1  
A
[4]. Kirmaci U. S. et al., Hadamard-type inequalities for s-convex
functions, Appl. Math. Comp., 2007,193,26-35.
n
 z  pz  p z . p ' z  p z
[5]. Bernstein F. and G. Doetsch, Zur Theorie der konvexen
 z  p z pp ' z  n 1
pz  Funktionen, Math. Annalen 76 , 1915,514–526.

[6]. Breckner W. W. and G. Orb´an, Continuity properties of rationally


 pp ' z n 1  z  s-convex mappings with values in ordered topological liner space,
IJ

”Babes-Bolyai” University, Kolozsv´ar,1978

 pp ' z n 1  z [7]. Hudzik H. and L. Maligranda , Some remarks on si-convex

functions, Aequationes Math. 48 ,1994,100–111.

 z pp ' z n  1  [8]. Takahashi W. 1970, “A convexity in metric space and
1/ n 1/ n nonexpansive mappings, ”.I. Kodai Mathematical Seminar
Since z  2 / p ; z   2 / p ' and Reports, vol. 22, pp. 142–149.

z   2 / pp '
1/ n
; z  2 / p ' p
1/ n

, therefore pp ' z n  1  1 .  [9]. Chauhan and rana, „ Non linear dynamics of Ishikawa Iterates” ,
International journal of computer application”, vol. 7, 13, 2010.
Hence, for some   0 , we have pp ' z n  1  1   .   [10]. D. B. Ojha and Manish Kumar mishra, “ An application of fixed
z1  1    z
point theorem for s-convex function”, IJEST, Vol. 2 (8) , 2010,
3371-3375.
.
Thus, [11]. W. D. Crowe, R. Hasson, P. J. Rippon, and P. E. D. Strain-Clark,
. “On the structure of the Mandelbar set”, Nonlinearity
n
(2)(4)(1989), 541-553. MR1020441.
zn  1    z
[12]. Robert L. Devaney, “A First Course in Chaotic Dynamical
Systems: Theory and Experiment”,Addison-Wesley, 1992.
MR1202237.

ISSN: 2230-7818 @ 2011 http://www.ijaest.iserp.org. All rights Reserved. Page 159

Manish Kumar Mishra* et al. / (IJAEST) INTERNATIONAL JOURNAL OF ADVANCED ENGINEERING SCIENCES AND TECHNOLOGIES
Vol No. 2, Issue No. 2, 157 - 160

[13]. S. Ishikawa, “Fixed points by a new iteration method”, Proc. mer.

Math. Soc.44 (1974), 147-150.

[14]. Manish Kumar, and Mamta Rani, “A new approach to superior

Julia sets”, J. nature. Phys. Sci, 19(2), (2005), 148-155.

[15]. Eike Lau and Dierk Schleicher, “Symmetries of fractals revisited.”,

Math. Intelligencer (18)(1)(1996), 45-51. MR1381579 Zbl
0847.30018.

[16]. J. Milnor, “Dynamics in one complex variable; Introductory

lectures”, Vieweg (1999).

[17]. Shizuo Nakane, and Dierk Schleicher, “Nonlocal connectivity of

the tricorn and multicorns”, Dynamical systems and chaos (1)
(Hachioji, 1994), 200-203, World Sci. Publ.,River Edge, NJ, 1995.
MR1479931.

[18]. Shizuo Nakane, and Dierk Schleicher, “On multicorns and

unicorns: I. Antiholomorphic dynamics. hyperbolic components
and real cubic polynomials”, Internat. J. Bifur. Chaos Appl. Sci.
Engrg, (13)(10)(2003), 2825-2844.
MR2020986.

T
[19]. Ashish Negi, “Generation of Fractals and Applications”, Thesis,
Gurukul Kangri Vishwvidyalaya, (2005).

[20]. M.O.Osilike, “Stability results for Ishikawa fixed point iteration

procedure”, Indian Journal of Pure and Appl. Math., 26(1995),
937-945.
ES
[21]. M.O.Osilike, “Iterative construction of fixed points of multivalued
operators of the accretive type”, Sochow J.Math. 22(1996), 85-92.

[22]. Pitgen, Jurgens and Saupe, “Chaos and Fractals, Springer-

Verlag”, NewYork, Inc., 1992.

[23]. Mamta Rani, and Vinod Kumar, “Superior Mandelbrot sets”, J.

Korea Soc. Math. Educ. Ser. D; Res. Math. Educ. (8)(4)(2004),
279-291.

[24]. B. E. Rhoades, “Fixed point iterations for certain nonlinear

mappings”, J. Math. Anal. 183 (1994), 118-120.
A
[25]. K. Shirriff, “Fractals from Simple Polynomial Composite
Functions,'' Computers & Graphics, 17(6), Nov. 1993, pp 701-703.

[26]. R. Winters, “Bifurcations in families of Antiholomorphic and

biquadratic maps”, Thesis, Boston Univ. (1990).

[27]. Rana, Dimri and tomar, “Fixed point theorems in fuzzy metric
spaces using implicit relation” , International journal of computer
applications vol. 8- no.1, 2010, pp. 16-21.
IJ

[28]. Tian Y.-X. 2005, “Convergence of an Ishikawa type iterative

scheme for asymptotically quasi-nonexpansive mappings,”
Computers & Mathematics with Applications, 2005, vol. 49, no.
11-12, pp. 1905–1912

ISSN: 2230-7818 @ 2011 http://www.ijaest.iserp.org. All rights Reserved. Page 160