Root-finding algorithm: Difference between revisions

Revision as of 22:24, 1 June 2004

Revision as of 16:11, 26 June 2004

Line 1:

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

When ''x'' is a vector, algorithms to find ''x'' such that ''f(x)'' = 0 are generally called "equation-solving algorithms". These algorithms are a generalization of root-finding and can operate either on [[linear]] or [[non-linear]] equations.

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