Back to Search
Start Over
Fractal Generation via CR Iteration Scheme With S-Convexity
- Source :
- IEEE Access, Vol 7, Pp 69986-69997 (2019)
- Publication Year :
- 2019
- Publisher :
- IEEE, 2019.
-
Abstract
- The visual beauty, self-similarity, and complexity of Mandelbrot sets and Julia sets have made an attractive field of research. One can find many generalizations of these sets in the literature. One such generalization is the use of results from fixed-point theory. The aim of this paper is to provide escape criterion and generate fractals (Julia sets and Mandelbrot sets) via CR iteration scheme with s-convexity. Many graphics of Mandelbrot sets and Julia sets of the proposed three-step iterative process with s-convexity are presented. We think that the results of this paper can inspire those who are interested in generating automatically aesthetic patterns.
- Subjects :
- s-convexity
General Computer Science
Computer science
Generalization
010102 general mathematics
General Engineering
Julia set
Mandelbrot set
Iteration schemes
escape criterion
01 natural sciences
Convexity
Field (computer science)
010101 applied mathematics
Algebra
Fractal
General Materials Science
lcsh:Electrical engineering. Electronics. Nuclear engineering
0101 mathematics
lcsh:TK1-9971
Subjects
Details
- Language :
- English
- ISSN :
- 21693536
- Volume :
- 7
- Database :
- OpenAIRE
- Journal :
- IEEE Access
- Accession number :
- edsair.doi.dedup.....99dc9e7ab350808b1ec205e51fd6cf0d