Version 1
: Received: 26 December 2023 / Approved: 27 December 2023 / Online: 28 December 2023 (02:04:55 CET)
How to cite:
Sabharwal, C. L. A New Wave of Hybrid Algorithms for Roots of Transcendental and Non-Linear Equations. Preprints2023, 2023122108. https://doi.org/10.20944/preprints202312.2108.v1
Sabharwal, C. L. A New Wave of Hybrid Algorithms for Roots of Transcendental and Non-Linear Equations. Preprints 2023, 2023122108. https://doi.org/10.20944/preprints202312.2108.v1
Sabharwal, C. L. A New Wave of Hybrid Algorithms for Roots of Transcendental and Non-Linear Equations. Preprints2023, 2023122108. https://doi.org/10.20944/preprints202312.2108.v1
APA Style
Sabharwal, C. L. (2023). A New Wave of Hybrid Algorithms for Roots of Transcendental and Non-Linear Equations. Preprints. https://doi.org/10.20944/preprints202312.2108.v1
Chicago/Turabian Style
Sabharwal, C. L. 2023 "A New Wave of Hybrid Algorithms for Roots of Transcendental and Non-Linear Equations" Preprints. https://doi.org/10.20944/preprints202312.2108.v1
Abstract
Finding the roots of an equation is a fundamental problem in diverse fields. Optimization problem leads to non-linear equations for calculating the roots of the equation efficiently. Numerical iterative techniques are frequently applied when analytic solution is not available. Hybrid techniques to find roots of an equation is new to this fundamental problem. Recently, some attempts emerged to design hybrid algorithms for efficient solutions. A new heuristic algorithm is designed which is an intuitive approach to hybridization. In this paper, we implement two new algorithms: (1) a new BTsection algorithm blending the Bisection and Trisection algorithm, (2) a hybrid algorithm, that promises to be more efficient than the existing hybrid algorithms. The new hybrid algorithm is a blend of BTsection algorithm and Regula Falsi algorithm. The implementation results validate that the new algorithm, Hybrid4, surpasses the efficiency of existing hybrid algorithms Hybrid1, Hybrid2, and Hybrid3 algorithms. This paper contributes an essential hybrid algorithm to the repertoire of hybrid root finding algorithms.
Computer Science and Mathematics, Computational Mathematics
Copyright:
This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.