Mandelbrot and Julia Sets via Jungck-CR Iteration With <i>s</i>-Convexity

  • Kwun, Young Chel; 
  • Tanveer, Muhammad; 
  • Nazeer, Waqas; 
  • Gdawiec, Krzysztof; 
  • Kang, Shin Min
Citations

WEB OF SCIENCE

60
Citations

SCOPUS

66

초록

In today's world, fractals play an important role in many fields, e.g., image compression or encryption, biology, physics, and so on. One of the earliest studied fractal types was the Mandelbrot and Julia sets. These fractals have been generalized in many different ways. One of such generalizations is the use of various iteration processes from the fixed point theory. In this paper, we study the use of Jungck-CR iteration process, extended further by the use of s-convex combination. The Jungck-CR iteration process with s-convexity is an implicit three-step feedback iteration process. We prove new escape criteria for the generation of Mandelbrot and Julia sets through the proposed iteration process. Moreover, we present some graphical examples obtained by the use of escape time algorithm and the derived criteria.

키워드

Julia set; Jungck-CR iteration; Mandelbrot set; s-convex combination
제목
Mandelbrot and Julia Sets via Jungck-CR Iteration With <i>s</i>-Convexity
저자
Kwun, Young Chel; Tanveer, Muhammad; Nazeer, Waqas; Gdawiec, Krzysztof; Kang, Shin Min
DOI
10.1109/ACCESS.2019.2892013
발행일
2019-01
유형
Article
저널명
IEEE Access
권
7
페이지
12167 ~ 12176