Root-finding algorithm
A root-finding algorithm is a numerical method or algorithm for finding a value x such that f(x) = 0, for a given function f. Here, x is a single real number called the root.
When x is a vector, algorithms to find x such that f(x) = 0 are generally called "equation-solving algorithms". These algorithms are a generalization of root-finding and can operate either on linear or non-linear equations. Some root-finding algorithms (such as Newton's method) can be directly generalized to solve non-linear equations.
Root-finding algorithms are studied in numerical analysis.
Root-finding algorithms include:
