An efficient hierarchical identification method for general dual-rate sampled-data systems
For the lifted input–output representation of general dual-rate sampled-data systems, this paper presents a decomposition based recursive least squares (D-LS) identification algorithm using the hierarchical identification principle. Compared with the recursive least squares (RLS) algorithm, the prop...
Saved in:
| Published in: | Automatica (Oxford) Vol. 50; no. 3; pp. 962 - 970 |
|---|---|
| Main Authors: | , , |
| Format: | Journal Article |
| Language: | English |
| Published: |
Kidlington
Elsevier Ltd
01.03.2014
Elsevier |
| Subjects: | |
| ISSN: | 0005-1098, 1873-2836 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | For the lifted input–output representation of general dual-rate sampled-data systems, this paper presents a decomposition based recursive least squares (D-LS) identification algorithm using the hierarchical identification principle. Compared with the recursive least squares (RLS) algorithm, the proposed D-LS algorithm does not require computing the covariance matrices with large sizes and matrix inverses in each recursion step, and thus has a higher computational efficiency than the RLS algorithm. The performance analysis of the D-LS algorithm indicates that the parameter estimates can converge to their true values. A simulation example is given to confirm the convergence results. |
|---|---|
| ISSN: | 0005-1098 1873-2836 |
| DOI: | 10.1016/j.automatica.2013.12.025 |