Bisection method (General Root Computation Root Computation)
Revision as of 11:15, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(n_{max})$ == Space Complexity == $O({1})$ words (Store current endpoint values; iterations take $O(1)$ time and thus $O(1)$ space, and space can be re-used across iterations) == Description == == Approximate? == Approximate Approximation Factor: epsilon, additive == Randomized? == No, deterministic == Model of Computation == Word/Real RAM == Year == 1820 == Reference == -")
Time Complexity
$O(n_{max})$
Space Complexity
$O({1})$ words
(Store current endpoint values; iterations take $O(1)$ time and thus $O(1)$ space, and space can be re-used across iterations)
Description
Approximate?
Approximate
Approximation Factor: epsilon, additive
Randomized?
No, deterministic
Model of Computation
Word/Real RAM
Year
1820
Reference
-