The least-squares identification of FIR systems subject to worst-case noise
From MaRDI portal
Publication:1338062
DOI10.1016/0167-6911(94)90065-5zbMath0825.93991OpenAlexW2155199233MaRDI QIDQ1338062
Hüseyin Akçay, Håkan Hjalmarsson
Publication date: 17 November 1994
Published in: Systems \& Control Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0167-6911(94)90065-5
Related Items
Analysis of linear methods for robust identification in \(\ell_ 1\), Worst-case control-relevant identification, On the worst-case divergence of the least-squares algorithm, \(H_{\infty}\) set membership identification: a survey
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On covariance function tests used in system identification
- The least squares algorithm, parametric system identification and bounded noise
- Worst-case identification in \(\ell_ 2\): Linear and nonlinear algorithms
- Number theory in science and communication. With applications in cryptography, physics, digital information, computing, and self- similarity.
- The sample complexity of worst-case identification of FIR linear systems
- Properties of least squares estimates in set membership identification
- Robust approximate modelling of stable linear systems†
- Optimal asymptotic identification under bounded disturbances
- Asymptotic properties of black-box identification of transfer functions
- Robust identification and Galois sequences
- Control oriented system identification: a worst-case/deterministic approach in H/sub infinity /
- Asymptotic properties of the least-squares method for estimating transfer functions and disturbance spectra
- Algorithm 495: Solution of an Overdetermined System of Linear Equations in the Chebychev Norm [F4]
