Here is a list of articles in the Root-finding algorithms category of the Computing portal that unifies foundations of mathematics and computations using computers. 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 44 pages are in this category, out of 44 total.
- Root-finding algorithms (computing)
- Root-finding algorithm (computing)
- CORDIC (computing)
- Durand–Kerner method (computing)
- Jenkins–Traub algorithm (computing)