The secant method is a root-finding algorithm that approximates a function as linear in the region of interest and finds where the approximating line crosses the x-axis to estimate the next root. It only retains the most recent estimates, so the root may become unbracketed. When it converges, its order of convergence is quadratic.