Levinson–Durbin recursion (Toeplitz Matrix Linear System)
Jump to navigation
Jump to search
Time Complexity
$O(n^{2})$
Space Complexity
$O(n^{2})$ total words
(can be easily derived (lower bounded by input size, upper bounded by runtime))
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
1947
Reference
https://onlinelibrary.wiley.com/doi/abs/10.1002/sapm1946251261