2005
DOI: 10.1016/j.automatica.2004.11.012
|View full text |Cite
|
Sign up to set email alerts
|

Asymptotic properties of subspace estimators

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

1
58
0
3

Year Published

2006
2006
2021
2021

Publication Types

Select...
5
3
1

Relationship

0
9

Authors

Journals

citations
Cited by 91 publications
(62 citation statements)
references
References 35 publications
1
58
0
3
Order By: Relevance
“…Along this line, it is of interest to extend the nonparametric paradigm to the design of optimal predictors. By the way, predictor estimation, beyond being of interest on its own, is the preliminary step of subspace identification methods [9], [10], [11], [12]. Therefore, improving predictor design may enhance performance of subspace identification methods as well.…”
Section: Introductionmentioning
confidence: 99%
“…Along this line, it is of interest to extend the nonparametric paradigm to the design of optimal predictors. By the way, predictor estimation, beyond being of interest on its own, is the preliminary step of subspace identification methods [9], [10], [11], [12]. Therefore, improving predictor design may enhance performance of subspace identification methods as well.…”
Section: Introductionmentioning
confidence: 99%
“…In parallel, a large number of subspace identification methods (SIM) have been developed since the 90's (see e.g. (Verhaegen, 1994;Van Overschee and De Moor, 1996) and (Viberg, 1995;Bauer, 2005) for relevant overviews). One of the reasons for the success of SIM lies in the direct correspondence between geometric operations on matrices constructed from input/output data and their implementation in terms of well known, stable and reliable algorithms from the field of numerical linear algebra.…”
Section: Introductionmentioning
confidence: 99%
“…The latter problem has been studied extensively in the literature and numerous algorithms exist to solve it [22,14,20,21,2]. This means that using any of these algorithms 9 solves the problem of determining the matrices A, B, C, D.…”
Section: Identification Of the Matrices A B C Dmentioning
confidence: 99%
“…This is a linear identification problem that has been studied extensively in the literature, see for example [22,14,20,21,2] and references therein. Let M be some identification algorithm that allows the determination of the unknown matrices of the linear system, using some appropriate identification input ϑ.…”
Section: Second Stage: Identification Of the Matrices A B C Dmentioning
confidence: 99%