Maybeck; Peter S Extended Kalman Filter (Filtering Problem (Stochastic Processes) Filtering Problem (Stochastic Processes)): Difference between revisions
Jump to navigation
Jump to search
(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 ==") |
No edit summary |
||
| Line 1: | Line 1: | ||
== Time Complexity == | == Time Complexity == | ||
$O(n^{2} log^{2} n)$ | $O(n^{2} \log^{2} n)$ | ||
== Space Complexity == | == Space Complexity == | ||
Latest revision as of 08:49, 10 April 2023
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