secant method
Assuming "secant method" is referring to a mathematical definition | Use as or instead

Input interpretation

secant method

Definition

A root-finding algorithm which assumes a function to be approximately linear in the region of interest. Each improvement is taken as the point where the approximating line crosses the axis. The secant method retains only the most recent estimate, so the root does not necessarily remain bracketed. The secant method is implemented in the Wolfram Language as the undocumented option Method -> Secant in FindRoot[eqn, {x, x0, x1}].
When the algorithm does converge, its order of convergence is
lim_(k->∞) left bracketing bar ϵ_(k + 1) right bracketing bar ≈C( left bracketing bar ϵ right bracketing bar )^ϕ, where C is a constant and ϕ is the golden ratio.

Related term

method of false position