DocumentCode
2994100
Title
An adaptive recursive-least-squares identification algorithm
Author
Panuska, V.
Author_Institution
Sir George Williams University, Montreal, Quebec, Canada
fYear
1969
fDate
17-19 Nov. 1969
Firstpage
65
Lastpage
65
Abstract
A new algorithm for identification from input-output measurements of a canonical form for discrete-time linear systems with disturbances having rational spectral densities is obtained by a formal application of the recursive least squares formula. Although in this case the assumptions of the least squares method are violated, the algorithm is shown to converge in mean square using a stochastic approximation proof. The proposed algorithm is computationally more expensive than the corresponding stochastic approximation formula [1], but converges much faster and there are no problems with choice of the gain constant. The complexity of the algorithm still compares favourably with other methods [2], [3], owing to its on-line structure.
Keywords
Approximation algorithms; Convergence; Density measurement; Electric variables measurement; Least squares approximation; Least squares methods; Linear systems; Stochastic processes; Stochastic systems; Vectors;
fLanguage
English
Publisher
ieee
Conference_Titel
Adaptive Processes (8th) Decision and Control, 1969 IEEE Symposium on
Conference_Location
University Park, PA, USA
Type
conf
DOI
10.1109/SAP.1969.269931
Filename
4044584
Link To Document