Brent's method is an efficient numerical root-finding algorithm that combines ideas from both the bisection method and the secant method to find roots of a function. Specifically, it seeks to leverage the robustness of bisection while taking advantage of the faster convergence of the secant method when possible.
New to topics? Read the docs here!