Brent-Dekker 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 previous 3 estimates x_i, x_{i-1}, and x_{i-2} along with function values f_i, f_{i-1}, f_{i-2}; 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

1973

Reference

https://books.google.com/books?vid=ISBN0130223352