Repository navigation
Methods
Each method returns t, which is used to compute the next point with the formula
x = x1 + t ( x2 - x1 )
a.k.a. binary search
The midpoint of the bracketing interval is used.
t = 0.5
a.k.a. Regula Falsi and Secant
The root is estimated using a secant line through x1 and x2.
t = f ( x2 ) / ( f ( x2 ) - f ( x1 ) )
The root is estimated using a secant line through x2 and x3.
t = ( f ( x2 ) / ( f ( x2 ) - f ( x3 ) ) ) ( ( x2 - x3 ) / ( x2 - x1 ) )
a.k.a. Brent-Dekker and fzeroin
When possible, inverse quadratic interpolation through x1, x2, and x3 is used. If division by zero would occur, a secant line through x1 and x2 is used instead. Some conditions are then checked to use bisection instead.
l = ( x3 - x2 ) / ( x1 - x2 )
a = f ( x2 ) / ( f ( x1 ) - f ( x2 ) )
b = f ( x3 ) / ( f ( x1 ) - f ( x3 ) )
c = f ( x2 ) / ( f ( x3 ) - f ( x2 ) )
d = f ( x1 ) / ( f ( x3 ) - f ( x1 ) )
t = a b + c d l
if division by zero occurs:
- t = f ( x2 ) / ( f ( x2 ) - f ( x1 ) )
if t < 0 or t > 1 or
(bisection was last used and t | x1 - x2 | > 0.5 | x2 - x3 | )
(interpolation was last used and t | x1 - x2 | > 0.5 | x3 - x4 |)
- t = 0.5



