Maybeck; Peter S Extended Kalman Filter (Filtering Problem (Stochastic Processes) Filtering Problem (Stochastic Processes))
Revision as of 10:53, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^{2} log^{2} n)$ == 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 == 1979 == Reference ==")
Time Complexity
$O(n^{2} log^{2} n)$
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
1979