DocumentCode
2106434
Title
Time complexity and model complexity of fast identification
Author
Lin, Lin ; Wang, Le Yi
Author_Institution
Dept. of Electr. Eng., McGill Univ., Montreal, Que., Canada
fYear
1993
fDate
15-17 Dec 1993
Firstpage
2099
Abstract
Gel´fand and Kolmogorov n-widths are used to describe the time complexity and model complexity of as identification process, and inequalities relating these n-widths are obtained. The optimal n-parameter affine models for a class of a priori data sets are obtained through n-width estimation. A “spectrum flatness” property of an input is shown to characterize its identifying capability
Keywords
computational complexity; discrete time systems; identification; information theory; set theory; Gel´fand-Kolmogorov n-widths; data sets; discrete time systems; fast identification; inequalities; information acquisition; information processing; metric complexity; model complexity; model set selection; optimal n-parameter affine models; spectrum flatness; time complexity; Art; Control systems; Convolution; Kernel; Noise measurement; Robust control; State estimation; State-space methods; Transfer functions; Uncertainty;
fLanguage
English
Publisher
ieee
Conference_Titel
Decision and Control, 1993., Proceedings of the 32nd IEEE Conference on
Conference_Location
San Antonio, TX
Print_ISBN
0-7803-1298-8
Type
conf
DOI
10.1109/CDC.1993.325569
Filename
325569
Link To Document