Low-Rank Tensor Recovery For Jacobian-Based Volterra Identification Of Parallel Wiener-Hammerstein Systems

IFAC PAPERSONLINE(2021)

引用 1|浏览7
暂无评分
摘要
We consider the problem of identifying a parallel Wiener-Hammerstein structure from Volterra kernels. Methods based on Volterra kernels typically resort to coupled tensor decompositions of the kernels. However, in the case of parallel Wiener-Hammerstein systems, such methods require nontrivial constraints on the factors of the decompositions. In this paper, we propose an entirely different approach: by using special sampling (operating) points for the Jacobian of the nonlinear map from past inputs to the output, we can show that the Jacobian matrix becomes a linear projection of a tensor whose rank is equal to the number of branches. This representation allows us to solve the identification problem as a tensor recovery problem. Copyright (C) 2021 The Authors.
更多
查看译文
关键词
Block structured system identification, parallel Wiener-Hammerstein systems, Volterra kernels, low-rank tensor recovery, canonical polyadic decomposition
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要