IDEAS home Printed from https://ideas.repec.org/a/eee/matcom/v215y2024icp1-20.html
   My bibliography  Save this article

A superlinear Scaling Factor Regula Falsi root finder that detects the simple or multiple character of the root

Author

Listed:
  • Fernández-Díaz, Julio M.
  • Menéndez-Pérez, César O.

Abstract

In this work a new method of Scaling Factor Regula Falsi type is developed, by using parabolic interpolation. It has global convergence and a high computational efficiency for simple roots. The method, not being a hybrid one, allows changing the function used for calculating the scaling factor at every iteration, making possible to switch to other more adequate methods for multiple roots (e.g., a generalised Illinois one). As an important feature of the method, it allows determining with no additional calculations, whether the root is simple or multiple. The developed algorithm has been tested with numerous functions extracted from the bibliography, performing, in most cases, better than some routines (like brentq, brenth and toms748) found in common numerical libraries. Fully operative routines of the new method are provided as supplementary files in four different programming languages: python, lua, C and Fortran90.

Suggested Citation

  • Fernández-Díaz, Julio M. & Menéndez-Pérez, César O., 2024. "A superlinear Scaling Factor Regula Falsi root finder that detects the simple or multiple character of the root," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 215(C), pages 1-20.
  • Handle: RePEc:eee:matcom:v:215:y:2024:i:c:p:1-20
    DOI: 10.1016/j.matcom.2023.08.003
    as

    Download full text from publisher

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

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

    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:matcom:v:215:y:2024:i:c:p:1-20. 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: http://www.journals.elsevier.com/mathematics-and-computers-in-simulation/ .

    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.