Bisection method (Solutions to Nonlinear Equations Solutions to Nonlinear Equations)

From Algorithm Wiki
Revision as of 12:17, 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? == Exact == Randomized? == No, deterministic == Model of Computation == Word/Real RAM == Year == -150 == Reference ==")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

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?

Exact

Randomized?

No, deterministic

Model of Computation

Word/Real RAM

Year

-150

Reference

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Bisection_method_(Solutions_to_Nonlinear_Equations_Solutions_to_Nonlinear_Equations)&oldid=45567"