Encyclopedia > Root-finding algorithm

Article Content

Root-finding algorithm

A root-finding algorithm is a numerical method or algorithm of finding a value x such that F(x) = 0, for a given function F. Here, x may be a single real number or a vector. Root-finding algorithms are studied in numerical analysis.

Root-finding algorithm include:

Newton's method
Bisection

All Wikipedia text is available under the terms of the GNU Free Documentation License

Search Encyclopedia

Search over one million articles, find something about almost anything!

Featured Article

Sanskrit language

... more well-behaved. Exponents utilized in verb conjugation include prefixes, suffixes, infixes, and reduplication. Also extremely common is vowel gradation; every root ...