Root finding algorithm: Difference between revisions
Content deleted Content added
mNo edit summary |
Redirect to page with correctly punctuated title |
||
| Line 1: | 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]] F. Here, x may be a single [[real number]] or a [[vector]]. |
|||
Root finding algorithms are studied in [[numerical analysis]]. |
|||
Root finding algorithm include: |
|||
* [[Newton's method]] |
|||
* [[Bisection]] |
|||
| ⚫ | |||
Revision as of 21:38, 30 November 2002
Redirect to: