An efficient implementation of maximum likelihood identification of LTI state-space models by local gradient search
Authors:
- V. VerdultVVV. Verdult
- M.H.G. VerhaegenMVM.H.G. Verhaegen
- 27 August 2003
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 1 (01912216) , 616-621
Abstract
We present a numerically efficient implementation of the nonlinear least squares and maximum likelihood identification of multivariable linear time-invariant (LTI) state-space models. This implementation is based on a local parameterization of the system and a gradient search in the resulting parameter space. The output error identification problem is discussed, and its extension to maximum likelihood identification is explained. We show that the maximum likelihood framework yields parameter errors that converge to the Cramer-Rao bound. Furthermore, the implementation is shown to be fast and able to handle large sample size problems.Keywords
This publication has 5 references indexed in Scilit:
- Maximum likelihood identification of multivariable bilinear state-space systems by projected gradient search2003
- Identification of Linear Parameter-Varying Systems Using Nonlinear ProgrammingJournal of Dynamic Systems, Measurement, and Control, 1999
- Statistical analysis of novel subspace identification methodsSignal Processing, 1996
- Subspace model identification Part 3. Analysis of the ordinary output-error state-space model identification algorithmInternational Journal of Control, 1993
- Balanced realizations: canonical form, parametrization, model reductionInternational Journal of Control, 1987