IDEAS home Printed from https://ideas.repec.org/a/igg/jismd0/v17y2026i1p1-17.html

Fractal Art Graphic Design Based on Newton's Iterative Algorithm

Author

Listed:
  • Weixin Lin

    (Hainan Vocational University of Science and Technology, China)

  • Kuanlian Lee

    (Dhurakij Pundit University, Thailand)

  • Dawei Li

    (Xiamen University, China)

  • Shu-Fen Chou

    (Dhurakij Pundit University, Thailand)

  • Xiangjin Zhu

    (Hainan Vocational University of Science and Technology, China)

Abstract

This study addresses critical limitations of traditional Newton iteration methods in fractal generation—namely sensitivity to initial values, narrow convergence domains, and instability with complex functions—by introducing an enhanced algorithm with two key innovations: (a) an adaptive initial value selection mechanism that dynamically optimizes starting points based on function characteristics and (b) a real-time dynamic step-size adjustment strategy that uses derivative feedback to correct iteration parameters. Validated in MATLAB, the proposed algorithm achieves a 45% reduction in average iterations (from 11 to 6), increases convergence success from 80.5% to 95.8%, and reduces computation time by half (4.2s to 2.1s). The generated fractals exhibit significantly improved detail scores (80 to 94) and enhanced artistic expressiveness, demonstrating efficient high-resolution fractal synthesis with improved convergence stability for computational art applications.

Suggested Citation

  • Weixin Lin & Kuanlian Lee & Dawei Li & Shu-Fen Chou & Xiangjin Zhu, 2026. "Fractal Art Graphic Design Based on Newton's Iterative Algorithm," International Journal of Information System Modeling and Design (IJISMD), IGI Global Scientific Publishing, vol. 17(1), pages 1-17, January.
    • Handle: RePEc:igg:jismd0:v:17:y:2026:i:1:p:1-17
    as

    Download full text from publisher

    File URL: https://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/IJISMD.402032
    Download Restriction: no
    ---><---

    More about this item

    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:igg:jismd0:v:17:y:2026:i:1:p:1-17. 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: Journal Editor (email available below). General contact details of provider: https://www.igi-global.com .

    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.