An efficient algorithm for the tensor product model transformation
International Journal of Control Automation and Systems(2016)
Abstract
The tensor-product (TP) model transformation was proposed recently as a numerical and automatically executable method which is capable of transforming linear parameter varying (LPV) state-space models into the higher order singular value decomposition (HOSVD) based canonical form of polytopic models. The crucial disadvantage of the TP model transformation is that its computational load explodes with the density of discretization and the dimensionality of the parameter vector of the parameter-varying state-space model. In this paper we propose a new algorithm that leads to considerable reduction of the computation in the TP model transformation. The main idea behind the modified algorithm is to minimize the number of discretized points to acquire as much information as possible. The modified TP model transformation can readily be executed on a regular computer efficiently and concisely, especially in higher dimensional cases when the original TP model transformation fails. The paper also presents numerical examples to show the effectiveness of the new algorithm.
MoreTranslated text
Key words
HOSVD, LPV models, polytopic models, TP model transformation, uniform design
AI Read Science
Must-Reading Tree
Example
![](https://originalfileserver.aminer.cn/sys/aminer/pubs/mrt_preview.jpeg)
Generate MRT to find the research sequence of this paper
Chat Paper
Summary is being generated by the instructions you defined