Is there any writeup of Chandrupatla's algorithm for root finding, besides his original article? A new hybrid quadratic/bisection algorithm for finding the zero of a nonlinear function without using derivatives, Tirupathi R. Chandrupatla, Advances in Engineering Software, Volume 28 Issue 3, April 1997, Pages 145 - 149.
There's a number of writeups of Brent's method, but for Chandrupatla's algorithm, I don't have access to the aforementioned article, and I could only find one writeup in a book by Scherer which gives the equations, but no complete description. I don't understand the significance of $\xi$ and $\Phi$:
$$ \xi = \frac{a-b}{c-b}$$ $$ \Phi = \frac{f_a - f_b}{f_c - f_b} $$
and inverse quadratic interpolation is used if $ \Phi^2 < \xi $ and $ (1-\Phi)^2 < 1-\xi $, bisection otherwise.
Suppose $b < a < c$ and $b = 0$; then the ratio $\xi = {a \over c}$ says where the middle point $a$ is, left .. right, in the interval. Similarly, $\Phi$ says how low / how high $f_a$ is. If $[a, f_a]$ is near a straight line between the outer two points, then linear interpolation should be pretty good; if in Chandrupatla's region ... ?
Other permutations of $a\ b\ c$ and $f_a\ f_b\ f_c$ are symmetric.
(But why inverse-quadratic ? Any 3-point interpolator will be good for some functions, poor for others. See Illinois False position method , and the nice answers to method-of-false-position-regular-falsi-pros-cons .)