抄録
Using a unified approach, recursive subspace identification algorithms are derived for the MOESP type of subspace methods. The proposed approach is based on the fact that the subspace extraction amounts to computing singular value decomposition of the Schur complement (SC) of the input submatrix in data product moments and the SC can be interpreted as the least squares residuals.
