Paper: A theoretical analysis of recursive identification methods

  • Authors:

  • T. Söderström;L. Ljung;I. Gustavsson

  • Affiliations:

  • Department of Automatic Control and Systems Analysis, Institute of Technology, Uppsala University, S-571 21 Uppsala, Sweden;Department of Electrical Engineering, Linköping University, S-581 83 Linköping, Sweden;Department of Automatic Control, Lund Institute of Technology, S-220 07 Lund, Sweden

  • Venue:
  • Automatica (Journal of IFAC)
  • Year:
  • 1978

Quantified Score

Hi-index 22.18

Visualization

Abstract

In this paper five different recursive identification methods will be analyzed and compared, namely recursive versions of the least squares method, the instrumental variable method, the generalized least squares method, the extended least squares method and the maximum likelihood method. They are shown to be similar in structure and need of computer storage and time. Making use of recently developed theory for asymptotic analysis of recursive stochastic algorithms, these methods are examined from a theoretical viewpoint. Possible convergence points and their global and local convergence properties are studied. The theoretical analysis is illustrated and supplemented by simulations.