General Root Computation
Given a real continuous function, compute one of the roots.
Parameters
- : (additive) tolerance error
- : endpoint values, with
- : maximum number of iterations
Related Problems
Filters
Computational Model
Randomization
Approximation
Algorithms Table
Displaying 11 of 11 algorithms
| See more | ||||
|---|---|---|---|---|
| Ridder's method | 1979 | |||
| Anderson–Björck algorithm | 1973 | O(n_max) | O(1) | |
| Brent-Dekker Method | 1973 | O(n_max) | O(1) | |
| Illinois Algorithm | 1971 | O(n_max) | O(1) | |
| Muller's method | 1956 | |||
| Steffensen's method | 1940() | O(n_max) | O(1) | |
| Inverse quadratic interpolation | 1940() | O(n_max) | O(1) | |
| Secant method | 1940 | |||
| ITP Method | 1940 | O(n_0+log((b-a)/epsilon)) | O(1) | |
| Bisection method | 1820 | |||
| False position method | 1690 |
Reductions Table
Insuffient Data to display table
Other relevant algorithms
Insuffient Data to display table