Complexity of identification of linear systems with rational transfer functions

DOI10.1007/BF02750393zbMath0917.93013OpenAlexW2106759140WikidataQ56319474 ScholiaQ56319474MaRDI QIDQ1276392

K. Appert

Publication date: 11 August 1999

Published in: MCSS. Mathematics of Control, Signals, and Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02750393

zbMATH Keywords

ARX modelsimpulse responsesample complexityfractional coverscomplexity of identification

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) System identification (93B30) Linear systems in control theory (93C05)

Related Items (4)

Convergence analysis of central and minimax algorithms in scalar regressor models ⋮ On input design in \(\ell_{\infty}\) conditional set membership identification ⋮ Optimal conditional estimation: Average case setting ⋮ Input-output identifiability of continuous-time linear systems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Relating \(H_{2}\) and \(H_{\infty}\) bounds for finite-dimensional systems
• Worst-case identification in \(\ell_ 2\): Linear and nonlinear algorithms
• Information-based complexity and nonparamteric worst-case system identification
• Sample complexity of worst-case \(H^\infty\)-identification
• The sample complexity of worst-case identification of FIR linear systems
• Worst-case control-relevant identification
• On approximation of stable linear dynamical systems using Laguerre and Kautz functions
• Fractional covers for convolution products
• Robust identification and Galois sequences
• On the time complexity of worst-case system identification
• Robust identification in the disc algebra using rational wavelets and orthonormal basis functions

This page was built for publication: Complexity of identification of linear systems with rational transfer functions