Crate hybridroots 

hybridroots

Four Multi-Phase Hybrid Bracketing Algorithms for Numerical Root Finding.

Implements the algorithms introduced in:

Ellithy, A. (2026). Four New Multi-Phase Hybrid Bracketing Algorithms for Numerical Root Finding. Journal of the Egyptian Mathematical Society, 34. DOI: https://doi.org/10.21608/joems.2026.440115.1078

All algorithms are deterministic and guarantee convergence for any continuous function f on a bracket [a, b] where f(a) * f(b) < 0.

Quick Start

use hybridroots::mptfms;

let result = mptfms(&|x: f64| x * x - 2.0, 1.0, 2.0, 1e-14, 10000);
assert!(result.converged);
println!("sqrt(2) ≈ {}", result.root);

Structs

HybridRootsResult

Result returned by every HybridRoots algorithm.

Functions

mpbf

Multi-Phase Bisection–False Position (Opt.BF).

mpbfms

Multi-Phase Bisection–False Position–Modified Secant (Opt.BFMS).

mptf

Multi-Phase Trisection–False Position (Opt.TF).

mptfms

Multi-Phase Trisection–False Position–Modified Secant (Opt.TFMS).