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

New Memory-Updating Methods in Two-Step Newton’s Variants for Solving Nonlinear Equations with High Efficiency Index

Author

Listed:
  • Chein-Shan Liu

    (Center of Excellence for Ocean Engineering, National Taiwan Ocean University, Keelung 202301, Taiwan)

  • Chih-Wen Chang

    (Department of Mechanical Engineering, National United University, Miaoli 360302, Taiwan)

Abstract

In the paper, we iteratively solve a scalar nonlinear equation f ( x ) = 0 , where f ∈ C ( I , R ) , x ∈ I ⊂ R , and I includes at least one real root r . Three novel two-step iterative schemes equipped with memory updating methods are developed; they are variants of the fixed-point Newton method. A triple data interpolation is carried out by the two-degree Newton polynomial, which is used to update the values of f ′ ( r ) and f ″ ( r ) . The relaxation factor in the supplementary variable is accelerated by imposing an extra condition on the interpolant. The new memory method (NMM) can raise the efficiency index (E.I.) significantly. We apply the NMM to five existing fourth-order iterative methods, and the computed order of convergence (COC) and E.I. are evaluated by numerical tests. When the relaxation factor acceleration technique is combined with the modified D z ˇ uni c ´ ’s memory method, the value of E.I. is much larger than that predicted by the paper [Kung, H.T.; Traub, J.F. J. Assoc. Comput. Machinery 1974 , 21 ]. for the iterative method without memory.

Suggested Citation

  • 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.
    • Handle: RePEc:gam:jmathe:v:12:y:2024:i:4:p:581-:d:1339078
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/12/4/581/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/12/4/581/
    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.
    2. Manoj K. Singh & Ioannis K. Argyros, 2022. "The Dynamics of a Continuous Newton-like Method," Mathematics, MDPI, vol. 10(19), pages 1-14, October.
    3. Lee, Min-Young & Ik Kim, Young & Alberto Magreñán, Á., 2017. "On the dynamics of a triparametric family of optimal fourth-order multiple-zero finders with a weight function of the principal mth root of a function-to function ratio," Applied Mathematics and Computation, Elsevier, vol. 315(C), pages 564-590.
    4. Ioannis K. Argyros & Stepan Shakhno, 2019. "Extended Local Convergence for the Combined Newton-Kurchatov Method Under the Generalized Lipschitz Conditions," Mathematics, MDPI, vol. 7(2), pages 1-12, February.
    5. T. Lotfi & F. Soleymani & Z. Noori & A. Kılıçman & F. Khaksar Haghani, 2014. "Efficient Iterative Methods with and without Memory Possessing High Efficiency Indices," Discrete Dynamics in Nature and Society, Hindawi, vol. 2014, pages 1-9, September.
    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. 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.
    3. 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.
    4. Alzahrani, Abdullah Khamis Hassan & Behl, Ramandeep & Alshomrani, Ali Saleh, 2018. "Some higher-order iteration functions for solving nonlinear models," Applied Mathematics and Computation, Elsevier, vol. 334(C), pages 80-93.
    5. Chein-Shan Liu & Chung-Lun Kuo & Chih-Wen Chang, 2023. "Regularized Normalization Methods for Solving Linear and Nonlinear Eigenvalue Problems," Mathematics, MDPI, vol. 11(18), pages 1-24, September.

    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:4:p:581-:d:1339078. 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.