Category:Root-finding algorithms
Jump to navigation
Jump to search
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.
Script error: No such module "anchor".Pages in category "Root-finding algorithms"
The following 12 pages are in this category, out of 12 total.