Stable State Space SubSpace (S$^5$) Identification
Xinhui Rong, Victor Solo
TL;DR
This work introduces S$^5$, a closed-form, tuning-parameter-free stable state-space subspace identification method for IO-SS and N-SS with VAR(1) inputs. By extracting a Markovian state via a Sylvester equation and applying correlation-stable estimators, S$^5$ yields stable estimates of $A$ and $A_u$ with proven consistency under standard assumptions, while remaining computationally efficient even at high state dimensions. Theoretical results establish strong consistency for both the stabilized input and system matrices, and extensive simulations show superior accuracy and speed compared with existing stability-guaranteed methods, especially as model order grows. The approach offers a practically impactful solution for reliable, large-scale system identification where guaranteeing stability is essential.
Abstract
State space subspace algorithms for input-output systems have been widely applied but also have a reasonably well-developedasymptotic theory dealing with consistency. However, guaranteeing the stability of the estimated system matrix is a major issue. Existing stability-guaranteed algorithms are computationally expensive, require several tuning parameters, and scale badly to high state dimensions. Here, we develop a new algorithm that is closed-form and requires no tuning parameters. It is thus computationally cheap and scales easily to high state dimensions. We also prove its consistency under reasonable conditions.
