Comparative Analysis of Recursive Kalman Type Algorithms for Polynomial Filtering Problems

Using an earlier developed procedure, comparative analysis of recursive Kalman type algorithms used in polynomial filtering is performed. By the example of the beacon navigation problem, it has been shown that the proposed procedure enables the comparison of algorithms in terms of accuracy, consistency, and computational complexity.