# Root-finding algorithm

A

**root-finding algorithm** is a numerical method or

algorithm of finding a value

*x* such that

*F(x) = 0*, for a given

function *F*. Here,

*x* may be a single

real number or a

vector.
Root-finding algorithms are studied in

numerical analysis.

Root-finding algorithms include: