On the metric complexity of continuous-time systems

DOI10.1002/(SICI)1099-1239(199604)6:3%3C221::AID-RNC148%3E3.0.CO;2-FMaRDI QIDQ4882303zbMATH OpenOpenAlexFDO

Authors Lin Lin, Le Yi Wang

Publication date 18 July 1996

Full work available at URL https://doi.org/10.1002/(sici)1099-1239(199604)6:3%3C221::aid-rnc148%3E3.0.co;2-f

zbMATH Keywords

metric complexitiessampling \(n\)-widthstime-domain sampling

Mathematics Subject Classification ID

Control/observation systems with incomplete information (93C41) Sampled-data control/observation systems (93C57)

Recommendations

• Time complexity and model complexity of fast identification of continuous-time LTI systems
• scientific article; zbMATH DE number 4171706
• scientific article; zbMATH DE number 18186
• A generalized sampling theory without band-limiting constraints

Cited in

(2)

• Uncertainty, information and complexity in identification and control
• Automata, Languages and Programming

This page was built for publication: On the metric complexity of continuous-time systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4882303)