Abstract
This paper considers the identification problem of linear control systems by use of stochastic approximation. There are two approaches to constructing models based on stochastic approximation: dynamical model approach and finite memory model one. In the former approach Saridis and Stein [1] have obtained the most general results. And in the latter approach Holmes [2] has established an algorithm giving an unbiased estimate. But it is common with these two works that (i) only white noise sequence is allowed for the input sequence and (ii) the updating of the estimates occurs at every finite time interval.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
G. N. Saridis and G. Stein, “A New Algorithm for Linear System Identification,” IEEE Trans. on Automatic Control, Vol. AC-13, pp. 592–595, 1968.
J. K. Holmes, “Two Stochastic Approximation Procedures for Identifying Linear Systems,” IEEE Trans. on Automatic Control, Vol. AC-14, pp. 292–295, 1969.
K. Izawa and K. Furuta, “Process Identification Using Correlation Coefficient,” IFAC Symp. on Identification in Automatic Control Systems, 1967.
A. E. Albert and L. A. Gardner, Stochastic Approximation and Nonlinear Regression, MIT Press, 1967.
K. Knopp, Theory and Application of Infinite Series, Hafner, 1947.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1971 Plenum Press, New York
About this chapter
Cite this chapter
Funahashi, Y., Nakamura, K. (1971). Stochastic Approximation Algorithms for System Identification Using Normal Operating Data. In: Fu, K.S. (eds) Pattern Recognition and Machine Learning. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-7566-5_7
Download citation
DOI: https://doi.org/10.1007/978-1-4615-7566-5_7
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4615-7568-9
Online ISBN: 978-1-4615-7566-5
eBook Packages: Springer Book Archive