Order estimation for subspace methods

From MaRDI portal





The author proposes three methods for order estimation in the context of subspace methods. Two of them, both in the cases with observed inputs and without exogenous inputs, are based on the information contained in the estimated singular values (SV) and lower bounds on the (subjective) penalty term in order for the estimates to be (strongly) consistent. The third uses the innovation variance, and it is shown to suffer from severe theoretical disadvantages. The first two can be applied with almost no computational costs to Larimore type and MOESP type procedures, whereas the third is only applied to Larimore type algorithms. Numerical examples and simulation studies illustrate the obtained results.





Describes a project that uses

Uses Software






This page was built for publication: Order estimation for subspace methods

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5947627)