Randomised subspace system identification: complexities and error bounds
Recently, a novel randomised subspace system identification method (RandSID) for estimating LTI state-space models was proposed in Kedia, V., & Chakraborty, D. (2023), which aimed to address the computational issues faced by traditional subspace identification methods when the recorded dataset i...
Gespeichert in:
| Veröffentlicht in: | International journal of control Jg. 98; H. 12; S. 2835 - 2846 |
|---|---|
| Hauptverfasser: | , |
| Format: | Journal Article |
| Sprache: | Englisch |
| Veröffentlicht: |
Abingdon
Taylor & Francis
02.12.2025
Taylor & Francis Ltd |
| Schlagworte: | |
| ISSN: | 0020-7179, 1366-5820 |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Zusammenfassung: | Recently, a novel randomised subspace system identification method (RandSID) for estimating LTI state-space models was proposed in Kedia, V., & Chakraborty, D. (2023), which aimed to address the computational issues faced by traditional subspace identification methods when the recorded dataset is large. In this article, we propose a modified version of RandSID and analyse the complexity of this proposed algorithm in terms of memory cost, data movement, flop count and computation time, and quantitatively establish the computational advantages over conventional algorithms. Further, we derive a bound on the ratio of mean squared errors for the proposed and conventional algorithms, thereby characterising the loss of accuracy specifically due to randomisation. The effectiveness of the proposed algorithm is established by various real and simulated case studies. |
|---|---|
| Bibliographie: | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| ISSN: | 0020-7179 1366-5820 |
| DOI: | 10.1080/00207179.2025.2485169 |