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. Root-finding algorithms are studied in numerical analysis.
Template:AnchorPages in category "Root-finding algorithms"
The following 9 pages are in this category, out of 9 total.