Kalman Filter (Filtering Problem (Stochastic Processes) Filtering Problem (Stochastic Processes))

From Algorithm Wiki

Revision as of 11:53, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^{3})$ == Space Complexity == $O(n^{2})$? words (Generally works with a constant number of O(n)*O(n)-sized matrices per iteration) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word/Real RAM == Year == 1960 == Reference ==")

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to navigation Jump to search

Time Complexity

$O(n^{3})$

Space Complexity

$O(n^{2})$? words

(Generally works with a constant number of O(n)*O(n)-sized matrices per iteration)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word/Real RAM

Year

1960

Reference

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Kalman_Filter_(Filtering_Problem_(Stochastic_Processes)_Filtering_Problem_(Stochastic_Processes))&oldid=44940"