An efficient recursive identification algorithm for multilinear systems based on tensor decomposition
There are many important fields involving the multilinear system identification. A great number of parameters to be identified is an important challenge, leading to the need for tensorial decomposition and modeling of such systems. This article is about the parameter estimation of the higher‐order m...
Saved in:
Published in | International journal of robust and nonlinear control Vol. 31; no. 16; pp. 7920 - 7936 |
---|---|
Main Authors | , |
Format | Journal Article |
Language | English |
Published |
Bognor Regis
Wiley Subscription Services, Inc
10.11.2021
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | There are many important fields involving the multilinear system identification. A great number of parameters to be identified is an important challenge, leading to the need for tensorial decomposition and modeling of such systems. This article is about the parameter estimation of the higher‐order multilinear systems with non‐Gaussian noises and to explore the role of tensor algebra in the multilinear model identification. A high‐dimension system identification problem is reformulated in terms of low‐dimension problems by using the tensorial decomposition technique. Further, applying the multi‐innovation identification theory, the recursive algorithm combining with the logarithmic p‐norms is investigated for multilinear systems with non‐Gaussian noises of low computational complexity. Finally, some simulation results illustrate the effectiveness of the proposed recursive identification method. |
---|---|
Bibliography: | Funding information National Natural Science Foundation of China, 61903095 ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
ISSN: | 1049-8923 1099-1239 |
DOI: | 10.1002/rnc.5718 |