Subspace identification of multivariable linear parameter-varying systems

A subspace identification method is discussed that deals with multivariable linear parameter-varying state-space systems with affine parameter dependence. It is shown that a major problem with subspace methods for this kind of system is the enormous dimension of the data matrices involved. To overcome the curse of dimensionality, we suggest using only the most dominant rows of the data matrices in estimating the model. An efficient selection algorithm is discussed that does not require the formation of the complete data matrices, but processes them row by row.