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
Springs, New York

... residing in the town. The population density is 225.9/km² (584.8/mi²). There are 3,878 housing units at an average density of 177.0/km² ...

 
 
 
This page was created in 31.9 ms