Complexity of identification of linear systems with rational transfer functions
The main objective of the paper is to study the complexity of the identification of the impulse response \(h\) of a linear time-invariant system by measuring the system's response to a carefully chosen input signal \(n\). In particular, the authors consider the complexity of word-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 a specific noise level \(\delta\) and tolerance levels \(\tau\), 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), it is shown that the complexity is \(O(n^2)\) for the \(H^\infty\) norm, \(O(n)\) for the \(l^2\) norm, and exponential in \(n\) for the \(l^1\) norm, for each \(\delta\) and \(\tau\). It is also shown that these bounds are tight. For the continuous-time case it is shown that the input signals may be compactly supported step functions with equally spaced nodes. It is shown, however that the internodal spacing must approach \(0\) as \(n\) increases.
- Fractional covers for convolution products
- scientific article; zbMATH DE number 42051 (Why is no real title available?)
- scientific article; zbMATH DE number 1021637 (Why is no real title available?)
- scientific article; zbMATH DE number 829787 (Why is no real title available?)
- scientific article; zbMATH DE number 903630 (Why is no real title available?)
- Information-based complexity and nonparamteric worst-case system identification
- On approximation of stable linear dynamical systems using Laguerre and Kautz functions
- On the time complexity of worst-case system identification
- Relating \(H_{2}\) and \(H_{\infty}\) bounds for finite-dimensional systems
- Robust identification and Galois sequences
- Robust identification in the disc algebra using rational wavelets and orthonormal basis functions
- Sample complexity of worst-case H^-identification
- The sample complexity of worst-case identification of FIR linear systems
- Worst-case control-relevant identification
- Worst-case identification in \(\ell_ 2\): Linear and nonlinear algorithms
- Sample complexity of worst-case H^-identification
- Input-output identifiability of continuous-time linear systems
- Complexity of identification of input-output systems
- On the sample-complexity of \({\mathcal H}_\infty\) identification
- On the identification of certain rational transfer functions from truncated autocovariance sequences
- Time complexity and model complexity of fast identification of continuous-time LTI systems
- Learning Complexity Dimensions for a Continuous-Time Control System
- Optimal conditional estimation: Average case setting
- Accelerated identification algorithms for rational models based on the vector transformation
- The cost of complexity in system identification: the output error case
- Convergence analysis of central and minimax algorithms in scalar regressor models
- On input design in \(\ell_{\infty}\) conditional set membership identification
- On the complexity of piecewise affine system identification
- Identifiability and excitation of linearly parametrized rational systems
This page was built for publication: Complexity of identification of linear systems with rational transfer functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1276392)
