Category:Root-finding algorithms
From Wikipedia, the free encyclopedia
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.
Pages in category "Root-finding algorithms"
The following 32 pages are in this category, out of 32 total. This list may not reflect recent changes (learn more).
*ABDF |
GHIJLM |
NRS |
