Anderson–Björck algorithm (General Root Computation Root Computation)

From Algorithm Wiki
Revision as of 11:18, 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? == Approximate Approximation Factor: epsilon, additive == Randomized? == No, deterministic == Model of Computation == Word/Real RAM == Year == 1973 == Reference == https://link-springer-com.ezproxy.canberra.edu.au/article/10.1007/BF01951936")
(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?

Approximate

Approximation Factor: epsilon, additive

Randomized?

No, deterministic

Model of Computation

Word/Real RAM

Year

1973

Reference

https://link-springer-com.ezproxy.canberra.edu.au/article/10.1007/BF01951936

Retrieved from "https://algorithm-wiki-csail-mit-edu.ezproxy.canberra.edu.au/w/index.php?title=Anderson–Björck_algorithm_(General_Root_Computation_Root_Computation)&oldid=45655"