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:



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
Dynabee

... while the other end of the axis pushes against the lower rim of the groove. While the axis is slipping around inside the groove, the friction between the axis and the ...

 
 
 
This page was created in 27.1 ms