Implements a modified version of the
secant method
for approximating a zero of a real univariate function.
The algorithm is modified to maintain bracketing of a root by successive
approximations. Because of forced bracketing, convergence may be slower than
the unrestricted secant algorithm. However, this implementation should in
general outperform the
regula falsi method.
The function is assumed to be continuous but not necessarily smooth.
The algorithm is modified to maintain bracketing of a root by successive approximations. Because of forced bracketing, convergence may be slower than the unrestricted secant algorithm. However, this implementation should in general outperform the regula falsi method.
The function is assumed to be continuous but not necessarily smooth.