On the metric complexity of casual linear systems: ε -Entropy and ε -Dimension for continuous time

From MaRDI portal
Publication:4190502

DOI10.1109/TAC.1979.1101976zbMath0404.93005MaRDI QIDQ4190502

George Zames

Publication date: 1979

Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)




Related Items

Metric entropy limits on recurrent neural network learning of linear dynamical systemsA survey of randomized algorithms for control synthesis and performance verificationLaguerre methods andHidentification of continuous-time systemsUnnamed ItemWorst-case identification of nonlinear fading memory systemsLQG optimal and robust controller design for nonlinear stochastic systems: Multivariable caseEstimation of model qualityModelling of uncertain systems via linear programmingMultiple model adaptive control. Part 1: Finite controller coveringsWorst-case input-output identificationContinuous trajectory planning of mobile sensors for informative forecastingTask reliability assessment in robotic systemsThe cost of complexity in system identification: the output error caseOn identification of stable systems and optimal approximationOn the sample-complexity of ?? identificationA class of algorithms for identification in \(\mathcal H_{\infty}\)On metric dimensions of discrete-time systemsWorst case system identification in \(\ell{}_ 1\): Optimal algorithms and error boundsNecessary and sufficient conditions for robust identification of uncertain LTIstemsAnalytic formulation of the principle of increasing precision with decreasing intelligence for intelligent machinesThe sample complexity of worst-case identification of FIR linear systemsAnalysis of an extremum-secking nonlinear systemAnalytical design of intelligent machinesEntropy of generating series for nonlinear input-output systems and their interconnectionsRobust approximate modelling of stable linear systems†