A question of ``complexity'' (Q2772791)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A question of ``complexity |
scientific article; zbMATH DE number 1708230
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A question of ``complexity'' |
scientific article; zbMATH DE number 1708230 |
Statements
7 October 2002
0 references
worst-case identification
0 references
complexity
0 references
0 references
0 references
0 references
0 references
0 references
0.8417754
0 references
0 references
A question of ``complexity'' (English)
0 references
These two pages contain some remarks on time- and frequency-domain worst-case identification problems. The complexity of the identification is the minimum number of observations or functionals required to obtain an estimate within a given error and given noise bound. A few comments on previous works and results are made.NEWLINENEWLINEFor the entire collection see [Zbl 0972.00019].
0 references
