Root finding algorithm: Difference between revisions

Content deleted Content added

Inline

Revision as of 21:18, 30 November 2002

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

@@ Line 1: / Line 1: @@
-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.
+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]].
-Methods of root finding algorithm include:
+Root finding algorithm include:
 * [[Newton's method]]