New Fixed Point Results for Fractal Generation in Jungck Noor Orbit with s-Convexity

We establish new fixed point results in the generation of fractals (Julia sets, Mandelbrot sets, and Tricorns and Multicorns for linear or nonlinear dynamics) by using Jungck Noor iteration with -convexity.


Introduction
The fractal geometry in mathematics has presented some attractive complex graphs and objects to computer graphics.Fractal is a Latin word, derived from the word "Fractus" which means "Broken."The term "fractal" was first used by a young mathematician, Julia [1], when he was studying Cayley's problem related to the behavior of Newton's method in complex plane.Julia introduced the concept of iterative function system (IFS) and, by using it, he derived the Julia set in 1919.After that, in 1982, Mandelbrot [2] extended the work of Gaston Julia and introduced the Mandelbrot set, a set of all connected Julia sets.The fractal structures of Mandelbrot and Julia sets have been demonstrated for quadratic, cubic, and higher degree polynomials, by using Picard orbit which is an application of one-step feedback process [3].
Julia and Mandelbrot sets have been studied under the effect of noises [1][2][3][4] arising in the objects.In 1982, Mandelbrot [2] introduced superior iterates (a two-step feedback process) in the study of fractal theory and created superior Julia and Mandelbrot sets.Rani et al. [5][6][7] generated and analyzed superior Julia and superior Mandelbrot sets for quadratic, cubic, and th degree complex polynomials.After creation of superior Mandelbrot sets, Negi and Rani [5] collected the properties of midgets of quadratic superior Mandelbrot sets.Negi and Rani [6] simulated the behavior of Julia sets using switching processes.Chauhan et al. [4] obtained new Julia and Mandelbrot sets via Ishikawa iterates (an example of three-step feedback process).Kang et al. [8] introduced Julia and Mandelbrot sets in Jungck Mann and Jungck Ishikawa orbits.
In 1994, Hudzik and Maligranda [9] discussed a few results connecting with -convex functions in second sense and some new results about Hadamard's inequality for convex functions are discussed in [10,11].In 1915, Bernstein and Doetsch [12] proved a variant of Hermite-Hadamard's inequality for -convex functions in second sense.Takahashi [13] 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.Recently, Ojha and Mishra [14] discussed an application of fixed point theorem for -convex function.
It is a well known fact that -convexity and Ishikawa iteration play a vital role in the development of geometrical picturesque of fractal sets.The applications of fractal sets are in cryptography and other useful areas in our modern era.Our aim is to deal with generalization of -convexity, approximate convexity, and results of Bernstein and Doetsch [12].The concept of -convexity and rational -convexity was introduced by Breckner and Orbán [15] in 1978.
In this paper, we establish some new fixed point results in the generation of fractals (Julia sets, Mandelbrot sets, and Tricorns and Multicorns for linear or nonlinear dynamics) by using Jungck Noor iteration with -convexity.We define the

Preliminaries
Definition 1 (Mandelbrot set [2,6]).The Mandelbrot set  for the quadratic polynomial   () =  2 +  is defined as the collection of all  ∈  for which the orbit of the point 0 is bounded; that is, is bounded.An equivalent formulation is  = { ∈  :    (0) does not tend to ∞ as  → ∞} . ( We choose the initial point 0, as 0 is the only critical point of   . Definition 2 (Julia set [1]).The attractor basin of infinity is never all of , since   has fixed points   = 1/2 ± √1/4 +  (and also points of period , which satisfy a polynomial equation of degree 2  ; namely,   () = ).The nonempty compact boundary of the attractor basin of infinity is called the Julia set of   : Definition 3 (filled Julia set [1,3,7]).The filled Julia set of the function  is denoted by () and is defined as Definition 4 (see [1,3,7]).The Julia set of the function  is defined to be the boundary of filled Julia set ().That is, Definition 5 (see [3]).Let {  :  = 1, 2, 3, 4, . ..} be a sequence of complex numbers.Then, one says lim  → ∞   = ∞ if, for given  > 0, there exists  > 0, such that, for all  > , one must have |  | > .Thus all the values of   lie outside a circle of radius , for sufficiently large values of .Let be a polynomial of degree , where  ≥ 2. The coefficients are allowed to be complex numbers.In other words, it follows that   () =  2 + .
In nonlinear dynamics, we have two different types of points.Points that leave the interval after a finite number are in stable set of infinity.Points that never leave the interval after any number of iterations have bounded orbits.So, an orbit is bounded if there exists a positive real number, such that the modulus of every point in the orbit is less than this number.The collection of points that are bounded (i.e., there exists , such that |  ()| ≤ , for all ) is called a prisoner set, while the collection of points that are in the stable set of infinity is called the escape set.Hence, the boundary of the prisoner set is simultaneously the boundary of escape set and that is Mandelbrot set for .

Escape Criterions for the Complex Polynomials in Jungck Noor Orbit
Now we prove the escape criterions of Julia and Mandelbrot sets for quadratic, cubic, and the higher degree complex polynomials in Jungck Noor orbit with -convexity.
Proof.Let  =  2 +  and for  0 = ,  0 = , and  0 = , we have considered that implies Using binomial's series up to linear terms of  and (1 − ), we get that we guarantee that the orbit escapes.Hence,  is not in the Julia sets and also is not in the Mandelbrot sets.On the other hand, if |  | never exceeds this bound, then by definition of the Julia sets and the Mandelbrot sets, we can make extensive use of this algorithm in the next section.

Escape Criterion for the Cubic Complex Polynomials.
For cubic complex polynomial    =  3 −  + , we will choose  =  3 + and  = , where  and  are complex numbers.
Proof.Let  =  3 +  and for  0 = ,  0 = , and  0 = , we have considered that implies Using binomial's series up to linear terms of  and (1 − ), we get that  This corollary gives us an algorithm in the generation of fractals (Julia sets, Mandelbrot sets, and Tricorns and Multicorns for linear or nonlinear dynamics) for   .

Escape Criterion for Higher Degree Complex Polynomials.
For higher degree complex polynomial    =   −  + , we will choose  =   +  and  = , where  = 2, 3, 4, . . .and  and  are complex numbers.This corollary gives us an algorithm in the generation of fractals (Julia sets, Mandelbrot sets, and Tricorns and Multicorns for linear or nonlinear dynamics) for   .

Conclusions
In this paper, new fixed point results for Jungck Noor iteration with -convexity have been introduced in the generation of fractals (Julia sets, Mandelbrot sets, and Tricorns and Multicorns for linear or nonlinear dynamics).The new escape criterions for complex quadratic, cubic, and th degree polynomials have been established.If we take  = 1, it provides previous existing results in the relative literature [8].
Quadratic Complex Polynomials.For quadratic complex polynomial    =  2 −  + , we will choose  =  2 +  and  = , where  and  are complex numbers.