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

A new highly efficient and optimal family of eighth-order methods for solving nonlinear equations

Author

Listed:
  • Behl, Ramandeep
  • Argyros, Ioannis K.
  • Motsa, S.S.

Abstract

The principle aim of this manuscript is to present a new highly efficient and optimal eighth-order family of iterative methods to solve nonlinear equations in the case of simple roots. The derivation of this scheme is based on weight function and rational approximation approaches. The proposed family requires only four functional evaluations (viz. f(xn) f′(xn) f(yn) and f(zn)) per iteration. Therefore, the proposed family is optimal in the sense of Kung–Traub hypotheses. In addition, we given a theorem which describing the order of convergence of the proposed family. Moreover, we present a local convergence analysis using hypotheses only on the first-order derivative, since in our preceding theorem we used hypotheses on higher-order derivatives that do not appear in these methods. In this way, we expand the applicability of these methods even further. Furthermore, a variety of nonlinear equations is considered for the numerical experiments. It is observed from the numerical experiments that our proposed methods perform better than the existing optimal methods of same order, when the accuracy is checked in multi precision digits.

Suggested Citation

  • Behl, Ramandeep & Argyros, Ioannis K. & Motsa, S.S., 2016. "A new highly efficient and optimal family of eighth-order methods for solving nonlinear equations," Applied Mathematics and Computation, Elsevier, vol. 282(C), pages 175-186.
  • Handle: RePEc:eee:apmaco:v:282:y:2016:i:c:p:175-186
    DOI: 10.1016/j.amc.2016.02.010
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1016/j.amc.2016.02.010?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.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Moin-ud-Din Junjua & Fiza Zafar & Nusrat Yasmin, 2019. "Optimal Derivative-Free Root Finding Methods Based on Inverse Interpolation," Mathematics, MDPI, vol. 7(2), pages 1-10, February.

    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:282:y:2016:i:c:p:175-186. 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.