Skip navigation

Please use this identifier to cite or link to this item:
Full metadata record
DC FieldValueLanguage
dc.contributor.authorKwun, Young Chel-
dc.contributor.authorTanveer, Muhammad-
dc.contributor.authorNazeer, Waqas-
dc.contributor.authorGdawiec, Krzysztof-
dc.contributor.authorKang, Shin Min-
dc.identifier.citationIEEE Access, Vol. 7 (2019), s. 12167-12176pl_PL
dc.description.abstractIn 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.pl_PL
dc.rightsUznanie autorstwa 3.0 Polska*
dc.subjectJulia setpl_PL
dc.subjectJungck-CR iterationpl_PL
dc.subjectMandelbrot setpl_PL
dc.subjects-convex combinationpl_PL
dc.titleMandelbrot and Julia Sets via Jungck-CR Iteration with s-convexitypl_PL
dc.relation.journalIEEE Accesspl_PL
Appears in Collections:Artykuły (WNŚiT)

Files in This Item:
File Description SizeFormat 
Kwun_Mandelbrot_and_Julia_Sets.pdf3,61 MBAdobe PDFView/Open
Show simple item record

Uznanie Autorstwa 3.0 Polska Creative Commons License Creative Commons