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

Generating function method for constructing new iterations

Author

Listed:
  • Zhanlav, T.
  • Chuluunbaatar, O.
  • Ulziibayar, V.

Abstract

In this paper we propose a generating function method for constructing new two- and three-point iterations with p (3 ≤ p ≤ 8) order of convergence. This approach allows us to derive a new family of the optimal order iterative methods that include well known methods as special cases. The necessary and sufficient conditions for pth order convergence of the proposed iterations are given in terms of parameters τn and αn. We also propose some generating functions for τn and αn. We give the extension of a class of optimal fourth-order Jarratt’s type iterations with a≠23. We develop a unified representation of all optimal eighth-order methods. Several numerical results are given to demonstrate the efficiency and the performance of the presented methods and compare them with some other existing methods.

Suggested Citation

  • Zhanlav, T. & Chuluunbaatar, O. & Ulziibayar, V., 2017. "Generating function method for constructing new iterations," Applied Mathematics and Computation, Elsevier, vol. 315(C), pages 414-423.
    • Handle: RePEc:eee:apmaco:v:315:y:2017:i:c:p:414-423
    DOI: 10.1016/j.amc.2017.07.078
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300317305398
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2017.07.078?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.

    References listed on IDEAS

    as
    1. Chun, Changbum & Neta, Beny, 2015. "An analysis of a family of Maheshwari-based optimal eighth order methods," Applied Mathematics and Computation, Elsevier, vol. 253(C), pages 294-307.
    2. Sharma, Janak Raj & Arora, Himani, 2016. "A new family of optimal eighth order methods with dynamics for nonlinear equations," Applied Mathematics and Computation, Elsevier, vol. 273(C), pages 924-933.
    3. Behl, Ramandeep & Cordero, Alicia & Motsa, Sandile S. & Torregrosa, Juan R., 2015. "Construction of fourth-order optimal families of iterative methods and their dynamics," Applied Mathematics and Computation, Elsevier, vol. 271(C), pages 89-101.
    4. Chun, Changbum & Neta, Beny, 2016. "Comparison of several families of optimal eighth order methods," Applied Mathematics and Computation, Elsevier, vol. 274(C), pages 762-773.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Zhanlav, T. & Otgondorj, Kh., 2021. "Higher order Jarratt-like iterations for solving systems of nonlinear equations," Applied Mathematics and Computation, Elsevier, vol. 395(C).

    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. Min-Young Lee & Young Ik Kim & Beny Neta, 2019. "A Generic Family of Optimal Sixteenth-Order Multiple-Root Finders and Their Dynamics Underlying Purely Imaginary Extraneous Fixed Points," Mathematics, MDPI, vol. 7(6), pages 1-26, June.
    2. Young Hee Geum & Young Ik Kim & Beny Neta, 2018. "Developing an Optimal Class of Generic Sixteenth-Order Simple-Root Finders and Investigating Their Dynamics," Mathematics, MDPI, vol. 7(1), pages 1-32, December.
    3. Fiza Zafar & Alicia Cordero & Juan R. Torregrosa, 2018. "An Efficient Family of Optimal Eighth-Order Multiple Root Finders," Mathematics, MDPI, vol. 6(12), pages 1-16, December.
    4. Daniele Tommasini & David N. Olivieri, 2020. "Fast Switch and Spline Function Inversion Algorithm with Multistep Optimization and k-Vector Search for Solving Kepler’s Equation in Celestial Mechanics," Mathematics, MDPI, vol. 8(11), pages 1-18, November.
    5. Petković, I. & Herceg, Ð., 2017. "Symbolic computation and computer graphics as tools for developing and studying new root-finding methods," Applied Mathematics and Computation, Elsevier, vol. 295(C), pages 95-113.
    6. van Lith, Bart S. & ten Thije Boonkkamp, Jan H.M. & IJzerman, Wilbert L., 2018. "Full linear multistep methods as root-finders," Applied Mathematics and Computation, Elsevier, vol. 320(C), pages 190-201.
    7. Campos, B. & Vindel, P., 2021. "Dynamics of subfamilies of Ostrowski–Chun methods," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 181(C), pages 57-81.
    8. Janak Raj Sharma & Ioannis K. Argyros & Sunil Kumar, 2019. "Convergence Analysis of Weighted-Newton Methods of Optimal Eighth Order in Banach Spaces," Mathematics, MDPI, vol. 7(2), pages 1-14, February.
    9. Chun, Changbum & Neta, Beny, 2016. "Comparison of several families of optimal eighth order methods," Applied Mathematics and Computation, Elsevier, vol. 274(C), pages 762-773.
    10. Yanlin Tao & Kalyanasundaram Madhu, 2019. "Optimal Fourth, Eighth and Sixteenth Order Methods by Using Divided Difference Techniques and Their Basins of Attraction and Its Application," Mathematics, MDPI, vol. 7(4), pages 1-22, March.

    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:315:y:2017:i:c:p:414-423. 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: 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.