Efficient L-D factorization algorithms for PDA, IMM, and IMMPDA filters

Efficient algorithms exist for the square-root probabilistic data association filter (PDAF). The same approach is extended to develop square-root versions of the interacting multiple model (IMM) Kalman filter and the IMMPDAF algorithms. The computational efficiency of the method stems from the fact that the terms needed in the overall covariance updates of PDAF, IMM, and IMMPDAF can be obtained as part of the square-root covariance update of an ordinary Kalman filter. In addition, a new square-root covariance prediction algorithm that is substantially faster than the usual modified weighted Gram-Schmidt (MWG-S) algorithm, whenever the process noise covariance matrix is time invariant, is proposed.< >