DocumentCode :
1444639
Title :
On system identification of complex systems from finite data
Author :
Venkatesh, Saligrama R. ; Dahleh, Munther A.
Author_Institution :
Lab. for Inf. & Decision Syst., MIT, Cambridge, MA, USA
Volume :
46
Issue :
2
fYear :
2001
fDate :
2/1/2001 12:00:00 AM
Firstpage :
235
Lastpage :
257
Abstract :
We introduce a new principle for identification based on choosing a model from the model-parameterization, which best approximates the unknown real system belonging to a more complex space of systems that do not lend themselves to a finite-parameterization. The principle is particularly effective for robust control as it leads to a precise notion of parametric and nonparametric error, and the identification problem can be equivalently perceived as that of robust convergence of the parameters in the face of unmodeled errors. The main difficulty in its application stems from the interplay of noise and unmodeled dynamics and requires developing novel two-step algorithms that amount to annihilation of the unmodeled error followed by averaging out the noise. The paper establishes: robust convergence for a large class of systems, topologies, and unmodeled errors; sample path based finite-time polynomial rate of convergence; and annihilation-correlation algorithms for linearly parameterized model structures
Keywords :
convergence; identification; large-scale systems; linear systems; polynomials; robust control; statistical analysis; annihilation-correlation algorithms; complex systems; convergence; linear time invariant systems; model-parameterization; polynomial sample complexity; robust control; statistical analysis; system identification; Context modeling; Convergence; Error correction; Mathematical model; Noise robustness; Polynomials; Robust control; System identification; Topology; Uncertainty;
fLanguage :
English
Journal_Title :
Automatic Control, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9286
Type :
jour
DOI :
10.1109/9.905690
Filename :
905690
Link To Document :
بازگشت