IDEAS home Printed from https://ideas.repec.org/a/eee/chsofr/v199y2025ip2s0960077925006599.html
   My bibliography  Save this article

A class of high-order fractional parallel iterative methods for nonlinear engineering problems: Convergence, stability, and neural network-based acceleration

Author

Listed:
  • Shams, Mudassir
  • Kausar, Nasreen
  • Carpentieri, Bruno

Abstract

Conventional analytical techniques often fail to yield efficient or closed-form solutions for nonlinear fractional problems due to their inherent nonlocality and complexity. This study introduces a new class of high-order parallel iterative methods for solving nonlinear equations, with a focus on fractional-order formulations. We first develop a sixth-order single-root finding scheme, which is then extended to a fractional-order method with convergence order 5σ+1, and further generalized into a parallel scheme achieving order 20σ+8. To improve computational performance, we propose a hybrid neural network-based parallel scheme, in which optimal parameter values are identified through dynamical systems analysis. The resulting methods exhibit strong stability, accuracy, and efficiency, and are robust with respect to both accurate and perturbed initial approximations. Comparative experiments on real-world engineering problems demonstrate that the proposed fractional parallel schemes consistently outperform existing methods in terms of residual error, convergence rate, and computational cost.

Suggested Citation

  • Shams, Mudassir & Kausar, Nasreen & Carpentieri, Bruno, 2025. "A class of high-order fractional parallel iterative methods for nonlinear engineering problems: Convergence, stability, and neural network-based acceleration," Chaos, Solitons & Fractals, Elsevier, vol. 199(P2).
  • Handle: RePEc:eee:chsofr:v:199:y:2025:i:p2:s0960077925006599
    DOI: 10.1016/j.chaos.2025.116646
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0960077925006599
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.chaos.2025.116646?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:chsofr:v:199:y:2025:i:p2:s0960077925006599. 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: Thayer, Thomas R. (email available below). General contact details of provider: https://www.journals.elsevier.com/chaos-solitons-and-fractals .

    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.