Levinson- and chandrasekhar-type equations for a general discrete-time linear estimation problem

Abstract

Recursive algorithms for the solution of linear least-squares estimation problems have been based mainly on state-space models. It has been know, however, that such algorithms exist for stationary time-series, using input-output descriptions (e.g., covariance matrices). We introduce a way of classifying stochastic processes in terms of their "distance" from stationarity that leads to a derivation of an efficient Levinson-type algorithm for arbitrary (nonstationary) processes. By adding structure to the covariance matrix, these general results specialize to state-space type estimation algorithms. In particular, the Chandrasekhar equations are shown to be the natural descendants of the Levinson algorithm.