ITP Method (General Root Computation Root Computation)

Time Complexity

$O(n_0+log((b-a)$/epsilon))

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)

Approximate?

Approximate

Approximation Factor: epsilon, additive

Randomized?

No, deterministic

Model of Computation

Word/Real RAM

Year

1940?

Reference

-