Halley's method (Root Computation with continuous second derivative Root Computation)
Jump to navigation
Jump to search
Time Complexity
$O(n_{max})$
Space Complexity
$O({1})$ words
(Store current estimate x_i and the derivatives f' and f (assuming this takes O(1) space); 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
-