Jump to content

Root finding algorithm: Difference between revisions

From Wikipedia, the free encyclopedia
Content deleted Content added
No edit summary
(No difference)

Revision as of 00:25, 28 November 2002

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: