IDEAS home Printed from https://ideas.repec.org/a/eee/matcom/v241y2026ipbp739-757.html

Use of Ishikawa and Picard–Ishikawa iterations with s-convexity in the generation of Mandelbrot and Julia sets: A comparative analysis

Author

Listed:
  • Roy, Subhadip
  • Gdawiec, Krzysztof
  • Saha, Parbati
  • Choudhury, Binayak S.

Abstract

In this paper, we consider a two-step Ishikawa iteration and a three-step Picard–Ishikawa iteration extended with s-convexity for complex polynomials of the form zp+1+c for the generation of sequences in the complex plane which lead to the formation of Mandelbrot and Julia sets. Various patterns that emerge from these processes of generation are displayed, analyzed and their variations with the change in the various parameters of the iteration processes are discussed. The outcomes highlight the notable differences in the images obtained by the two iterations. Additionally, we examine the relationship between the iteration parameters and two numerical measures, the average escape time, and the non-escaping area index. The numerical examples demonstrate that this dependency is nonlinear and often differs significantly between the two iterations.

Suggested Citation

  • Roy, Subhadip & Gdawiec, Krzysztof & Saha, Parbati & Choudhury, Binayak S., 2026. "Use of Ishikawa and Picard–Ishikawa iterations with s-convexity in the generation of Mandelbrot and Julia sets: A comparative analysis," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 241(PB), pages 739-757.
    • Handle: RePEc:eee:matcom:v:241:y:2026:i:pb:p:739-757
    DOI: 10.1016/j.matcom.2025.11.007
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378475425004720
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.matcom.2025.11.007?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to

    for a different version of it.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:matcom:v:241:y:2026:i:pb:p:739-757. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.journals.elsevier.com/mathematics-and-computers-in-simulation/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.