Root finding algorithm: Difference between revisions
Content deleted Content added
No edit summary |
mNo edit summary |
||
| Line 6: | Line 6: | ||
* [[Newton's method]] |
* [[Newton's method]] |
||
* [[Bisection]] |
* [[Bisection]] |
||
[[Root-finding algorithm]] |
|||
Revision as of 21:36, 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: