View source for Root-finding algorithm

A '''root-finding algorithm''' is a numerical method, or [[algorithm]], for finding a value '''x''' such that '''f(x) = 0''', for a given [[Function (mathematics)|function]] '''f'''. Such an '''x''' is called a root of the function '''f'''.

This article is concerned with finding scalar, real or complex roots, approximated as floating point numbers.

== Integer roots ==

Finding integer roots or exact algebraic roots are separate problems, whose algorithms have little in common with those discussed here. See [[Diophantine equation]] for integer roots.

== See also ==

* [[nth root algorithm]]
* [[Broyden's method]]
* [[Cryptographically secure pseudorandom number generator]] — a class of functions designed specifically to be unsolvable by root-finding algorithms.
* [[GNU Scientific Library]]
* [[Graeffe's method]]
* [[MPSolve]]
* [[Multiplicity (mathematics)]]
* [[Polynomial greatest common divisor]]
* [[Polynomial]]
* [[System of polynomial equations]] — root-finding algorithms in the multivariate case

== External links ==

* [https://en.wikipedia.org/wiki/Root-finding_algorithm Root-finding algorithm] @ Wikipedia

[[Category:Mathematics]]