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

Maximally efficient damped composed Newton-type methods to solve nonlinear systems of equations

Author

Listed:
  • Cordero, Alicia
  • Rojas-Hiciano, Renso V.
  • Torregrosa, Juan R.
  • Vassileva, Maria P.

Abstract

The main contribution of this manuscript is to introduce to the scientific community the concept of maximally efficient damped composed Newton-type method and the design of two schemes of this class of orders four and six. It is obtained from a different and new extension of the vectorial optimal fourth-order Ermakov's Hyperfamily, in the sense of Cordero-Torregrosa conjecture. We call this class biparametric CRTV Hyperfamily, which contains the uniparametric CRTV6Sλ class. We define concepts, such as maximally efficient and least-eval-cost, that allow us to classify new and existing methods in terms of effectiveness, as an alternative to the tools used to date. Finally, we analyze the efficiency of the proposed family and perform numerical tests with big-sized nonlinear problems, up to size 500, comparing with other methods of the same order, low computational cost or maximum efficiency. These tests confirm the validity of the proposed class of methods.

Suggested Citation

  • Cordero, Alicia & Rojas-Hiciano, Renso V. & Torregrosa, Juan R. & Vassileva, Maria P., 2025. "Maximally efficient damped composed Newton-type methods to solve nonlinear systems of equations," Applied Mathematics and Computation, Elsevier, vol. 492(C).
    • Handle: RePEc:eee:apmaco:v:492:y:2025:i:c:s0096300324006921
    DOI: 10.1016/j.amc.2024.129231
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300324006921
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2024.129231?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 search for a different version of it.

    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:apmaco:v:492:y:2025:i:c:s0096300324006921. 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: https://www.journals.elsevier.com/applied-mathematics-and-computation .

    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.