Secant

Subtype of Algorithm

Corresponds to the QuantLib Secant solver.
The solution finding criterium for the found root x is:
|(x - x₀)f(x₀)/[f(x₀) - f(x)]| < ε, where x₀ is the value assumed by the independent variable in the last trial before being set to x