The Cost of Complexity in System Identification: Frequency Function Estimation of Finite Impulse Response Systems

被引:15
作者
Rojas, Cristian R. [1 ]
Syberg, Marta Barenthin [1 ]
Welsh, James S. [2 ]
Hjalmarsson, Hakan [1 ]
机构
[1] Stockholm KTH, ACCESS Linnaeus Ctr, Sch Elect Engn, S-10044 Stockholm, Sweden
[2] Univ Newcastle, Sch Elect Engn & Comp Sci, Newcastle, NSW 2308, Australia
关键词
Asymptotic; finite-impulse response (FIR); linear matrix inequalities (LMIs); EXPERIMENT DESIGN; INPUT-DESIGN; MODEL; DIMENSION;
D O I
10.1109/TAC.2010.2063470
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In this paper, we consider full order modeling, i.e., when the true system belongs to the model set. We investigate the minimum amount of input energy required to estimate a given linear system with a full order model within a prescribed degree of accuracy gamma, as a function of the model complexity. This quantity we define to be the "cost of complexity." The degree of accuracy is measured by the inverse of the maximum variance of the discrete-time frequency function estimator over a given frequency range [-omega(B), omega(B)]. It is commonly believed that the cost increases as the model complexity increases. However, the amount of information that is to be extracted from the system also influences the cost. The objective of this paper is to quantify these dependencies for systems described by finite-impulse response models. It is shown that, asymptotically in the model order and sample size, the cost is well approximated by gamma sigma(2)(o)n omega(B)/pi where sigma(2)(o)is the noise variance. This expression can be used as a simple rule of thumb for assessing trade-offs that have to be made in a system identification project where full order models are used. For example, for given experiment duration, excitation level and desired accuracy, one can assess how the achievable frequency range depends on the required model order. This type of consideration is useful when formally planning experiments. In addition, we establish several properties of the cost of complexity. We find, for example, that if omega(B) is very close (but not necessarily equal) to pi, the optimal input satisfies the model quality constraint for all frequencies.
引用
收藏
页码:2298 / 2309
页数:12
相关论文
共 42 条
[1]  
[Anonymous], 1999, SYSTEM IDENTIFICATIO
[2]  
Bartle R. G., 1966, ELEMENTS INTEGRATION
[3]   Least costly identification experiment for control [J].
Bombois, X. ;
Scorletti, G. ;
Gevers, M. ;
Van den Hof, P. M. J. ;
Hildebrand, R. .
AUTOMATICA, 2006, 42 (10) :1651-1662
[4]   Cheapest open-loop identification for control [J].
Bombois, X ;
Scorletti, G ;
Gevers, A ;
Hildebrand, R ;
Van den Hof, P .
2004 43RD IEEE CONFERENCE ON DECISION AND CONTROL (CDC), VOLS 1-5, 2004, :382-387
[5]  
Bombois X, 2004, P AMER CONTR CONF, P2818
[6]  
Boyd S., 1994, LINEAR MATRIX INEQUA
[7]   From finite covariance windows to modeling filters: A convex optimization approach [J].
Byrnes, CI ;
Gusev, SV ;
Lindquist, A .
SIAM REVIEW, 2001, 43 (04) :645-675
[8]  
Cox DR., 1958, Planning of experiments
[9]   ON CONTINUITY OF MINIMUM SET OF A CONTINUOUS FUNCTION [J].
DANTZIG, GB ;
FOLKMAN, J ;
SHAPIRO, N .
JOURNAL OF MATHEMATICAL ANALYSIS AND APPLICATIONS, 1967, 17 (03) :519-&
[10]   Uniformly improving the Cramer-Rao bound and maximum-likelihood estimation [J].
Eldar, Yonina C. .
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2006, 54 (08) :2943-2956