Robust identification and Galois sequences
- 1 November 1991
- journal article
- research article
- Published by Taylor & Francis in International Journal of Control
- Vol. 54 (5) , 1189-1200
- https://doi.org/10.1080/00207179108934204
Abstract
Worst-case l1 identification is studied for BIBO stable linear shift-invariant systems. It is shown that the Chebyshev identification method when used with Galois input designs satisfies a certain robust convergence property and provides l1 model error bounds in worst-case identification of BIBO stable systems with a uniformly bounded noise set-up. The robust identification methodology developed is compatible with the modelling requirements of modern robust control design.Keywords
This publication has 12 references indexed in Scilit:
- Linear and nonlinear algorithms for identification in H∞ with error boundsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1991
- Worst Case System Identification in l1: Optimal Algorithms and Error BoundsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1991
- Approximation and identification of continuous-time systemsInternational Journal of Control, 1990
- Linear Control Theory with an ${\bf H}_\infty $ Optimality CriterionSIAM Journal on Control and Optimization, 1987
- l^{1}-optimal feedback controllers for MIMO discrete-time systemsIEEE Transactions on Automatic Control, 1987
- From time series to linear system—Part IIIAutomatica, 1987
- Optimal rejection of persistent bounded disturbancesIEEE Transactions on Automatic Control, 1986
- Minimax frequency domain performance and robustness optimization of linear feedback systemsIEEE Transactions on Automatic Control, 1985
- Feedback and optimal sensitivity: Model reference transformations, multiplicative seminorms, and approximate inversesIEEE Transactions on Automatic Control, 1981
- Algorithm 495: Solution of an Overdetermined System of Linear Equations in the Chebychev Norm [F4]ACM Transactions on Mathematical Software, 1975