Modified recursive least squares algorithm for sparse system identification
To adapt to the sparsity of some sparse systems in system identification, a novel modified recursive least squares algorithm is proposed. This algorithm utilizes the output error to control the value of forgetting factor, which deals with the contradiction between convergence rate and stationary mis...
Uložené v:
| Vydané v: | 2015 7th International Conference on Modelling, Identification and Control (ICMIC) s. 1 - 5 |
|---|---|
| Hlavní autori: | , , |
| Médium: | Konferenčný príspevok.. |
| Jazyk: | English |
| Vydavateľské údaje: |
University of Al Qayrawan, Tunisia
01.12.2015
|
| Predmet: | |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Shrnutí: | To adapt to the sparsity of some sparse systems in system identification, a novel modified recursive least squares algorithm is proposed. This algorithm utilizes the output error to control the value of forgetting factor, which deals with the contradiction between convergence rate and stationary misadjustment. In addition, through the introduction of zero attractor in parameters' iterations, the proposed algorithm improves the convergence rate of zero and near-zero parameters dominating sparse systems. The simulation results indicate that the algorithm proposed in this paper can effectively strengthen the accuracy of sparse system identification. |
|---|---|
| DOI: | 10.1109/ICMIC.2015.7409458 |