Logo image
Back
Complexity of identification of linear systems with rational transfer functions
Journal article   Peer reviewed

Complexity of identification of linear systems with rational transfer functions

K.J. Harrison, J.R. Partington and J.A. Ward
Mathematics of Control, Signals, and Systems, Vol.11(4), pp.265-288
1998
DOI: https://doi.org/10.1007/BF02750393
url
Link to Published Version *Subscription may be requiredView

Abstract

We study the complexity of worst-case time-domain identification of linear time-invariant systems using model sets consisting of degree-n rational models with poles in a fixed region of the complex plane. For specific noise level δ and tolerance levels τ, the number of required output samples and the total sampling time should be as small as possible. In discrete time, using known fractional covers for certain polynomial spaces (with the same norm), we show that the complexity is O(n 2) for the H ∞ norm, O(n) for the ℓ 2 norm, and exponential in n for the ℓ 1 norm, for each δ and τ. We also show that these bounds are tight. For the continuous-time case we prove analogous results, and show that the input signals may be compactly supported step functions with equally spaced nodes. We show, however, that the internodal spacing must approach 0 as n increases.

Details

Metrics

39 Record Views
6 Times Cited - Web of Science

InCites Highlights

These are selected metrics from InCites Benchmarking & Analytics tool, related to this output

Collaboration types
Domestic collaboration
International collaboration
Citation topics
4 Electrical Engineering, Electronics & Computer Science
4.29 Automation & Control Systems
4.29.1383 System Identification
Web Of Science research areas
Automation & Control Systems
Engineering, Electrical & Electronic
Mathematics, Interdisciplinary Applications
ESI research areas
Engineering
Logo image