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

Optimal Fourth, Eighth and Sixteenth Order Methods by Using Divided Difference Techniques and Their Basins of Attraction and Its Application

Author

Listed:
  • Yanlin Tao

    (School of Computer Science and Engineering, Qujing Normal University, Qujing 655011, China
    These authors contributed equally to this work.)

  • Kalyanasundaram Madhu

    (Department of Mathematics, Saveetha Engineering College, Chennai 602105, India
    These authors contributed equally to this work.)

Abstract

The principal objective of this work is to propose a fourth, eighth and sixteenth order scheme for solving a nonlinear equation. In terms of computational cost, per iteration, the fourth order method uses two evaluations of the function and one evaluation of the first derivative; the eighth order method uses three evaluations of the function and one evaluation of the first derivative; and sixteenth order method uses four evaluations of the function and one evaluation of the first derivative. So these all the methods have satisfied the Kung-Traub optimality conjecture. In addition, the theoretical convergence properties of our schemes are fully explored with the help of the main theorem that demonstrates the convergence order. The performance and effectiveness of our optimal iteration functions are compared with the existing competitors on some standard academic problems. The conjugacy maps of the presented method and other existing eighth order methods are discussed, and their basins of attraction are also given to demonstrate their dynamical behavior in the complex plane. We apply the new scheme to find the optimal launch angle in a projectile motion problem and Planck’s radiation law problem as an application.

Suggested Citation

  • 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.
  • Handle: RePEc:gam:jmathe:v:7:y:2019:i:4:p:322-:d:218542
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/7/4/322/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2227-7390/7/4/322/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Rajni Sharma & Ashu Bahl, 2015. "An Optimal Fourth Order Iterative Method for Solving Nonlinear Equations and Its Dynamics," Journal of Complex Analysis, Hindawi, vol. 2015, pages 1-9, November.
    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.
    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. 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.
    2. Liu, Dongjie & Liu, Chein-Shan, 2022. "Two-point generalized Hermite interpolation: Double-weight function and functional recursion methods for solving nonlinear equations," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 193(C), pages 317-330.
    3. 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.
    4. 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.
    5. 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.
    6. 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.
    7. Prem B. Chand & Francisco I. Chicharro & Neus Garrido & Pankaj Jain, 2019. "Design and Complex Dynamics of Potra–Pták-Type Optimal Methods for Solving Nonlinear Equations and Its Applications," Mathematics, MDPI, vol. 7(10), pages 1-21, October.

    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:7:y:2019:i:4:p:322-:d:218542. 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.