(520a) Simpca with Modified Instrumental Variable to Improve Estimation Accuracy | AIChE

(520a) Simpca with Modified Instrumental Variable to Improve Estimation Accuracy


Wang, J. - Presenter, Spansion LLC
Qin, S. J. - Presenter, The University of Texas at Austin

Based on projection techniques in Euclidean space, subspace identification methods (SIMs) have been one of the main streams of research in system identification (Gevers, 2003). Several representative algorithms have been published, including canonical variate analysis (CVA, Larimore, 1983; 1990), numerical algorithm of subspace state space system identification (N4SID, Van Overschee and De Moor, 1994) and multivariate output-error state space (MOESP, Verhaegen, 1994). The asymptotic properties of these subspace algorithms also have been investigated in the past decade and consistency conditions of the estimates have been identified (Deistler et al., 1995; Peternell et al., 1996; Jansson and Wahlberg, 1998; Bauer et al., 1999; Bauer and Jansson, 2000; Knudsen, 2001). The effect of weighting matrices and more explicit expressions for the asymptotic variance of the model estimates have been obtained recently (Bauer and Ljung, 2002; Gustafsson, 2002).

SIMs have many advantages compared to prediction error method, such as its simplicity in parameterization, better numerical reliability and modest computational complexity. However, they also have certain drawbacks. One is that SIMs may give biased estimate for errors-in-variables; another is that many SIMs do not work on closed-loop data (Ljung and McKelvey, 1996; Forssell and Ljung, 1999), even though the data satisfy identifiability conditions for prediction error methods.

SIMPCA, known as subspace identification method via principal component analysis, is the method we recently developed to address these two aspects. While most existing subspace identification methods use the observable subspace to estimate the observability matrix, SIMPCA uses the null space or parity space that has been used in fault detection literature to extract the system information. SIMPCA makes use of PCA to extract the extended observability matrix Gamma_f and Toeplitz matrix H_f from input and output data, much similar to the total least squares in the sense that both input and output variables are included in the PCA decomposition, which naturally handles errors-in-variables situation. SIMPCA with a column weighting is also proposed (Wang and Qin, 2004) to improve the accuracy in the model estimates.

In this work, we modified the instrumental variable and corresponding weighting applied in SIMPCA which can significantly improve the estimate accuracy of system, to be specific, the system zero estimation, especially in the errors-in-variables case. The modified instrumental variable also improves the system order estimation via AIC index. We give geometric interpretations of the difference between SIMPCA with modified instrumental variable and CVA. The performance of original SIMPCA, modified SIMPCA, MOESP and CVA are compared through a simulation example.

References [1] D. Bauer, M. Deistler, and W. Scherrer. Consistency and asymptotic normality of some subspace algorithms for systems without observed inputs. Automatica, 35:1243-1254, 1999. [2] D. Bauer and M. Jansson. Analysis of the asymptotic properties of the MOESP type of subspace algorithms. Automatica, 36(4):497-509, 2000. [3] D. Bauer and L. Ljung. Some facts about the choice of the weighting matrices in larimore type of subspace algorithms. Automatica, 38:763-773, 2002. [4] M. Deistler, K. Peternell, and Scherrer. Consistency and relative e±ciency of subspace methods. Automatica, 31:1865-1875, 1995. [5] U. Forssell and L. Ljung. Closed-loop identification revisited. Automatica, 35:1215-1241, 1999. [6] M. Gevers. A personal view on the development of system identification. In Proceedings of 13th IFAC symposium on System Identification, pages 773-784, Rotterdam, Nether- lands, 2003. [7] T. Gustafsson. Suspace-based system identification: weighting and pre-filtering of in- struments. Automatica, 38:433-443, 2002. [8] M. Jansson and B. Wahlberg. On consistency of subspace methods for system identifi- cation. Automatica, 34(12):1507-1519, 1998. [9] T. Knudsen. Consistency analysis of subspace idenfification methods based on a linear regression approach. Automatica, 37:81-89, 2001. [10] W.E. Larimore. System identification, reduced-order filtering and modeling via canon- ical variate analysis. In Proc. 1983 American Control Conf., H.S. Rao and T. Dorato (Ed), IEEE, New York, 1983. [11] W.E. Larimore. Canonical variate analysis in identification, filtering and adaptive con- trol. In Proc. 29th Conference on Decision and Control, Honolulu, Hawaii, December 1990. [12] L. Ljung and T. McKelvey. Subspace identification from closed loop data. Signal Processing, 52:209-215, 1996. [13] P. Van Overschee and B. De Moor. N4SID: subspace algorithms for the identification of combined deterministic-stochastic systems. Automatica, 30:75-93, 1994. [14] K. Peternell, W. Scherrer, and M. Deistler. Statistical analysis of novel subspace iden- tification methods. Signal Processing, 52:161-177, 1996. [15] M. Verhaegen. Identification of the deterministic part of MIMO state space models given in innovations form from input-output data. Automatica, 30:61-74, 1994. [16] Jin Wang and S. Joe Qin. Closed-loop Subspace Identification Using the Parity Space. Revised for Automatica