Jump to content

Root-finding algorithm

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by 131.183.81.100 (talk) at 21:38, 30 November 2002. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

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:

Retrieved from "https://en.wikipedia.org/w/index.php?title=Root-finding_algorithm&oldid=1546132"