Consistency and asymptotic normality of some subspace algorithms for systems without observed inputs (Q1301438)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1331898
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Consistency and asymptotic normality of some subspace algorithms for systems without observed inputs |
scientific article; zbMATH DE number 1331898 |
Statements
Consistency and asymptotic normality of some subspace algorithms for systems without observed inputs (English)
0 references
2 September 1999
0 references
For a class of subspace algorithms, in the case where no observed inputs are included, the asymptotic properties of the estimates of the system matrices are discussed. One proves the asymptotic normality of subspace estimates and that the variance may be calculated. A new consistency result for the system matrix is presented.
0 references
identification
0 references
asymptotic analysis
0 references
discrete time systems
0 references
linear multivariable systems
0 references
subspace algorithms
0 references
asymptotic normality
0 references
consistency
0 references
0.834293007850647
0 references
0.8336359262466431
0 references
0.8334172964096069
0 references
0.819144070148468
0 references
