Householder's Method (Root Computation with continuous derivatives (up to d) Root Computation)

From Algorithm Wiki
Jump to navigation Jump to search

Time Complexity

$O(d*n_max)$?

Space Complexity

$O(d)$ words

(Store current estimate x_i and the derivatives f' through f^{(d)} (assuming these take O(1) space each); 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

1940(?)

Reference

-