Muller's method (General Root Computation Root Computation)

From Algorithm Wiki
Revision as of 11:15, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(n_{max})$ == Space Complexity == $O({1})$ words (Store previous 3 estimates x_i, x_{i-1}, and x_{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 == 1956 == Reference == https://www-jstor-org.ezproxy.canberra.edu.au/stable/200...")
(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 previous 3 estimates x_i, x_{i-1}, and x_{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

1956

Reference

https://www-jstor-org.ezproxy.canberra.edu.au/stable/2001916

Retrieved from "https://algorithm-wiki-csail-mit-edu.ezproxy.canberra.edu.au/w/index.php?title=Muller%27s_method_(General_Root_Computation_Root_Computation)&oldid=45354"