Aroot-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.
This category has only the following subcategory.
The following 36 pages are in this category, out of 36 total. This list may not reflect recent changes.