Root-finding algorithm

This is an old revision of this page, as edited by Charles Matthews (talk | contribs) at 10:59, 19 March 2004 (fmt). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

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 algorithms include: