Secant method (General Root Computation Root Computation)

Time Complexity

$O(n_{max})$

$O({1})$ words

(Store previous 2 estimates x_i and x_{i-1}; iterations take O(1) time and thus O(1) space, and space can be re-used across iterations)

Approximate

Approximation Factor: epsilon, additive

No, deterministic

Word/Real RAM

1940

-