Root-finding algorithm

Definition

The term root-finding algorithm is used for any algorithm, exact or numerical, for finding a root of a function. Explicitly, given a function $f$, the goal is to find a value $x$ in the domain of $f$ such that $f(x)=0$.

The term is typically used for an algorithm that fins any root of a function, rather than all roots, though it may also be used for an algorithm intended to find all roots.