2021International Journal of Robust and Nonlinear ControlRequires access

An efficient recursive identification algorithm for multilinear systems based on tensor decomposition

Yanjiao Wang, Ling Yang

Open publisher page 107 citations

Abstract

Abstract 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.

About this research paper

What this paper is about

Abstract 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.

Why it matters

OpenAlex reports 107 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Abstract 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.

Key concepts: Multilinear map, Tensor decomposition, Tensor (intrinsic definition), Identification (biology), Multilinear algebra, Gaussian, Dimension (graph theory), System identification

Related papers

Back to paper searchBrowse research topicsOriginal source
An efficient recursive identification algorithm for multilinear systems based on tensor decomposition — Research Paper | ScholarLens