Root-finding algorithm: Difference between revisions

Revision as of 10:59, 19 March 2004

Revision as of 20:03, 22 March 2004

Line 1:

A '''root-finding algorithm''' is a numerical method or [[algorithm]] of finding a value ''x'' such that ''F(x) = 0'', for a given [[function (mathematics)|function]] ''F''. Here, ''x'' may be a single [[real number]] or a [[vector space|vector]].

Root-finding algorithms are studied in [[numerical analysis]].