http://hdl.handle.net/20.500.12128/8093
Tytuł: | Mandelbrot and Julia Sets via Jungck-CR Iteration with s-convexity |
Autor: | Kwun, Young Chel Tanveer, Muhammad Nazeer, Waqas Gdawiec, Krzysztof Kang, Shin Min |
Słowa kluczowe: | Julia set; Jungck-CR iteration; Mandelbrot set; s-convex combination |
Data wydania: | 2019 |
Źródło: | IEEE Access, Vol. 7 (2019), s. 12167-12176 |
Abstrakt: | 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. |
URI: | http://hdl.handle.net/20.500.12128/8093 |
DOI: | 10.1109/ACCESS.2019.2892013 |
ISSN: | 2169-3536 |
Pojawia się w kolekcji: | Artykuły (WNŚiT) |
Plik | Opis | Rozmiar | Format | |
---|---|---|---|---|
Kwun_Mandelbrot_and_Julia_Sets.pdf | 3,61 MB | Adobe PDF | Przejrzyj / Otwórz |
Uznanie Autorstwa 3.0 Polska Creative Commons