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

A Comparative Study among New Hybrid Root Finding Algorithms and Traditional Methods

Author

Listed:
  • Elsayed Badr

    (Scientific Computing Department, Faculty of Computers & Artificial Intelligence, Benha University, Benha 13518, Egypt
    Higher Technological Institute, 10th of Ramadan City, Embassies District, Nasr City, Cairo 11765, Egypt)

  • Sultan Almotairi

    (Department of Natural and Applied Sciences, Community College Majmaah University, Al-Majmaah 11952, Saudi Arabia)

  • Abdallah El Ghamry

    (Computer Science Department, Faculty of Computers & Artificial Intelligence, Benha University, Benha 13518, Egypt)

Abstract

In this paper, we propose a novel blended algorithm that has the advantages of the trisection method and the false position method. Numerical results indicate that the proposed algorithm outperforms the secant, the trisection, the Newton–Raphson, the bisection and the regula falsi methods, as well as the hybrid of the last two methods proposed by Sabharwal, with regard to the number of iterations and the average running time.

Suggested Citation

  • Elsayed Badr & Sultan Almotairi & Abdallah El Ghamry, 2021. "A Comparative Study among New Hybrid Root Finding Algorithms and Traditional Methods," Mathematics, MDPI, vol. 9(11), pages 1-15, June.
    • Handle: RePEc:gam:jmathe:v:9:y:2021:i:11:p:1306-:d:570208
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/9/11/1306/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/9/11/1306/
    Download Restriction: no
    ---><---

    Citations

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


    Cited by:

    1. S. Sapna & Biju R. Mohan, 2024. "Comparative Analysis of Root Finding Algorithms for Implied Volatility Estimation of Ethereum Options," Computational Economics, Springer;Society for Computational Economics, vol. 64(1), pages 515-550, July.

    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:9:y:2021:i:11:p:1306-:d:570208. 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: 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.