False position method (General Root Computation Root Computation)

From Algorithm Wiki
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?

Approximate

Approximation Factor: epsilon, additive

Randomized?

No, deterministic

Model of Computation

Word/Real RAM

Year

1690

Reference

-