Jump to content

Root finding algorithm

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Roadrunner (talk | contribs) at 00:25, 28 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 of finding a value x such that F(x) = 0. X may be a single real number of vector.

Methods of root finding algorithm include: