论文信息 - Two subspace algorithms for the identification of combined deterministic-stochastic systems

Two subspace algorithms for the identification of combined deterministic-stochastic systems

Two new subspace algorithms for identifying mixed deterministic-stochastic systems are derived. Both algorithms determine state sequences through the projection of input and output data. These state sequences are shown to be outputs of nonsteady-state Kalman filter banks. From these it is easy to determine the state space system matrices. The algorithms are always convergent (noninterative) and numerically stable since they only make use of QR and singular value decompositions. The two algorithms are similar, but the second one trades off accuracy for simplicity. An example involving a glass oven is considered. >

P. Van Overschee | B. De Moor

[1] Sun-Yuan Kung,et al. A new identification and model reduction algorithm via singular value decomposition , 1978 .

[2] Wallace E. Larimore,et al. Canonical variate analysis in identification, filtering, and adaptive control , 1990, 29th IEEE Conference on Decision and Control.

[3] Johan A. K. Suykens,et al. Subspace algorithms for system identification and stochastic realization , 1991 .

[4] Michel Verhaegen,et al. A Novel Non-Iterative Mimo State Space Model Identification Technique , 1991 .

[5] P. Van Overschee,et al. Subspace algorithms for the stochastic identification problem , 1991 .

[6] K. Arun,et al. Balanced approximation of stochastic systems , 1990 .

[7] M. Moonen,et al. On- and off-line identification of linear state-space models , 1989 .

[8] M. Moonen,et al. A subspace algorithm for balanced state space system identification , 1993, IEEE Trans. Autom. Control..