IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v12y2024i12p1809-d1412609.html
   My bibliography  Save this article

A New Adaptive Eleventh-Order Memory Algorithm for Solving Nonlinear Equations

Author

Listed:
  • Sunil Panday

    (Department of Mathematics, National Institute of Technology Manipur, Langol, Imphal 795004, Manipur, India)

  • Shubham Kumar Mittal

    (Department of Mathematics, National Institute of Technology Manipur, Langol, Imphal 795004, Manipur, India)

  • Carmen Elena Stoenoiu

    (Department of Electric Machines and Drives, Technical University of Cluj-Napoca, 26-28 Baritiu Str., 400027 Cluj-Napoca, Romania)

  • Lorentz Jäntschi

    (Department of Physics and Chemistry, Technical University of Cluj-Napoca, 103-105 Muncii Blvd., 400641 Cluj-Napoca, Romania)

Abstract

In this article, we introduce a novel three-step iterative algorithm with memory for finding the roots of nonlinear equations. The convergence order of an established eighth-order iterative method is elevated by transforming it into a with-memory variant. The improvement in the convergence order is achieved by introducing two self-accelerating parameters, calculated using the Hermite interpolating polynomial. As a result, the R-order of convergence for the proposed bi-parametric with-memory iterative algorithm is enhanced from 8 to 10.5208 . Notably, this enhancement in the convergence order is accomplished without the need for extra function evaluations. Moreover, the efficiency index of the newly proposed with-memory iterative algorithm improves from 1.5157 to 1.6011 . Extensive numerical testing across various problems confirms the usefulness and superior performance of the presented algorithm relative to some well-known existing algorithms.

Suggested Citation

  • Sunil Panday & Shubham Kumar Mittal & Carmen Elena Stoenoiu & Lorentz Jäntschi, 2024. "A New Adaptive Eleventh-Order Memory Algorithm for Solving Nonlinear Equations," Mathematics, MDPI, vol. 12(12), pages 1-14, June.
    • Handle: RePEc:gam:jmathe:v:12:y:2024:i:12:p:1809-:d:1412609
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/12/12/1809/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/12/12/1809/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. G Thangkhenpau & Sunil Panday & Shubham Kumar Mittal & Lorentz Jäntschi, 2023. "Novel Parametric Families of with and without Memory Iterative Methods for Multiple Roots of Nonlinear Equations," Mathematics, MDPI, vol. 11(9), pages 1-18, April.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Chein-Shan Liu & Chih-Wen Chang, 2024. "Updating to Optimal Parametric Values by Memory-Dependent Methods: Iterative Schemes of Fractional Type for Solving Nonlinear Equations," Mathematics, MDPI, vol. 12(7), pages 1-21, March.
    2. Chein-Shan Liu & Chih-Wen Chang, 2024. "New Memory-Updating Methods in Two-Step Newton’s Variants for Solving Nonlinear Equations with High Efficiency Index," Mathematics, MDPI, vol. 12(4), pages 1-22, February.
    3. Ekta Sharma & Sunil Panday & Shubham Kumar Mittal & Dan-Marian Joița & Lavinia Lorena Pruteanu & Lorentz Jäntschi, 2023. "Derivative-Free Families of With- and Without-Memory Iterative Methods for Solving Nonlinear Equations and Their Engineering Applications," Mathematics, MDPI, vol. 11(21), pages 1-13, November.

    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:gam:jmathe:v:12:y:2024:i:12:p:1809-:d:1412609. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.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.