The sample complexity of worst-case identification of FIR linear systems (Q1803842): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5671986 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3686615 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust convergence of two-stage nonlinear algorithms for identification in \({\mathcal H}_ \infty\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear and nonlinear algorithms for identification in H/sub infinity / with error bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Control oriented system identification: a worst-case/deterministic approach in H/sub infinity / / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3356164 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst case system identification in \(\ell{}_ 1\): Optimal algorithms and error bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust identification and Galois sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis of linear methods for robust identification in \(\ell_ 1\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal algorithms theory for robust estimation and prediction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3352944 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3883494 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993279 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal asymptotic identification under bounded disturbances / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the metric complexity of casual linear systems: ε -Entropy and ε -Dimension for continuous time / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 16:56, 17 May 2024

scientific article
Language Label Description Also known as
English
The sample complexity of worst-case identification of FIR linear systems
scientific article

    Statements

    The sample complexity of worst-case identification of FIR linear systems (English)
    0 references
    29 June 1993
    0 references
    worst-case identification
    0 references
    sample complexity
    0 references
    finite impulse response
    0 references

    Identifiers