HybridRoots (Rust Port)
Four Multi-Phase Hybrid Bracketing Algorithms for Numerical Root Finding
A Rust library implementing four novel root-finding algorithms that combine bisection/trisection, false position, and modified secant methods for efficient, reliable nonlinear equation solving.
Why HybridRoots is Powerful
Classical root-finding algorithms face a tradeoff: methods like Bisection are 100% reliable but slow (averaging >40 iterations), while methods like Secant or Newton-Raphson are fast but can fail to converge or shoot out of bounds.
HybridRoots solves this by introducing multi-phase bracketing:
- Guaranteed Convergence: It maintains a strict bracket
[a, b]wheref(a) * f(b) < 0at all times. - Superior Speed: By combining Trisection, False Position, and an adaptive Modified Secant step, it drastically reduces the search space. The
mptfmsalgorithm converges in an average of just 2.33 iterations across 48 complex benchmark functions.
The Algorithms
- Opt.BFMS (
mpbfms): Bisection + False Position + Modified Secant (Avg 2.69 iterations) - Opt.TFMS (
mptfms): Trisection + False Position + Modified Secant (Avg 2.33 iterations) - Opt.BF (
mpbf): Bisection + False Position (Avg 6.58 iterations) - Opt.TF (
mptf): Trisection + False Position (Avg 5.19 iterations)
Installation
Add this to your Cargo.toml:
[]
= "1.0.0"
Usage
use mptfms;
Citation
If you use this package in your research, please cite:
- Paper DOI: 10.21608/joems.2026.440115.1078