Skip to Main Content
Square-root information falter formulations of the discrete-time Kalman filter are sometimes thought to be restricted by a requirement that the state transition matrix be nonsingular. In a recent publication , Boncelet, Jr. and Dickinson have shown that this restriction is not necessary. For problems where both formulations can be applied, the generalized formulation is, however, more computation intensive than the direct formulation described by Bierman . Also, it is shown here that transition singularities associated with time delays are removable and can be efficiently handled in the SRIF.