This is an early access version, the complete PDF, HTML, and XML versions will be available soon.
Open AccessArticle
Analysis of Fast Convergent Iterative Scheme with Fractal Generation
by
Zaib Un Nisa
Zaib Un Nisa 1,
Umar Ishtiaq
Umar Ishtiaq 2
,
Tayyab Kamran
Tayyab Kamran 1,*
,
Mohammad Akram
Mohammad Akram 3 and
Ioan-Lucian Popa
Ioan-Lucian Popa 4,5
1
Department of Mathematics, Quaid-i-Azam University Islamabad, Islamabad 45320, Pakistan
2
Office of Research, Innovation and Commercialization, University of Management and Technology, Lahore 57770, Pakistan
3
Department of Mathematics, Faculty of Science, Islamic University of Madinah, Madinah 42351, Saudi Arabia
4
Department of Computing, Mathematics, and Electronics, “1 Decembrie 1918” University of Alba Iulia, 510009 Alba Iulia, Romania
5
Faculty of Mathematics and Computer Science, Transilvania University of Brasov, Iuliu Maniu Street 50, 500091 Brasov, Romania
*
Author to whom correspondence should be addressed.
Fractal Fract. 2025, 9(9), 575; https://doi.org/10.3390/fractalfract9090575 (registering DOI)
Submission received: 12 July 2025
/
Revised: 21 August 2025
/
Accepted: 27 August 2025
/
Published: 30 August 2025
Abstract
In this paper, a pattern for visualizing fractals, namely Julia and Mandelbrot sets for complex functions of the form and , , are created using novel fast convergent iterative techniques. The new iteration scheme discussed in this study uses s-convexity and improves earlier approaches, including the Mann and Picard–Mann schemes. Further, the proposed approach is amplified by unique escape conditions that regulate the convergence behavior and generate Julia and Mandelbrot sets. This new technique allows greater versatility in fractal design, influencing the shape, size, and aesthetic structure of the designs created. By modifying various parameters in the suggested scheme, a significant number of visually interesting fractals can be generated and evaluated. Furthermore, we provide numerical examples and graphic demonstrations to demonstrate the efficiency of this novel technique.
Share and Cite
MDPI and ACS Style
Nisa, Z.U.; Ishtiaq, U.; Kamran, T.; Akram, M.; Popa, I.-L.
Analysis of Fast Convergent Iterative Scheme with Fractal Generation. Fractal Fract. 2025, 9, 575.
https://doi.org/10.3390/fractalfract9090575
AMA Style
Nisa ZU, Ishtiaq U, Kamran T, Akram M, Popa I-L.
Analysis of Fast Convergent Iterative Scheme with Fractal Generation. Fractal and Fractional. 2025; 9(9):575.
https://doi.org/10.3390/fractalfract9090575
Chicago/Turabian Style
Nisa, Zaib Un, Umar Ishtiaq, Tayyab Kamran, Mohammad Akram, and Ioan-Lucian Popa.
2025. "Analysis of Fast Convergent Iterative Scheme with Fractal Generation" Fractal and Fractional 9, no. 9: 575.
https://doi.org/10.3390/fractalfract9090575
APA Style
Nisa, Z. U., Ishtiaq, U., Kamran, T., Akram, M., & Popa, I.-L.
(2025). Analysis of Fast Convergent Iterative Scheme with Fractal Generation. Fractal and Fractional, 9(9), 575.
https://doi.org/10.3390/fractalfract9090575
Article Metrics
Article Access Statistics
For more information on the journal statistics, click
here.
Multiple requests from the same IP address are counted as one view.