# Muller's method (General Root Computation Root Computation)

Revision as of 12: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/stable/200...")

## 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