Past input reconstruction in backward consistent fast least-squares algorithms

We present an analytic solution to the past input reconstruction problem, which consists in describing all past input sequences which would give rise to a given set of variables in fast least-squares algorithms, whenever the variables in questionare reachable.