The sample complexity of worst-case identification of FIR linear systems
- 31 March 1993
- journal article
- Published by Elsevier in Systems & Control Letters
- Vol. 20 (3) , 157-166
- https://doi.org/10.1016/0167-6911(93)90057-d
Abstract
No abstract availableThis publication has 5 references indexed in Scilit:
- Linear and nonlinear algorithms for identification in H/sub infinity / with error boundsIEEE Transactions on Automatic Control, 1992
- Robust convergence of two-stage nonlinear algorithms for identification in ∞Systems & Control Letters, 1992
- Control oriented system identification: a worst-case/deterministic approach in H/sub infinity /IEEE Transactions on Automatic Control, 1991
- Optimal algorithms theory for robust estimation and predictionIEEE Transactions on Automatic Control, 1985
- On the metric complexity of casual linear systems: ε -Entropy and ε -Dimension for continuous timeIEEE Transactions on Automatic Control, 1979