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.

Articles in category "Root-finding algorithms"

There are 13 articles in this category.

Root-finding algorithm B Bisection method Brent's method F False position method

I Inverse quadratic interpolation J John Gabriel's Nth root algorithm L Laguerre's method M Müller's method N N-th root algorithm

N cont. Newton's method R Ruffini's rule S Secant method Shifting nth-root algorithm