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
Royalist

... shades of meaning. At its simplest, it refers to an adherent of a monarch or royal family. Of the more specific uses of the term, the most common include: 1. A ...

 
 
 
This page was created in 46 ms