Levinson–Durbin recursion (Toeplitz Matrix Linear System)

From Algorithm Wiki
Revision as of 10:32, 15 February 2023 by Admin (talk | contribs) (Created page with "== 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")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Levinson–Durbin_recursion_(Toeplitz_Matrix_Linear_System)&oldid=44408"