|Título||Identification and the information matrix : how to get just sufficiently rich?
Bazanella, Alexandre Sanfelice
|Abstract||In prediction error identification, the information matrix plays a central role. Specifically, when the system is in the model set, the covariance matrix of the parameter estimates converges asymptotically, up to a scaling factor, to the inverse of the information matrix. The existence of a finite covariance matrix thus depends on the positive definiteness of the information matrix, and the rate of convergence of the parameter estimate depends on its “size”. The information matrix is also the key tool in the solution of optimal experiment design procedures, which have become a focus of recent attention. Introducing a geometric framework, we provide a complete analysis, for arbitrary model structures, of the minimum degree of richness required to guarantee the nonsingularity of the information matrix. We then particularize these results to all commonly used model structures, both in open loop and in closed loop. In a closed-loop setup, our results provide an unexpected and precisely quantifiable trade-off between controller degree and required degree of external excitation.
|Contido em||IEEE transactions on automatic control. New York. Vol. 54, no. 12 (Dec. 2009), p. 2828-2840
[en] Information matrix
[en] Input richness
[en] Transfer of excitation
|Tipo||Artigo de periódico
|000736439.pdf (599.5Kb)||Texto completo (inglês)||Adobe PDF||Visualizar/abrir|
Este item está licenciado na Creative Commons License