Matrix analysis
System identification: theory for the user
System identification: theory for the user
N4SID: subspace algorithms for the identification of combined deterministic-stochastic systems
Automatica (Journal of IFAC) - Special issue on statistical signal processing and control
Subspace-based methods for the identification of linear time-invariant systems
Automatica (Journal of IFAC) - Special issue on trends in system identification
A linear regression approach to state-space subspace system identification
Signal Processing - Special issue: subspace methods, part II: system identification
Matrix computations (3rd ed.)
Maximum likelihood parameter and rank estimation in reduced-rankmultivariate linear regressions
IEEE Transactions on Signal Processing
Fast communication: Some empirical advances in matrix completion
Signal Processing
Hi-index | 0.00 |
In this paper we consider the reduced rank regression problem minrank L=n,L3 det(Yα - LPβ - L3Uα)(Yα - LPβ - L3Uα)T solved by maximum-likelihood-inspired state-space subspace system identification algorithms. We conclude that the determinant criterion is, due to potential rank-deficiencies, not general enough to handle all problem instances. The main part of the paper analyzes the structure of the reduced rank minimization problem and identifies signal properties in terms of geometrical concepts. A more general minimization criterion is considered, rank reduction followed by volume minimization. A numerically sound algorithm for minimizing this criterion is presented and validated on both simulated and experimental data.