Category:Root-finding algorithms
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.
Subcategories
This category has the following 2 subcategories, out of 2 total.
Next items are not visible in browsers without Javascript
Next items are not visible in browsers without Javascript
Pages in category "Root-finding algorithms"
The following 20 pages are in this category, out of 20 total.
Next items are not visible in browsers without Javascript
Next items are not visible in browsers without Javascript
This category content has been reduced to only pages contained in the ZIM file.
Categories: